ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Extended subspace methods of pattern recognition

Prakash, M and Murty, Narasimha M (1996) Extended subspace methods of pattern recognition. In: Pattern Recognition Letters, 17 (11). pp. 1131-1139.

[img] PDF
Extended_subspace_methods.pdf
Restricted to Registered users only

Download (617Kb) | Request a copy

Abstract

The Subspace Pattern Recognition Method (SPRM) is a statistical method where each class is represented by a separate subspace. There are a number of variants to it including the Averaged Learning Subspace Method (ALSM). The decision surfaces in all these methods are quadratic. In some applications, we may require decision surfaces which are more nonlinear in nature. In this paper, we have proposed the use of more than one subspace (cluster) in the representation of the classes in the subspace methods of pattern recognition. By keeping the number of principal components in all the clusters the same, this model allows for a piecewise linear approximation of the decision surfaces. We have used this model to extend both the SPRM and the ALSM to obtain the Extended SPRM and the Extended ALSM, respectively. We have investigated the use of a dynamic clustering algorithm for the assignment of patterns to different clusters as opposed to a random assignment. We have conducted experiments on three data sets including a 192-dimensional large character data set. The results indicate that the proposed methods have the potential to approximate any decision surface, and can considerably improve the classification accuracy on the test sets.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 08 Mar 2007
Last Modified: 05 Apr 2011 10:53
URI: http://eprints.iisc.ernet.in/id/eprint/9645

Actions (login required)

View Item View Item