Number of the records: 1  

Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition

  1. 1.
    SYSNO ASEP0365937
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleFast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition
    Author(s) Somol, Petr (UTIA-B) RID
    Grim, Jiří (UTIA-B) RID, ORCID
    Pudil, P. (CZ)
    Source TitleProceedings of the IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2011). - Piscataway : IEEE, 2011 - ISBN 978-1-4577-0653-0
    Pagess. 502-509
    Number of pages8 s.
    Publication formCD-ROM - CD-ROM
    ActionThe 2011 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2011)
    Event date09.10.2011-12.10.2011
    VEvent locationAnchorage, Alaska
    CountryUS - United States
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordsfeature selection ; high dimensionality ; ranking ; classification ; machine learning
    Subject RIVIN - Informatics, Computer Science
    R&D Projects1M0572 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000298615100102
    DOI10.1109/ICSMC.2011.6083733
    AnnotationThe 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.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2012
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.