Abstract
Subspace classifiers classify a pattern based on its distance from different vector subspaces. Earlier models of subspace classification were based on the assumption that individual classes lie in unique subspaces. In later extensions, locality was introduced into subspace classification allowing for a class to be associated with more than one sub manifold. The local subspace classifier is thus a piecewise linear classifier, and is more powerful when compared to the linear classification performed by global subspace methods. We present extensions to the basic subspace method of classification based on introducing locality and softness in the classification process. Locality is introduced by (subspace) clustering the patterns into clusters, and softness is introduced by allowing a pattern to be associated with more than one cluster. Our motivation for introducing both locality and softness is based on the premise that by introducing locality, it is possible to reduce the bias though at the cost of a possible increase in variance. By introducing softness (or aggregation), the variance can be reduced. Consequently, by introducing both locality and softness, we avoid the possibility of high variance that locality typically introduces. We derive appropriate algorithms to construct a local and soft model of subspace classifiers and present results obtained with the proposed algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 4 November 1998¶Received in revised form: 7 December 1998¶Accepted: 7 December 1998
Rights and permissions
About this article
Cite this article
Balachander, T., Kothari, R. Introducing Locality and Softness in Subspace Classification. Pattern Analysis & Applications 2, 53–58 (1999). https://doi.org/10.1007/s100440050014
Published:
Issue Date:
DOI: https://doi.org/10.1007/s100440050014