Počet záznamů: 1
Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition
- 1.
SYSNO ASEP 0365937 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Tvůrce(i) Somol, Petr (UTIA-B) RID
Grim, Jiří (UTIA-B) RID, ORCID
Pudil, P. (CZ)Zdroj.dok. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2011). - Piscataway : IEEE, 2011 - ISBN 978-1-4577-0653-0 Rozsah stran s. 502-509 Poč.str. 8 s. Forma vydání CD-ROM - CD-ROM Akce The 2011 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2011) Datum konání 09.10.2011-12.10.2011 Místo konání Anchorage, Alaska Země US - Spojené státy americké Typ akce WRD Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova feature selection ; high dimensionality ; ranking ; classification ; machine learning Vědní obor RIV IN - Informatika CEP 1M0572 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy CEZ AV0Z10750506 - UTIA-B (2005-2011) UT WOS 000298615100102 DOI 10.1109/ICSMC.2011.6083733 Anotace The paper addresses the problem of making dependency-aware feature selection feasible in pattern recognition problems of very high dimensionality. The idea of individually best ranking is generalized to evaluate the contextual quality of each feature in a series of randomly generated feature subsets. Each random subset is evaluated by a criterion function of arbitrary choice (permitting functions of high complexity). Eventually, the novel dependency-aware feature rank is computed, expressing the average benefit of including a feature into feature subsets. The method is efficient and generalizes well especially in very-high-dimensional problems, where traditional context-aware feature selection methods fail due to prohibitive computational complexity or to over-fitting. The method is shown well capable of over-performing the commonly applied individual ranking which ignores important contextual information contained in data. Pracoviště Ústav teorie informace a automatizace Kontakt Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Rok sběru 2012
Počet záznamů: 1