Abstract
Cluster Pattern Matching based Classification (CPMC) is a classification technique based on a similarity measure between the training instances and the unknown sample. An Ant Colony Optimization based feature selection is proposed to select the features. According to this approach, the training data set is clustered. The cluster to which the unknown sample belongs is found and each of the selected features of the unknown sample is compared with the corresponding feature of the training instances in the cluster and the class of the unknown sample is predicted based on majority voting of class labels having highest number of matching patterns. A probabilistic approach is used to predict the class label when more than one class label has the same majority. Experimental results demonstrating the efficiency of classification accuracy of CPMC are shown to prove that the proposed approach is better when compared to existing classification techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Han, Y., Lam, W., Ling, C.X.: Customized classification learning based on query projections. Information Sciences 177, 3557–3573 (2007)
Manocha, S., Girolami, M.A.: An empirical analysis of the probabilistic k-nearest neighbour classifier. Pattern Recogn. Lett. 28, 1818–1824 (2007)
Ming Leung, K.: k-Nearest Neighbor Algorithm for Classification. Polytechnic University Department of Computer Science / Finance and Risk Engineering (2007)
Tomasev, N., Radovanovic, M., Mladenic, D.: A Probabilistic Approach to Nearest-Neighbor Classification: Naive Hubness Bayesian KNN. In: CIKM 2011, Glasgow, Scotland, UK (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
N.K., S., Sankar, A. (2012). Cluster Pattern Matching Using ACO Based Feature Selection for Efficient Data Classification. In: Das, V.V., Stephen, J. (eds) Advances in Communication, Network, and Computing. CNC 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35615-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-35615-5_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35614-8
Online ISBN: 978-3-642-35615-5
eBook Packages: Computer ScienceComputer Science (R0)