This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F05%3A00339941%21RIV10-MSM-67985807/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F05%3A00339941%21RIV10-MSM-67985807
rdf:type
n11:Vysledek skos:Concept
dcterms:description
Feature selection serves for both reduction of the total amount of available data (removing of valueless data) and improvement of the whole behavior of a given induction algorithm (removing data that cause deterioration of the results). A method of proper selection of features for an inductive algorithm is discussed. The main idea consists in proper descending ordering of features according to a measure of new information contributing to previous valuable set of features. The measure is based on comparing of statistical distributions of individual features including mutual correlation. A mathematical theory of the approach is described. Results of the method applied to real-life data are shown. Feature selection serves for both reduction of the total amount of available data (removing of valueless data) and improvement of the whole behavior of a given induction algorithm (removing data that cause deterioration of the results). A method of proper selection of features for an inductive algorithm is discussed. The main idea consists in proper descending ordering of features according to a measure of new information contributing to previous valuable set of features. The measure is based on comparing of statistical distributions of individual features including mutual correlation. A mathematical theory of the approach is described. Results of the method applied to real-life data are shown.
dcterms:title
Feature Selection by Reordering Feature Selection by Reordering
skos:prefLabel
Feature Selection by Reordering Feature Selection by Reordering
skos:notation
RIV/67985807:_____/05:00339941!RIV10-MSM-67985807
n3:aktivita
n10:P n10:Z
n3:aktivity
P(LN00B096), Z(AV0Z10300504)
n3:dodaniDat
n9:2010
n3:domaciTvurceVysledku
n18:9818898
n3:druhVysledku
n4:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
521475
n3:idVysledku
RIV/67985807:_____/05:00339941
n3:jazykVysledku
n21:eng
n3:klicovaSlova
feature selection; reordering; mutual corelation
n3:klicoveSlovo
n5:feature%20selection n5:mutual%20corelation n5:reordering
n3:kontrolniKodProRIV
[FBACBD070DC2]
n3:mistoKonaniAkce
Liptovský Ján
n3:mistoVydani
Berlin
n3:nazevZdroje
SOFSEM 2005: Theory and Practice of Computer Science
n3:obor
n7:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n12:LN00B096
n3:rokUplatneniVysledku
n9:2005
n3:tvurceVysledku
Jiřina, Marcel Jiřina jr., M.
n3:typAkce
n14:WRD
n3:wos
000228554400045
n3:zahajeniAkce
2005-01-22+01:00
n3:zamer
n19:AV0Z10300504
s:numberOfPages
5
n17:hasPublisher
Springer-Verlag
n20:isbn
3-540-24302-X