Feature Subset Selection Using Ant Colony Optimization for a Decision Trees Classification of Medical Data

被引:1
作者
Alaoui, Abdiya [1 ]
Elberrichi, Zakaria [1 ]
机构
[1] Univ Djillali Liabes Sidi Bel Abbes, Dept Comp Sci, EEDIS Lab, Sidi Bel Abbes, Algeria
关键词
Ant Colony Optimization; Boosting; Decision Tree; Feature Selection; Medical Data; Supervised Classification;
D O I
10.4018/IJIRR.2018100103
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article describes how a feature selection is a one of the most important assignments of the preprocessing step for medical data. It can extract a subset of features from a larger set and eliminate redundant, irrelevant or noisy features. The authors can reduce the cost of diagnosis by avoiding many tests by the selection of features which are important for the prediction of disease. Applied to the task of supervised classification, the authors build a robust learning models for disease prediction. The search for a subset of features is an NP-hard problem which can be solved by metaheuristics. In this article, the hybridization between the Ant Colony Optimization and Adaboost with Decision Trees (C4.5) to improve the classification is proposed. The experiments show the usefulness of the approach.
引用
收藏
页码:39 / 50
页数:12
相关论文
共 25 条
[1]  
Blake C., 1998, UCI REPOSITORY MACHI
[2]  
Burse, 2016, INT J COMPUTER SCI I, V7, P194
[3]   The k-Feature Set problem is W[2]-complete [J].
Cotta, C ;
Moscato, P .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) :686-690
[4]  
Dorigo M, 2007, HDB APPROX ALGORITHM
[5]   BOOSTING A WEAK LEARNING ALGORITHM BY MAJORITY [J].
FREUND, Y .
INFORMATION AND COMPUTATION, 1995, 121 (02) :256-285
[6]  
Freund Y., 1996, MACHINE LEARNING
[7]  
Goldberg DavidE., 1989, GENETIC ALGORITHMS S, V1st
[8]  
Quinlan J. R., 1986, Machine Learning, V1, P81, DOI 10.1007/BF00116251
[9]  
Quinlan J.R., 1988, MACHINE INTELLIGENCE, V11, P305
[10]  
Quinlan J. R., 1993, C45 PROGRAMS MACHINE, DOI 10.1007/BF00993309