{"id":"https://openalex.org/W4317382989","doi":"https://doi.org/10.1109/rivf55975.2022.10013860","title":"A Filter Approach Based on Binary Integer Programming for Feature Selection","display_name":"A Filter Approach Based on Binary Integer Programming for Feature Selection","publication_year":2022,"publication_date":"2022-12-20","ids":{"openalex":"https://openalex.org/W4317382989","doi":"https://doi.org/10.1109/rivf55975.2022.10013860"},"language":"en","primary_location":{"id":"doi:10.1109/rivf55975.2022.10013860","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/rivf55975.2022.10013860","pdf_url":null,"source":{"id":"https://openalex.org/S4363608274","display_name":"2022 RIVF International Conference on Computing and Communication Technologies (RIVF)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 RIVF International Conference on Computing and Communication Technologies (RIVF)","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/A5007811820","display_name":"Bui Thi Mai Anh","orcid":"https://orcid.org/0000-0003-4504-048X"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Bui Thi Mai Anh","raw_affiliation_strings":["School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028929536","display_name":"Duong Viet Anh","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duong Viet Anh","raw_affiliation_strings":["School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024349250","display_name":"Bui Quoc Trung","orcid":"https://orcid.org/0000-0002-9349-3099"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Bui Quoc Trung","raw_affiliation_strings":["School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology,Hanoi,Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"School of Information and Communication Technology Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.2077,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45979327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"677","last_page":"682"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T12535","display_name":"Machine Learning and Data Classification","score":0.9894999861717224,"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/T10057","display_name":"Face and Expression Recognition","score":0.9865999817848206,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7470153570175171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6892522573471069},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.6659137606620789},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.6452696323394775},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6078009605407715},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5747255682945251},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.5620889663696289},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5250850915908813},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5246439576148987},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5190380215644836},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4965274930000305},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48202788829803467},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4793318510055542},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47513678669929504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4713282883167267},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4465222954750061},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42488476634025574},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.35508471727371216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3339264988899231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19007468223571777}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7470153570175171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6892522573471069},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.6659137606620789},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.6452696323394775},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6078009605407715},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5747255682945251},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.5620889663696289},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5250850915908813},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5246439576148987},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5190380215644836},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4965274930000305},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48202788829803467},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4793318510055542},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47513678669929504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4713282883167267},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4465222954750061},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42488476634025574},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.35508471727371216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3339264988899231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19007468223571777},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf55975.2022.10013860","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/rivf55975.2022.10013860","pdf_url":null,"source":{"id":"https://openalex.org/S4363608274","display_name":"2022 RIVF International Conference on Computing and Communication Technologies (RIVF)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W42435736","https://openalex.org/W1496462336","https://openalex.org/W1500895378","https://openalex.org/W1685464609","https://openalex.org/W1981491391","https://openalex.org/W1997215277","https://openalex.org/W2043772506","https://openalex.org/W2069808690","https://openalex.org/W2118578744","https://openalex.org/W2131816657","https://openalex.org/W2149772057","https://openalex.org/W2154053567","https://openalex.org/W2162833766","https://openalex.org/W2609892310","https://openalex.org/W2756063524","https://openalex.org/W2792730533","https://openalex.org/W3046492425","https://openalex.org/W4241768805","https://openalex.org/W4289236186","https://openalex.org/W6637461618","https://openalex.org/W6806801748"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W2979334915"],"abstract_inverted_index":{"Feature":[0],"Selection":[1],"(FS)":[2],"aims":[3],"to":[4,15,39,97],"identify":[5],"the":[6,11,17,21,41,55,64,80,99,130],"most":[7],"relevant":[8,47],"information":[9],"from":[10,63],"data":[12],"in":[13,24,43,125],"order":[14,44],"boost":[16],"overall":[18],"performance":[19],"of":[20,26,45,57,106,113,127],"learning":[22],"model":[23,120],"terms":[25,126],"both":[27],"accuracy":[28],"and":[29,49,133],"computational":[30,134],"cost.":[31],"Traditional":[32],"FS":[33,76],"methods":[34],"rely":[35],"on":[36,109],"specific":[37],"criteria":[38],"rank":[40],"features":[42],"their":[46],"scores":[48],"filter":[50,82],"out":[51],"low-ranking":[52],"elements.":[53],"However,":[54],"nature":[56],"these":[58],"greedy":[59],"approaches":[60,124],"may":[61],"suffer":[62],"locally":[65],"optimal":[66,101,104],"choice.":[67],"To":[68],"tackle":[69],"this":[70],"problem,":[71],"we":[72],"propose":[73],"a":[74,110],"novel":[75],"approach":[77],"by":[78,94],"reformulating":[79],"existing":[81,122],"selection":[83],"problem":[84],"into":[85],"an":[86],"integer":[87],"program":[88],"which":[89],"can":[90],"be":[91],"solved":[92],"effectively":[93],"branch-and-cut":[95],"algorithms":[96],"find":[98],"globally":[100],"solution":[102],"(an":[103],"subset":[105],"features).":[107],"Experiments":[108],"wide":[111],"range":[112],"benchmark":[114],"datasets":[115],"indicate":[116],"that":[117],"our":[118],"proposed":[119],"outperforms":[121],"state-of-the-art":[123],"considerably":[128],"reducing":[129],"search":[131],"space":[132],"resources.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}