Number of the records: 1  

Evaluating Stability and Comparing Output of Feature Selectors that Optimize Feature Subset Cardinality

  1. 1.
    0348726 - ÚTIA 2011 RIV US eng J - Journal Article
    Somol, Petr - Novovičová, Jana
    Evaluating Stability and Comparing Output of Feature Selectors that Optimize Feature Subset Cardinality.
    IEEE Transactions on Pattern Analysis and Machine Intelligence. Roč. 32, č. 11 (2010), s. 1921-1939. ISSN 0162-8828. E-ISSN 1939-3539
    R&D Projects: GA MŠMT 1M0572; GA ČR GA102/08/0593; GA ČR GA102/07/1594
    Grant - others:GA MŠk(CZ) 2C06019
    Institutional research plan: CEZ:AV0Z10750506
    Keywords : feature selection * feature stability * stability measures * similarity measures * sequential search * individual ranking * feature subset-size optimization * high dimensionality * small sample size
    Subject RIV: BD - Theory of Information
    Impact factor: 5.027, year: 2010
    http://library.utia.cas.cz/separaty/2010/RO/somol-0348726.pdf

    Stability (robustness) of feature selection methods is a topic of recent interest, yet often neglected importance, with direct impact on the reliability of machine learning systems. We investigate the problem of evaluating the stability of feature selection processes yielding subsets of varying size. We introduce several novel feature selection stability measures and adjust some existing measures in a unifying framework that offers broad insight into the stability problem. We study in detail the properties of considered measures and demonstrate on various examples what information about the feature selection process can be gained. We also introduce an alternative approach to feature selection evaluation in the form of measures that enable comparing the similarity of two feature selection processes. These measures enable comparing, e.g., the output of two feature selection methods or two runs of one method with different parameters.
    Permanent Link: http://hdl.handle.net/11104/0189168

     
     
Number of the records: 1  

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