Subspace methods are a powerful class of statistical pattern classiication algorithms. They are traditionally considered nonparametric or semiparametric models, which means that the classiier does not produce the a posteriori probability of the input vector. This paper, however, presents a novel density estimation interpretation for the subspace methods. As a byproduct, the problem of unequal priors, which occurs if standard subspace methods are used when the a priori probabilities of the classes are unequal, is eliminated. As well, the a posteriori probability produced by the suggested method can be used to implement a plausible rejection method for diicultly classiiable patterns. At the end of this presentation, the applicability of the proposed probability density function interpretation is demonstrated with experiments.
[1]
T. Obremski.
Practical Nonparametric Statistics (2nd ed.)
,
1981
.
[2]
Erkki Oja,et al.
Neural and statistical classifiers-taxonomy and two case studies
,
1997,
IEEE Trans. Neural Networks.
[3]
G. Saridis.
Parameter estimation: Principles and problems
,
1983,
Proceedings of the IEEE.
[4]
Erkki Oja,et al.
Subspace Dimension Selection and Averaged Learning Subspace Method in Handwritten Digit Classification
,
1996,
ICANN.
[5]
J. Mendel.
Lessons in Estimation Theory for Signal Processing, Communications, and Control
,
1995
.
[6]
Erkki Oja,et al.
Subspace methods of pattern recognition
,
1983
.