{"id":"https://openalex.org/W2099016507","doi":"https://doi.org/10.1109/cec.2009.4983263","title":"A novel hybrid ACO-GA algorithm for text feature selection","display_name":"A novel hybrid ACO-GA algorithm for text feature selection","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2099016507","doi":"https://doi.org/10.1109/cec.2009.4983263","mag":"2099016507"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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/A5029483508","display_name":"Mohammad Ehsan Basiri","orcid":"https://orcid.org/0000-0003-2893-3892"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohammad Ehsan Basiri","raw_affiliation_strings":["Computer Engineering Department, University of Isfahan, Isfahan, Iran","Computer Engineering Department, University of Isfahan, Hezar Jerib Avenue, Iran"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]},{"raw_affiliation_string":"Computer Engineering Department, University of Isfahan, Hezar Jerib Avenue, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011712422","display_name":"Shahla Nemati","orcid":"https://orcid.org/0000-0003-2906-5871"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Shahla Nemati","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Department of Electrical and Computer Engineering, Isfahan University of Technology (IUT), 84156-8311, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology (IUT), 84156-8311, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029483508"],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":0.4362,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.72859583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2561","last_page":"2568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9923999905586243,"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.9923999905586243,"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/T11550","display_name":"Text and Document Classification Technologies","score":0.9905999898910522,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7743998765945435},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.7391253709793091},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6831117272377014},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5451589822769165},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.540728747844696},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.5224248766899109},{"id":"https://openalex.org/keywords/text-categorization","display_name":"Text categorization","score":0.4512627422809601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4363175630569458},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.43236973881721497},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.422149121761322},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.39891377091407776},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.39300617575645447},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.30347633361816406},{"id":"https://openalex.org/keywords/categorization","display_name":"Categorization","score":0.2082773745059967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7743998765945435},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.7391253709793091},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6831117272377014},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5451589822769165},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.540728747844696},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.5224248766899109},{"id":"https://openalex.org/C2986744138","wikidata":"https://www.wikidata.org/wiki/Q302088","display_name":"Text categorization","level":3,"score":0.4512627422809601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4363175630569458},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.43236973881721497},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.422149121761322},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.39891377091407776},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.39300617575645447},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30347633361816406},{"id":"https://openalex.org/C94124525","wikidata":"https://www.wikidata.org/wiki/Q912550","display_name":"Categorization","level":2,"score":0.2082773745059967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W68795722","https://openalex.org/W139609527","https://openalex.org/W340865098","https://openalex.org/W1492640216","https://openalex.org/W1550045403","https://openalex.org/W1590732297","https://openalex.org/W1673359695","https://openalex.org/W1674834782","https://openalex.org/W1840286873","https://openalex.org/W1978394996","https://openalex.org/W1999635750","https://openalex.org/W2004338242","https://openalex.org/W2022637272","https://openalex.org/W2042137729","https://openalex.org/W2068431618","https://openalex.org/W2093799708","https://openalex.org/W2098572241","https://openalex.org/W2103333826","https://openalex.org/W2107631366","https://openalex.org/W2118020388","https://openalex.org/W2118573797","https://openalex.org/W2126554879","https://openalex.org/W2130759652","https://openalex.org/W2137569162","https://openalex.org/W2152169700","https://openalex.org/W2164267739","https://openalex.org/W2167435760","https://openalex.org/W2171211995","https://openalex.org/W2341338744","https://openalex.org/W3016210511","https://openalex.org/W3017143921","https://openalex.org/W6605724736","https://openalex.org/W6611611298","https://openalex.org/W6675969814","https://openalex.org/W6684863256"],"related_works":["https://openalex.org/W2125776999","https://openalex.org/W2111353337","https://openalex.org/W2371357422","https://openalex.org/W2372663604","https://openalex.org/W1482708182","https://openalex.org/W1973637371","https://openalex.org/W2367691850","https://openalex.org/W3023878085","https://openalex.org/W2391234281","https://openalex.org/W2375828317"],"abstract_inverted_index":{"In":[0,16],"our":[1,66],"previous":[2],"work":[3],"we":[4,19],"have":[5],"proposed":[6,67,81,123],"an":[7],"ant":[8],"colony":[9],"optimization":[10],"(ACO)":[11],"algorithm":[12,22,26,39,68,86],"for":[13],"feature":[14,45],"selection.":[15],"this":[17],"paper,":[18],"hybridize":[20],"the":[21,55,62,83,119,122],"with":[23],"a":[24,43,50,95],"genetic":[25],"(GA)":[27],"to":[28,42],"obtain":[29],"excellent":[30],"features":[31],"of":[32,57,92,94,121],"two":[33],"algorithms":[34,72,80],"by":[35],"synthesizing":[36],"them.":[37],"Proposed":[38,85],"is":[40,49,87,103],"applied":[41],"challenging":[44],"selection":[46],"problem.":[47],"This":[48],"data":[51],"mining":[52],"problem":[53],"involving":[54],"categorization":[56],"text":[58],"documents.":[59],"We":[60],"report":[61],"extensive":[63],"comparison":[64],"between":[65],"and":[69,78,90],"three":[70],"existing":[71],"-":[73],"ACO-based,":[74],"information":[75],"gain":[76],"(IG)":[77],"CHI":[79],"in":[82,98],"literature.":[84],"easily":[88],"implemented":[89],"because":[91],"use":[93],"simple":[96],"classifier":[97],"that,":[99],"its":[100],"computational":[101],"complexity":[102],"very":[104],"low.":[105],"Experimentations":[106],"are":[107],"carried":[108],"out":[109],"on":[110,115],"Reuters-21578":[111,116],"dataset.":[112],"Simulation":[113],"results":[114],"dataset":[117],"show":[118],"superiority":[120],"algorithm.":[124]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}