Advertisement

Clustering for Prototype Selection using Singular Value Decomposition

  • A. K. V. Sai Jayram
  • M. Narasimha Murty
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)

Abstract

Data clustering is an important technique for exploratory data analysis. The speed, reliability and consistency with which a clustering algorithm can organize large amounts of data constitute reasons to use it in applications like data mining, document retrieval, signal compression, coding and pattern classification. In this paper, we use clustering for efficient large-scale pattern classification; more specifically, we achieve it by selecting appropriate prototypes and features using Singular Value Decomposition (SVD). It is found that the SVD based clustering not only selects better prototypes, but also reduces the memory and computational requirements by 98% over the conventional Nearest Neighbour Classifier (NNC) (T.M.Cover and P.E.Hart (1967)), on OCR data.

Keywords

Classification Accuracy Training Sample Singular Value Decomposition Pattern Classification Handwritten Digit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ANIL K. JAIN, ROBERT P.W. DULIN and JIANCHANG MAO. (2000): Statistical Pattern Recognition: A Review. IEEE Trans. Pattern Analysis and Machine Intelligence. Vol. 22, No. 1, pp. 4–37.CrossRefGoogle Scholar
  2. COVER, T.M. and HART, P.E. (1967): Nearest Neighbour Pattern Classification. IEEE Trans. Information Theory. vol. 13, no. 1, pp. 21–27.zbMATHCrossRefGoogle Scholar
  3. DEWILDE, P. and DEPRETTERE, ED.F. (1988): Singular Value Decomposition: An introduction. In: Ed. F. Deprettere, editor, SVD and Signal Processing: Algorithms, Applications, and Architectures. Elsevier Science Publishers, North Holland, pp. 3–41.Google Scholar
  4. DRINCAS, P., ALAN FRIEZE, RAVI KANNAN, SANTOSH VEMPALA, VINAY, V. (1999): Clustering in large graphs and matrices. Proc. of the symposium on Discrete Algorithms, SIAM Google Scholar
  5. JAIN, A.K., MURTY, M.N. and FLYNN, P.J. (1999): Data clustering: a review. ACM computing surveys. Vol 31, Issue 3, Nov pp-264–323.CrossRefGoogle Scholar
  6. JAIN, A.K. and CHANDRASEKARAN, R. (1982): Dimensionality and sample size considerations in pattern recognition practice, in: Handbook of Dimensionality. P.R. Krishnaiah and L.N. Kanal, Eds. New York: North-HollandGoogle Scholar
  7. PRAKASH, M. and NARASIMHA MURTY, M. (1997): Growing subspace pattern recognition methods and their neural-network models. IEEE Trans. Neural Networks. Vol. 8, No. 1, pp. 161–168.CrossRefGoogle Scholar
  8. RICHARD O. DUDA, PETER E. HART and DAVID G. STORK. (2000): Pattern Classification (2nd ed.) Google Scholar
  9. YOSHIHIKO HAMAMOTO, SHUNJI UCHIMURA and SHINGO TOMITA. (1997): A Bootstrap Technique for Nearest neighbour Classifier. IEEE Trans.Pattern Analysis and Machine Intelligence. Vol 19, no 1, Jan pp. 73–79.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • A. K. V. Sai Jayram
    • 1
  • M. Narasimha Murty
    • 2
  1. 1.Department of E.C.EIndian Institute of ScienceBangaloreIndia
  2. 2.Department of C.S.AIndian Institute of ScienceBangaloreIndia

Personalised recommendations