Skip to main content

Cluster Pattern Matching Using ACO Based Feature Selection for Efficient Data Classification

  • Conference paper
Advances in Communication, Network, and Computing (CNC 2012)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Han, Y., Lam, W., Ling, C.X.: Customized classification learning based on query projections. Information Sciences 177, 3557–3573 (2007)

    Article  MathSciNet  Google Scholar 

  2. Manocha, S., Girolami, M.A.: An empirical analysis of the probabilistic k-nearest neighbour classifier. Pattern Recogn. Lett. 28, 1818–1824 (2007)

    Article  Google Scholar 

  3. Ming Leung, K.: k-Nearest Neighbor Algorithm for Classification. Polytechnic University Department of Computer Science / Finance and Risk Engineering (2007)

    Google Scholar 

  4. Tomasev, N., Radovanovic, M., Mladenic, D.: A Probabilistic Approach to Nearest-Neighbor Classification: Naive Hubness Bayesian KNN. In: CIKM 2011, Glasgow, Scotland, UK (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics