The ALSM algorithm — an improved subspace method of classification

作者:

Highlights:

摘要

The subspace methods of classification are decision-theoretic pattern recognition methods in which each class is represented in terms of a linear subspace of the Euclidean pattern or feature space. In most reported subspace methods, a priori criteria have been applied to improve either the class representation or the discriminatory power of the subspaces. Recently, construction of the class subspaces by learning has been suggested by Kohonen, resulting in an improved classification accuracy. A variant of the original learning rule is analyzed and results are given on its application to the classification of phonemes in automatic speech recognition.

论文关键词:Pattern recognition,Subspace method,Learning algorithm,Orthogonal expansion

论文评审过程:Received 3 December 1981, Revised 13 July 1982, Accepted 20 October 1982, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(83)90064-X