Pareto front feature selection based on artificial bee colony optimization

被引:248
作者
Hancer, Emrah [1 ,2 ]
Xue, Bing [3 ]
Zhang, Mengjie [3 ]
Karaboga, Dervis [1 ]
Akay, Bahriye [1 ]
机构
[1] Mehmet Akif Ersoy Univ, Dept Comp Technol & Informat Syst, TR-15030 Burdur, Turkey
[2] Erciyes Univ, Dept Comp Engn, TR-38039 Kayseri, Turkey
[3] Victoria Univ Wellington, Sch Engn & Comp Sci, POB 600, Wellington 6140, New Zealand
关键词
Feature selection; Classification; Multi-objective optimization; Artificial bee colony; PARTICLE SWARM OPTIMIZATION; EVOLUTIONARY ALGORITHM; MUTUAL INFORMATION; CLASSIFICATION;
D O I
10.1016/j.ins.2017.09.028
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Feature selection has two major conflicting aims, i.e., to maximize the classification performance and to minimize the number of selected features to overcome the curse of dimensionality. To balance their trade-off, feature selection can be handled as a multi-objective problem. In this paper, a feature selection approach is proposed based on a new multi objective artificial bee colony algorithm integrated with non-dominated sorting procedure and genetic operators. Two different implementations of the proposed approach are developed: ABC with binary representation and ABC with continuous representation. Their performance are examined on 12 benchmark datasets and the results are compared with those of linear forward selection, greedy stepwise backward selection, two single objective ABC algorithms and three well-known multi-objective evolutionary computation algorithms. The results show that the proposed approach with the binary representation outperformed the other methods in terms of both the dimensionality reduction and the classification accuracy. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:462 / 479
页数:18
相关论文
共 48 条
[1]   Synchronous and asynchronous Pareto-based multi-objective Artificial Bee Colony algorithms [J].
Akay, Bahriye .
JOURNAL OF GLOBAL OPTIMIZATION, 2013, 57 (02) :415-445
[2]  
[Anonymous], 2009, SIGKDD Explorations, DOI DOI 10.1145/1656274.1656278
[3]  
[Anonymous], 1980, COURSE THEORETICAL P
[4]  
[Anonymous], 2009, 2009 IEEE 13 INT MUL
[5]  
Auger A, 2009, FOGA'09: PROCEEDINGS OF THE 10TH ACM SIGRVO CONFERENCE ON FOUNDATIONS OF GENETIC ALGORITHMS, P87
[6]   USING MUTUAL INFORMATION FOR SELECTING FEATURES IN SUPERVISED NEURAL-NET LEARNING [J].
BATTITI, R .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (04) :537-550
[7]   Genetic programming for feature construction and selection in classification on high-dimensional data [J].
Binh Tran ;
Xue, Bing ;
Zhang, Mengjie .
MEMETIC COMPUTING, 2016, 8 (01) :3-15
[8]  
Caruana R., 1994, P 11 INT C INT C MAC, P28, DOI [10.1016/B978-1-55860-335-6.50012-X, DOI 10.1016/B978-1-55860-335-6.50012-X]
[9]   Improved binary particle swarm optimization using catfish effect for feature selection [J].
Chuang, Li-Yeh ;
Tsai, Sheng-Wei ;
Yang, Cheng-Hong .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (10) :12699-12707
[10]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]