<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0348726</ARLID> <utime>20240103194028.9</utime><mtime>20101101235959.9</mtime>   <WOS>000281990900001</WOS> <SCOPUS>78149286082</SCOPUS>  <DOI>10.1109/TPAMI.2010.34.</DOI>           <title language="eng" primary="1">Evaluating Stability and Comparing Output of Feature Selectors that Optimize Feature Subset Cardinality</title>  <specification> <page_count>19 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0256725</ARLID><ISSN>0162-8828</ISSN><title>IEEE Transactions on Pattern Analysis and Machine Intelligence</title><part_num/><part_title/><volume_id>32</volume_id><volume>11 (2010)</volume><page_num>1921-1939</page_num><publisher><place/><name>IEEE Computer Society</name><year/></publisher></serial>    <keyword>feature selection</keyword>   <keyword>feature stability</keyword>   <keyword>stability measures</keyword>   <keyword>similarity measures</keyword>   <keyword>sequential search</keyword>   <keyword>individual ranking</keyword>   <keyword>feature subset-size optimization</keyword>   <keyword>high dimensionality</keyword>   <keyword>small sample size</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101197</ARLID> <name1>Somol</name1> <name2>Petr</name2> <full_dept language="cz">Rozpoznávání obrazu</full_dept> <full_dept language="eng">Department of Pattern Recognition</full_dept> <department language="cz">RO</department> <department language="eng">RO</department> <institution>UTIA-B</institution> <full_dept>Department of Pattern Recognition</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101171</ARLID> <name1>Novovičová</name1> <name2>Jana</name2> <full_dept language="cz">Rozpoznávání obrazu</full_dept> <full_dept>Department of Pattern Recognition</full_dept> <department language="cz">RO</department> <department>RO</department> <institution>UTIA-B</institution>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2010/RO/somol-0348726.pdf</url> </source>        <cas_special> <project> <project_id>2C06019</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0216518</ARLID> </project> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>GA102/08/0593</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0239567</ARLID> </project> <project> <project_id>GA102/07/1594</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0228611</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">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.</abstract>     <reportyear>2011</reportyear>  <RIV>BD</RIV>     <unknown tag="mrcbC52"> 4 A 4a 20231122134215.1 </unknown>  <permalink>http://hdl.handle.net/11104/0189168</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE|ENGINEERINGELECTRICALELECTRONIC</unknown> <unknown tag="mrcbT16-f">7.534</unknown> <unknown tag="mrcbT16-g">0.625</unknown> <unknown tag="mrcbT16-h">9.5</unknown> <unknown tag="mrcbT16-i">0.04969</unknown> <unknown tag="mrcbT16-j">2.802</unknown> <unknown tag="mrcbT16-k">25060</unknown> <unknown tag="mrcbT16-l">176</unknown> <unknown tag="mrcbT16-q">200</unknown> <unknown tag="mrcbT16-s">3.513</unknown> <unknown tag="mrcbT16-y">38.34</unknown> <unknown tag="mrcbT16-x">8.38</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">99.374</unknown> <unknown tag="mrcbT16-C">99.465</unknown> <unknown tag="mrcbT16-D">Q1*</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <arlyear>2010</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: somol-0348726.pdf </unknown>    <unknown tag="mrcbU14"> 78149286082 SCOPUS </unknown> <unknown tag="mrcbU34"> 000281990900001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256725 IEEE Transactions on Pattern Analysis and Machine Intelligence 0162-8828 1939-3539 Roč. 32 č. 11 2010 1921 1939 IEEE Computer Society </unknown> </cas_special> </bibitem>