{"title":"Embedded-filter ACO using clustering based mutual information for feature selection","authors":"S. Kumar Reddy Mallidi, Rajeswara Rao Ramisetty","doi":"10.1007/s10878-025-01259-6","DOIUrl":null,"url":null,"abstract":"<p>The performance of machine learning algorithms is significantly influenced by the quality of the underlying dataset, which often comprises a mix of essential and redundant features. Feature selection, which identifies and discards these redundant features, plays a pivotal role in reducing computational and storage overheads. Current methodologies for this task primarily span filter-based and wrapper-based techniques. While Ant Colony Optimization, a popular bio-inspired meta-heuristic technique, has been extensively used for feature selection, employing mutual information as a principal heuristic measure, traditional mutual information is primarily suited for categorical features. To address this limitation, this study introduces an Embedded-Filter Ant Colony Optimization feature selection strategy that incorporates Clustering-Based Mutual Information. This integration offers enhanced support for classification tasks involving continuous features. To validate the efficiency of the proposed approach, various datasets were used, and a diverse range of machine learning algorithms were employed to evaluate the derived feature subsets. In addition to comparing the proposed method with Grey Wolf Optimization and Cuckoo Search Optimization-based feature selection approaches, a comprehensive evaluation was also carried out against established Ant Colony Optimization wrapper techniques. Experimental results indicate that the proposed Embedded-Filter Ant Colony Optimization consistently selects the minimal yet most relevant feature set while largely maintaining the efficacy of machine learning algorithms.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"9 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01259-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The performance of machine learning algorithms is significantly influenced by the quality of the underlying dataset, which often comprises a mix of essential and redundant features. Feature selection, which identifies and discards these redundant features, plays a pivotal role in reducing computational and storage overheads. Current methodologies for this task primarily span filter-based and wrapper-based techniques. While Ant Colony Optimization, a popular bio-inspired meta-heuristic technique, has been extensively used for feature selection, employing mutual information as a principal heuristic measure, traditional mutual information is primarily suited for categorical features. To address this limitation, this study introduces an Embedded-Filter Ant Colony Optimization feature selection strategy that incorporates Clustering-Based Mutual Information. This integration offers enhanced support for classification tasks involving continuous features. To validate the efficiency of the proposed approach, various datasets were used, and a diverse range of machine learning algorithms were employed to evaluate the derived feature subsets. In addition to comparing the proposed method with Grey Wolf Optimization and Cuckoo Search Optimization-based feature selection approaches, a comprehensive evaluation was also carried out against established Ant Colony Optimization wrapper techniques. Experimental results indicate that the proposed Embedded-Filter Ant Colony Optimization consistently selects the minimal yet most relevant feature set while largely maintaining the efficacy of machine learning algorithms.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.