Weighted k-Nearest Leader Classifier for Large Data Sets

  • V. Suresh Babu
  • P. Viswanath
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4815)


Leaders clustering method is a fast one and can be used to derive prototypes called leaders from a large training set which can be used in designing a classifier. Recently nearest leader based classifier is shown to be a faster version of the nearest neighbor classifier, but its performance can be a degraded one since the density information present in the training set is lost while deriving the prototypes. In this paper we present a generalized weighted k-nearest leader based classifier which is a faster one and also an on-par classifier with the k-nearest neighbor classifier. The method is to find the relative importance of each prototype which is called its weight and to use them in the classification. The design phase is extended to eliminate some of the noisy prototypes to enhance the performance of the classifier. The method is empirically verified using some standard data sets and a comparison is drawn with some of the earlier related methods.


weighted leaders method k-NNC noise elimination prototypes 


  1. 1.
    Duda, R.O., E.Hart, P., Stork, D.G.: Pattern Classification. 2 nd edn. A Wiley-interscience Publication, John Wiley & Sons (2000)Google Scholar
  2. 2.
    Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory 13, 21–27 (1967)zbMATHCrossRefGoogle Scholar
  3. 3.
    Dasarathy, B.V.: Nearest neighbor (NN) norms: NN pattern classification techniques. IEEE Computer Society Press, Los Alamitos, California (1991)Google Scholar
  4. 4.
    Hart, P.: The condensed nearest-neighbor rule. IEEE Transactions on Information Theory IT-4, 515–516 (1968)CrossRefGoogle Scholar
  5. 5.
    Vijaya, P., Murty, M.N., Subramanian, D.K.: Leaders-subleaders: An efficient hierarchical clustering algorithm for large data sets. Pattern Recognition Letters 25, 505–513 (2004)CrossRefGoogle Scholar
  6. 6.
    Spath, H.: Cluster Analysis Algorithms for Data Reduction and Classification. Ellis Horwood, Chichester, UK (1980)Google Scholar
  7. 7.
    Jain, A., Dubes, R., Chen, C.: Bootstrap technique for error estimation. IEEE Transactions on Pattern Analysis and Machine Intelligence 9, 628–633 (1987)zbMATHCrossRefGoogle Scholar
  8. 8.
    Ester, M., Kriegel, H.P., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd ACM SIGKDD, Portand, Oregon, pp. 226–231 (1996)Google Scholar
  9. 9.
    Viswanath, P., Pinkesh, R.: l-dbscan: A fast hybrid density based clustering method. In: Proceedings of the 18th Intl. Conf. on Pattern Recognition (ICPR 2006), Hong Kong, vol. 1, pp. 912–915. IEEE Computer Society, Los Alamitos (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • V. Suresh Babu
    • 1
  • P. Viswanath
    • 1
  1. 1.Department of Computer Science and Engineering, Indian Institute of Technology–Guwahati, Guwahati-781039India

Personalised recommendations