Prototype selection based on multi-objective optimisation and partition strategy

Prototype selection aims at reducing the storage of datasets and execution time, and improving prediction accuracy and operation efficiency by removing noisy or redundant samples, so the prediction classification accuracy is maximised and the reduction ratio is minimised simultaneously. To achieve this purpose, a two objective optimisation model is set up for prototype selection problem in the paper. To make the model be solved easier, it is transformed to a single objective optimisation model by the division of the two objectives, and a new two-layer genetic algorithm is proposed by using a divide-and-conquer partition strategy. The divide-and-conquer partition can divide the whole dataset into some random sub-datasets to be handled, respectively. The simulations are conducted and the proposed algorithm is compared with several existing algorithms. The results obtained on UCI static datasets and time series datasets indicate that the proposed algorithm is an expedient method in design nearest neighbour classifiers.

[1]  Cor J. Veenman,et al.  The nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifier , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Francisco Herrera,et al.  Stratification for scaling up evolutionary prototype selection , 2005, Pattern Recognit. Lett..

[3]  Francisco Herrera,et al.  A Taxonomy and Experimental Study on Prototype Generation for Nearest Neighbor Classification , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[4]  Shen Furao,et al.  A fast nearest neighbor classifier based on self-organizing incremental neural network , 2008, Neural Networks.

[5]  Javier Pérez-Rodríguez,et al.  Multi-selection of instances: A straightforward way to improve evolutionary instance selection , 2012, Appl. Soft Comput..

[6]  Venu Govindaraju,et al.  Improved k-nearest neighbor classification , 2002, Pattern Recognit..

[7]  Francisco Herrera,et al.  Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study , 2003, IEEE Trans. Evol. Comput..

[8]  Araceli Sanchis,et al.  Activity Recognition Using Hybrid Generative/Discriminative Models on Home Environments Using Binary Sensors , 2013, Sensors.

[9]  Peter E. Hart,et al.  The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[10]  Ye Xu,et al.  An incremental learning vector quantization algorithm for pattern classification , 2010, Neural Computing and Applications.

[11]  Kazuo Hattori,et al.  A new edited k-nearest neighbor rule in the pattern classification problem , 2000, Pattern Recognit..

[12]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[13]  Francisco Herrera,et al.  Differential evolution for optimizing the positioning of prototypes in nearest neighbor classification , 2011, Pattern Recognit..

[14]  Robert P. W. Duin,et al.  Prototype Selection for Dissimilarity Representation by a Genetic Algorithm , 2010, 2010 20th International Conference on Pattern Recognition.

[15]  Francisco Herrera,et al.  Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  José Francisco Martínez Trinidad,et al.  A new fast prototype selection method based on clustering , 2010, Pattern Analysis and Applications.

[17]  Fabrizio Angiulli,et al.  Fast Nearest Neighbor Condensation for Large Data Sets Classification , 2007, IEEE Transactions on Knowledge and Data Engineering.

[18]  Francisco Herrera,et al.  A memetic algorithm for evolutionary prototype selection: A scaling up approach , 2008, Pattern Recognit..

[19]  T. Ravindra Babu,et al.  Comparison of genetic algorithm based prototype selection schemes , 2001, Pattern Recognit..

[20]  Tony R. Martinez,et al.  Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.

[21]  Dennis L. Wilson,et al.  Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..

[22]  G. Krishna,et al.  The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[23]  Utpal Garain,et al.  Prototype reduction using an artificial immune model , 2008, Pattern Analysis and Applications.

[24]  Chi-Jen Lu,et al.  Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies , 2006, J. Mach. Learn. Res..

[25]  Shinn-Ying Ho,et al.  Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm , 2002, Pattern Recognit. Lett..