{"id":"https://openalex.org/W2341283896","doi":"https://doi.org/10.1145/2896387.2896432","title":"A hybrid feature selection approach based on heuristic and exhaustive algorithms using Rough set theory","display_name":"A hybrid feature selection approach based on heuristic and exhaustive algorithms using Rough set theory","publication_year":2016,"publication_date":"2016-03-22","ids":{"openalex":"https://openalex.org/W2341283896","doi":"https://doi.org/10.1145/2896387.2896432","mag":"2341283896"},"language":"en","primary_location":{"id":"doi:10.1145/2896387.2896432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2896387.2896432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Internet of things and Cloud Computing","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/A5050286338","display_name":"Muhammad Summair Raza","orcid":"https://orcid.org/0000-0001-7405-7948"},"institutions":[{"id":"https://openalex.org/I929597975","display_name":"National University of Sciences and Technology","ror":"https://ror.org/03w2j5y17","country_code":"PK","type":"education","lineage":["https://openalex.org/I929597975"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muhammad Summair Raza","raw_affiliation_strings":["Department of Computer Engineering, College of Electrical and Mechanical Engineering, National, University of Sciences and Technology (NUST), Islamabad Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, College of Electrical and Mechanical Engineering, National, University of Sciences and Technology (NUST), Islamabad Pakistan","institution_ids":["https://openalex.org/I929597975"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050012170","display_name":"Usman Qamar","orcid":"https://orcid.org/0000-0003-2361-2061"},"institutions":[{"id":"https://openalex.org/I929597975","display_name":"National University of Sciences and Technology","ror":"https://ror.org/03w2j5y17","country_code":"PK","type":"education","lineage":["https://openalex.org/I929597975"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Usman Qamar","raw_affiliation_strings":["Department of Computer Engineering, College of Electrical and Mechanical Engineering, National, University of Sciences and Technology (NUST), Islamabad Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, College of Electrical and Mechanical Engineering, National, University of Sciences and Technology (NUST), Islamabad Pakistan","institution_ids":["https://openalex.org/I929597975"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1627,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88248252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9710000157356262,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6691194772720337},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6347407698631287},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.6241409778594971},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5525696277618408},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5078635811805725},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5012943744659424},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4761272072792053},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.46491557359695435},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4589451551437378},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4570770859718323},{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.44594210386276245},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.43159353733062744},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3759324252605438},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.37125080823898315},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.36657625436782837}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6691194772720337},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6347407698631287},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.6241409778594971},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5525696277618408},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5078635811805725},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5012943744659424},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4761272072792053},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.46491557359695435},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4589451551437378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4570770859718323},{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.44594210386276245},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.43159353733062744},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3759324252605438},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.37125080823898315},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.36657625436782837},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2896387.2896432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2896387.2896432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Internet of things and Cloud Computing","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":18,"referenced_works":["https://openalex.org/W896196729","https://openalex.org/W1030501565","https://openalex.org/W1556588158","https://openalex.org/W1590946452","https://openalex.org/W1635923105","https://openalex.org/W1903938543","https://openalex.org/W1981223475","https://openalex.org/W2021486815","https://openalex.org/W2041946175","https://openalex.org/W2074101794","https://openalex.org/W2076454423","https://openalex.org/W2077922582","https://openalex.org/W2094973863","https://openalex.org/W2125301736","https://openalex.org/W2154980813","https://openalex.org/W2210487714","https://openalex.org/W2329003757","https://openalex.org/W4255833381"],"related_works":["https://openalex.org/W2392963705","https://openalex.org/W2382278777","https://openalex.org/W2107349454","https://openalex.org/W2353240132","https://openalex.org/W1964260090","https://openalex.org/W2375932290","https://openalex.org/W1486178390","https://openalex.org/W138553499","https://openalex.org/W2167403502","https://openalex.org/W1964755555"],"abstract_inverted_index":{"A":[0],"dataset":[1],"may":[2],"have":[3,63,73,120,136],"many":[4,59],"irrelevant":[5],"and":[6,102,124,130,145],"unnecessary":[7],"features,":[8],"which":[9,111],"not":[10,81],"only":[11],"increase":[12],"computational":[13],"space":[14],"but":[15,66],"also":[16],"lead":[17],"to":[18,46,149],"a":[19,89],"very":[20],"critical":[21],"phenomenon":[22],"called":[23],"curse":[24],"of":[25,41],"dimensionality.":[26],"Feature":[27],"selection":[28,61,94],"process":[29],"aims":[30],"at":[31],"selecting":[32],"some":[33],"relevant":[34],"features":[35],"for":[36,54,92,133],"further":[37,114],"processing":[38],"on":[39,99],"behalf":[40],"the":[42,83,150],"entire":[43],"dataset.":[44],"However,":[45,77],"extract":[47],"such":[48],"information":[49],"is":[50,112,142],"non-trivial":[51],"task,":[52],"especially":[53],"large":[55],"datasets.":[56],"In":[57,86],"literature":[58],"feature":[60,93,109],"approaches":[62,72,79],"been":[64,96],"proposed":[65,140],"recently":[67],"rough":[68],"set":[69],"based":[70,98,154],"heuristic":[71,100],"become":[74],"prominent":[75],"ones.":[76],"these":[78],"do":[80],"ensure":[82],"optimum":[84],"solution.":[85],"this":[87],"paper,":[88],"hybrid":[90],"approach":[91,141],"has":[95],"proposed,":[97],"algorithm":[101,106,123],"exhaustive":[103,117],"search.":[104,118],"Heuristic":[105],"finds":[107],"initial":[108],"subset":[110],"then":[113],"optimized":[115],"by":[116],"We":[119],"used":[121],"genetic":[122],"particle":[125],"swarm":[126],"optimization":[127],"as":[128,147],"preprocessor":[129],"relative":[131,152],"dependency":[132,153],"optimization.":[134],"Experiments":[135],"shown":[137],"that":[138],"our":[139],"more":[143],"effective":[144],"efficient":[146],"compared":[148],"conventional":[151],"approach.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}