{"id":"https://openalex.org/W2158304283","doi":"https://doi.org/10.1109/icassp.2013.6638263","title":"Convex approximation of the NP-hard search problem in feature subset selection","display_name":"Convex approximation of the NP-hard search problem in feature subset selection","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2158304283","doi":"https://doi.org/10.1109/icassp.2013.6638263","mag":"2158304283"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2013.6638263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067551398","display_name":"Tofigh Naghibi","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Tofigh Naghibi","raw_affiliation_strings":["Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020460474","display_name":"Sarah Hoffmann","orcid":"https://orcid.org/0000-0001-9549-2594"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sarah Hoffmann","raw_affiliation_strings":["Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111975528","display_name":"Beat Pfister","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Beat Pfister","raw_affiliation_strings":["Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Speech Processing Group, Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067551398"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.3822,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.8489767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3273","last_page":"3277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6381786465644836},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5725281238555908},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.5546615123748779},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.549119770526886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5348753929138184},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.48856934905052185},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48203980922698975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44114676117897034},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.4306238293647766},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37638360261917114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3719325065612793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2987784147262573},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.29283756017684937},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.22685641050338745}],"concepts":[{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6381786465644836},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5725281238555908},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.5546615123748779},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.549119770526886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5348753929138184},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.48856934905052185},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48203980922698975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44114676117897034},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.4306238293647766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37638360261917114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3719325065612793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2987784147262573},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29283756017684937},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.22685641050338745},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2013.6638263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2013.6638263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.377.3644","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.3644","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tik.ee.ethz.ch/spr/publications/Naghibi:13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W601478763","https://openalex.org/W1488252886","https://openalex.org/W1523989055","https://openalex.org/W1559923427","https://openalex.org/W1562345870","https://openalex.org/W2009207944","https://openalex.org/W2024631575","https://openalex.org/W2054358802","https://openalex.org/W2059380806","https://openalex.org/W2066873261","https://openalex.org/W2098133322","https://openalex.org/W2099111195","https://openalex.org/W2110632824","https://openalex.org/W2119479037","https://openalex.org/W2147191663","https://openalex.org/W2149772057","https://openalex.org/W2154053567","https://openalex.org/W2296319761","https://openalex.org/W2799518931","https://openalex.org/W2912475851","https://openalex.org/W3011766368","https://openalex.org/W3120740533","https://openalex.org/W4250589301","https://openalex.org/W4285719527","https://openalex.org/W6681839370"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843","https://openalex.org/W4297336635"],"abstract_inverted_index":{"Feature":[0],"subset":[1,10,32,64],"selection,":[2],"as":[3],"a":[4,14,51],"special":[5],"case":[6],"of":[7,16,24],"the":[8,21,30,62,81,87],"general":[9],"selection":[11,65],"problem,":[12,36],"attracted":[13],"lot":[15],"research":[17],"attention":[18],"due":[19],"to":[20,45,59],"growing":[22],"importance":[23],"data-mining":[25],"applications.":[26],"However,":[27],"since":[28],"finding":[29],"optimal":[31],"is":[33,71,76],"an":[34],"NP-hard":[35],"very":[37],"different":[38],"heuristic":[39],"search":[40,57,83],"methods":[41,84],"have":[42],"been":[43],"suggested":[44],"approximate":[46],"it.":[47],"Here":[48],"we":[49],"propose":[50],"new":[52],"second-order":[53],"cone":[54],"programming":[55],"based":[56],"strategy":[58],"efficiently":[60],"solve":[61],"feature":[63],"for":[66],"large-scale":[67],"problems.":[68],"Experimentally,":[69],"it":[70],"shown":[72],"that":[73],"its":[74],"performance":[75],"almost":[77],"always":[78],"better":[79],"than":[80],"greedy":[82],"especially":[85],"when":[86],"features":[88],"are":[89],"strongly":[90],"dependent.":[91]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}