<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0410451</ARLID> <utime>20240103182214.0</utime><mtime>20060210235959.9</mtime>    <ISBN>0-7695-0750-6</ISBN>         <title language="eng" primary="1">Oscillating search algorithms for feature selection</title> <part_num>2</part_num> <part_title>Pattern Recognition and Neural Networks.</part_title>  <publisher> <place>Los Alamitos</place> <name>IEEE Computer Society</name> <pub_time>2000</pub_time> </publisher> <specification> <page_count>4 s.</page_count> </specification>   <serial><title>Proceedings of the 15th International Conference on Pattern Recognition</title><part_num/><part_title/><page_num>406-409</page_num><editor><name1>Sanfeliu</name1><name2>A.</name2></editor><editor><name1>Villanueva</name1><name2>J. J.</name2></editor><editor><name1>Vanrell</name1><name2>M.</name2></editor></serial>   <author primary="1"> <ARLID>cav_un_auth*0101197</ARLID> <name1>Somol</name1> <name2>Petr</name2> <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*0101182</ARLID> <name1>Pudil</name1> <name2>Pavel</name2> <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>   <source> <url>http://library.utia.cas.cz/separaty/historie/somol-oscillating search algorithms for feature selection.pdf</url> </source>     <COSATI>09K</COSATI>    <cas_special> <project> <project_id>KSK1075601</project_id> <agency>GA AV</agency> <country>CZ</country> <ARLID>cav_un_auth*0027435</ARLID> </project> <project> <project_id>VS96063</project_id> <agency>MŠMT</agency> <country>CZ</country> <ARLID>cav_un_auth*0025066</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">A new suboptimal search method for feature selection is presented which is independent on the search direction. Several variants of the basic method are designed with respect to the priority of speed of finding or quality of the solution.</abstract>  <action target=""> <ARLID>cav_un_auth*0212701</ARLID> <name>International Conference on Pattern Recognition /15./</name> <place>Barcelona</place> <country>ES</country> <dates>03.09.2000-07.09.2000</dates> </action>     <RIV>JC</RIV>   <department>RO</department>    <permalink>http://hdl.handle.net/11104/0130540</permalink>    <ID_orig>UTIA-B 20000167</ID_orig>     <arlyear>2000</arlyear>       <unknown tag="mrcbU10"> 2000 </unknown> <unknown tag="mrcbU10"> Los Alamitos IEEE Computer Society </unknown> <unknown tag="mrcbU12"> 0-7695-0750-6 </unknown> <unknown tag="mrcbU63"> Proceedings of the 15th International Conference on Pattern Recognition 406 409 </unknown> <unknown tag="mrcbU67"> Sanfeliu A. 340 </unknown> <unknown tag="mrcbU67"> Villanueva J. J. 340 </unknown> <unknown tag="mrcbU67"> Vanrell M. 340 </unknown> </cas_special> </bibitem>