Prototype Generation Using Multiobjective Particle Swarm Optimization for Nearest Neighbor Classification

被引:33
作者
Hu, Weiwei [1 ,2 ]
Tan, Ying [1 ,2 ]
机构
[1] Peking Univ, Sch Elect Engn & Comp Sci, Key Lab Machine Percept, Beijing 100871, Peoples R China
[2] Peking Univ, Sch Elect Engn & Comp Sci, Dept Machine Intelligence, Beijing 100871, Peoples R China
关键词
Error rank; multiobjective (MO) optimization; nearest neighbor (NN) classification; particle swarm optimization (PSO); prototype generation; FINDING PROTOTYPES; SOFTWARE TOOL; EVOLUTIONARY; ALGORITHMS; DESIGN; KEEL;
D O I
10.1109/TCYB.2015.2487318
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The nearest neighbor (NN) classifier suffers from high time complexity when classifying a test instance since the need of searching the whole training set. Prototype generation is a widely used approach to reduce the classification time, which generates a small set of prototypes to classify a test instance instead of using the whole training set. In this paper, particle swarm optimization is applied to prototype generation and two novel methods for improving the classification performance are presented: 1) a fitness function named error rank and 2) the multiobjective (MO) optimization strategy. Error rank is proposed to enhance the generation ability of the NN classifier, which takes the ranks of misclassified instances into consideration when designing the fitness function. The MO optimization strategy pursues the performance on multiple subsets of data simultaneously, in order to keep the classifier from overfitting the training set. Experimental results over 31 UCI data sets and 59 additional data sets show that the proposed algorithm outperforms nearly 30 existing prototype generation algorithms.
引用
收藏
页码:2719 / 2731
页数:13
相关论文
共 38 条
[1]   KEEL: a software tool to assess evolutionary algorithms for data mining problems [J].
Alcala-Fdez, J. ;
Sanchez, L. ;
Garcia, S. ;
del Jesus, M. J. ;
Ventura, S. ;
Garrell, J. M. ;
Otero, J. ;
Romero, C. ;
Bacardit, J. ;
Rivas, V. M. ;
Fernandez, J. C. ;
Herrera, F. .
SOFT COMPUTING, 2009, 13 (03) :307-318
[2]  
Alcalá-Fdez J, 2011, J MULT-VALUED LOG S, V17, P255
[3]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[4]  
[Anonymous], IEEE T CYBE IN PRESS
[5]  
[Anonymous], LNCS
[6]  
Bache K., 2013, UCI Machine Learning Repository
[7]   AMPSO: A New Particle Swarm Method for Nearest Neighborhood Classification [J].
Cervantes, Alejandro ;
Maria Galvan, Ines ;
Isasi, Pedro .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (05) :1082-1091
[8]   FINDING PROTOTYPES FOR NEAREST NEIGHBOR CLASSIFIERS [J].
CHANG, CL .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (11) :1179-1184
[9]   Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing [J].
Decaestecker, C .
PATTERN RECOGNITION, 1997, 30 (02) :281-288
[10]  
Derrac J., 2011, 2011 7th International Conference on Next Generation Web Services Practices, P464, DOI 10.1109/NWeSP.2011.6088224