Skip to main content

Local Subspace Classifier

  • Part IV: Signal Processing: Blind Source Separation, Vector Quantization, and Self Organization
  • Conference paper
  • First Online:
Artificial Neural Networks — ICANN'97 (ICANN 1997)

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

Included in the following conference series:

Abstract

This paper describes a new classification technique named the Local Subspace Classifier (LSC). The algorithm is closely related to the subspace classification methods. On the other hand, it is an heir of prototype classification methods, such as the k-NN rule. Therefore, it is argued that the LSC technique fills the gap between the subspace and prototype principles of classification. From the domain of the prototypebased classifiers, LSC brings the benefits related to the local nature of the classification, while it simultaneously utilizes the capability of the subspace classifiers to produce generalizations from the training sample. A further enhancement of the LSC principle named the Convex Local Subspace Classifier (LSC+) is also presented. The good classification accuracy obtainable with the LSC and LSC+ classifiers is demonstrated with experiments, including the classification of the publicly available data sets of the StatLog project.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Oja, E. Subspace Methods of Pattern Recognition. Research Studies Press, Letchworth, England (1983)

    Google Scholar 

  2. Holmström, L., Koistinen, P., Laaksonen, J., Oja, E. Neural and statistical classifiers-taxonomy and two case studies. IEEE Tr. on Neural Networks 8:5–17 (1997)

    Google Scholar 

  3. Michie, D., Spiegelhalter, D. J., Taylor, C. C., editors. Machine learning, neural and statistical classification. Ellis Horwood, New York (1994)

    Google Scholar 

  4. Laaksonen, J. Subspace Methods in Recognition of Handwritten Digits. Ph.D. thesis, Helsinki University of Technology (1997)

    Google Scholar 

  5. Laaksonen, J., Oja, E. Classification with learning k-nearest neighbors. In Proc. of the Intl. Conf. on Neural Networks, vol. 3, pp. 1480–1483, Washington D.C. (1996)

    Google Scholar 

  6. Kohonen, T. Self-Organizing Maps. Springer, Berlin, Germany (1995)

    Google Scholar 

  7. Laaksonen, J. Local subspace classifier and local subspace SOM. In Proc. of the Workshop on Self-Organizing Maps, Otaniemi, Finland (1997). To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wulfram Gerstner Alain Germond Martin Hasler Jean-Daniel Nicoud

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laaksonen, J. (1997). Local Subspace Classifier. In: Gerstner, W., Germond, A., Hasler, M., Nicoud, JD. (eds) Artificial Neural Networks — ICANN'97. ICANN 1997. Lecture Notes in Computer Science, vol 1327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020226

Download citation

  • DOI: https://doi.org/10.1007/BFb0020226

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63631-1

  • Online ISBN: 978-3-540-69620-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics