Skip to main content

Simultaneous Feature Selection and Weighting for Nearest Neighbor Using Tabu Search

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2004 (IDEAL 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3177))

Abstract

Both feature selection and feature weighting techniques are useful for improving the classification accuracy of K-nearest-neighbor (KNN) rule. The term feature selection refers to algorithms that select the best subset of the input feature set. In feature weighting, each feature is multiplied by a weight value proportional to the ability of the feature to distinguish among pattern classes. In this paper, a tabu search based heuristic is proposed for simultaneous feature selection and feature weighting of KNN rule. The proposed heuristic in combination with KNN classifier is compared with several classifiers on various available datasets. Results have indicated a significant improvement of the performance in terms of maximizing classification accuracy.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Raymer, M.L., et al.: Dimensionality Reduction using Genetic Algorithms. IEEE Trans. on Evolutionary Computation 4(2), 164–171 (2000)

    Article  Google Scholar 

  2. Paredes, R., Vidal, E.: A Class-Dependent Weighted Dissimilarity Measure for Nearest Neighbor Classification Problems. Pattern Recognition Letters 21(12), 1027–1036 (2000)

    Article  MATH  Google Scholar 

  3. Wettschereck, D., Aha, D.W., Mohri, T.: A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms. Artificial Intelligence Review 11(1-5), 273–314 (1997)

    Article  Google Scholar 

  4. Jain, K., Duin, R.P.W., Mao, J.: Satistical Pattern Recognition: A Review. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(1), 4–37 (2000)

    Article  Google Scholar 

  5. Zhang, H., Sun, G.: Feature selection using tabu search method. Pattern Recognition 35, 701–711 (2002)

    Article  MATH  Google Scholar 

  6. Glover, F.: Tabu search I. ORSA Journal on Computing 1(3), 190–206 (1989)

    MATH  Google Scholar 

  7. Statlog Corpora. Dept. Statistics and Modelling Science (Stams). Stratchclyde University, http://www.liacc.up.pt/ML/statlog/

  8. Michie, D., Spiegelhalter, D.J., Taylor, C.C.: Machine Learning, Neural and Statistical Classification. Ellis Horwood (1994)

    Google Scholar 

  9. Blake, C., Keogh, E., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine

    Google Scholar 

  10. Keller, J.M., Gray, M.R., Givens, J.A.: A Fuzzy K-Nearest Neighbor Algorithm. IEEE Trans. on Systems, Man, and Cybernetics 15(4), 580–585 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tahir, M.A., Bouridane, A., Kurugollu, F. (2004). Simultaneous Feature Selection and Weighting for Nearest Neighbor Using Tabu Search. In: Yang, Z.R., Yin, H., Everson, R.M. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2004. IDEAL 2004. Lecture Notes in Computer Science, vol 3177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28651-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28651-6_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22881-3

  • Online ISBN: 978-3-540-28651-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics