skip to main content
10.1145/1363686.1363962acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

k-means discriminant maps for data visualization and classification

Published:16 March 2008Publication History

ABSTRACT

Over the years, many dimensionality reduction algorithms have been proposed for learning the structure of high dimensional data by linearly or non-linearly transforming it into a low-dimensional space. Some techniques can keep the local structure of data, while the others try to preserve the global structure. In this paper, we propose a linear dimensionality reduction technique that characterizes the local and global properties of data by firstly applying k-means algorithm on original data, and then finding the projection by simultaneously globally maximizing the between-cluster scatter matrix and locally minimizing the within-cluster scatter matrix, which actually keeps both local and global structure of data. Low complexity and structure preserving are two main advantages of the proposed technique. The experiments on both artificial and real data sets show the effectiveness and novelty of proposed algorithm in visualization and classification tasks.

References

  1. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems 14.Google ScholarGoogle Scholar
  2. K. Fukunaga. Introduction to statistical pattern recognition. Academic Press Professional, Inc., San Diego, CA, USA, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. H. Hotelling. Analysis of a complex of statistical variables into principal components. J. Educational Psychology, 27:417--441, 1933.Google ScholarGoogle ScholarCross RefCross Ref
  4. S. Mika, B. Schölkopf, A. J. Smola, K.-R. Müller, M. Scholz, and G. Rätsch. Kernel pca and de-noising in feature spaces. pages 536--542, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Nadler, S. Lafon, R. R. Coifman, and I. G. Kevrekidis. Diffusion maps, spectral clustering and reaction coordinates of dynamical systems. Applied and Computational Harmonic Analysis, 21.Google ScholarGoogle Scholar
  6. K. Pearson. On lines and planes of closest fit to systems of points in space. Philoshophical Magazine, 2:559--572, 1901.Google ScholarGoogle ScholarCross RefCross Ref
  7. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323--2326, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  8. R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function. Psychometrika, 27:125--140, 1962.Google ScholarGoogle ScholarCross RefCross Ref
  9. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. 290(5500):2319--2323, December 2000.Google ScholarGoogle Scholar
  10. W. S. Torgerson. Multidimensional scaling. Psychometrika, 17:401--419, 1952.Google ScholarGoogle ScholarCross RefCross Ref
  11. H. Yu and J. Yang. A direct lda algorithm for high-dimensional data - with application to face recognition. Pattern Recognition, 34(10):2067--2070, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  12. D. Zhang. Polyu palmprint palmprint database - http://www.comp.polyu.edu.hk/biometrics/.Google ScholarGoogle Scholar
  13. D. Zhang. Palmprint Authentication. Kluwer Academic, 2004.Google ScholarGoogle Scholar

Index Terms

  1. k-means discriminant maps for data visualization and classification

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
      March 2008
      2586 pages
      ISBN:9781595937537
      DOI:10.1145/1363686

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 March 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,650of6,669submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader