{"id":"https://openalex.org/W2153479931","doi":"https://doi.org/10.1109/tmm.2009.2012944","title":"Feature Selection Under a Complexity Constraint","display_name":"Feature Selection Under a Complexity Constraint","publication_year":2009,"publication_date":"2009-03-09","ids":{"openalex":"https://openalex.org/W2153479931","doi":"https://doi.org/10.1109/tmm.2009.2012944","mag":"2153479931"},"language":"en","primary_location":{"id":"doi:10.1109/tmm.2009.2012944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmm.2009.2012944","pdf_url":null,"source":{"id":"https://openalex.org/S137030581","display_name":"IEEE Transactions on Multimedia","issn_l":"1520-9210","issn":["1520-9210","1941-0077"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Multimedia","raw_type":"journal-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/A5040596034","display_name":"Jan H. Plasberg","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"J.H. Plasberg","raw_affiliation_strings":["School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087492771","display_name":"W. Bastiaan Kleijn","orcid":"https://orcid.org/0000-0002-1973-3920"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"W.B. Kleijn","raw_affiliation_strings":["School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040596034"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":1.7623,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85204979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"3","first_page":"565","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.791405439376831},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.7506968379020691},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7125328779220581},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.5596804618835449},{"id":"https://openalex.org/keywords/feature-extraction","display_name":"Feature extraction","score":0.550649106502533},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5360754728317261},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4468134045600891},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4333406388759613},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.41745978593826294},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.410249263048172},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4061025083065033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25924617052078247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1087462306022644}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791405439376831},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.7506968379020691},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7125328779220581},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.5596804618835449},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.550649106502533},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5360754728317261},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4468134045600891},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4333406388759613},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.41745978593826294},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.410249263048172},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4061025083065033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25924617052078247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1087462306022644},{"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":1,"locations":[{"id":"doi:10.1109/tmm.2009.2012944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmm.2009.2012944","pdf_url":null,"source":{"id":"https://openalex.org/S137030581","display_name":"IEEE Transactions on Multimedia","issn_l":"1520-9210","issn":["1520-9210","1941-0077"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Multimedia","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1499782308","https://openalex.org/W1595438055","https://openalex.org/W1606544556","https://openalex.org/W1619226191","https://openalex.org/W1971046812","https://openalex.org/W1974542028","https://openalex.org/W2002844845","https://openalex.org/W2004338242","https://openalex.org/W2014915963","https://openalex.org/W2031811575","https://openalex.org/W2047775030","https://openalex.org/W2049633694","https://openalex.org/W2058189943","https://openalex.org/W2075199077","https://openalex.org/W2077808043","https://openalex.org/W2093799708","https://openalex.org/W2098330974","https://openalex.org/W2099111195","https://openalex.org/W2101047103","https://openalex.org/W2101584668","https://openalex.org/W2102831150","https://openalex.org/W2113890143","https://openalex.org/W2118020555","https://openalex.org/W2122034733","https://openalex.org/W2137343183","https://openalex.org/W2144351953","https://openalex.org/W2148633389","https://openalex.org/W2149454242","https://openalex.org/W2149772057","https://openalex.org/W2154053567","https://openalex.org/W2979006918","https://openalex.org/W2997674406","https://openalex.org/W3003278325","https://openalex.org/W4212817109","https://openalex.org/W6682496738"],"related_works":["https://openalex.org/W2807251790","https://openalex.org/W2799406489","https://openalex.org/W2380784125","https://openalex.org/W2049792449","https://openalex.org/W2914806737","https://openalex.org/W3004057759","https://openalex.org/W2889085215","https://openalex.org/W986251431","https://openalex.org/W2503798035","https://openalex.org/W2998216295"],"abstract_inverted_index":{"Classification":[0],"on":[1,17,28,66,88],"mobile":[2],"devices":[3],"is":[4,103,107],"often":[5],"done":[6],"in":[7,54,80],"an":[8,73],"uninterrupted":[9],"fashion.":[10],"This":[11],"requires":[12],"algorithms":[13,84],"with":[14,85],"gentle":[15],"demands":[16],"the":[18,29,67,76,89,99],"computational":[19,68,101],"complexity.":[20,69],"The":[21],"performance":[22,77],"of":[23,31,49,56,75,109],"a":[24,46,86,110],"classifier":[25],"depends":[26],"heavily":[27],"set":[30,48],"features":[32,50],"used":[33,79],"as":[34],"input":[35],"variables.":[36],"Existing":[37],"feature":[38,82,90,96],"selection":[39,83],"strategies":[40],"for":[41],"classification":[42,57,112],"aim":[43],"at":[44],"finding":[45],"ldquobestrdquo":[47],"that":[51,72],"performs":[52],"well":[53],"terms":[55],"accuracy,":[58],"but":[59],"are":[60],"not":[61],"designed":[62],"to":[63,94],"handle":[64],"constraints":[65],"We":[70],"demonstrate":[71],"extension":[74],"measures":[78],"state-of-the-art":[81],"penalty":[87],"extraction":[91],"complexity":[92,102],"leads":[93],"superior":[95],"sets":[97],"if":[98],"allowed":[100],"limited.":[104],"Our":[105],"solution":[106],"independent":[108],"particular":[111],"algorithm.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
