An analysis of convergence for a learning version of the subspace method

DOI10.1016/0022-247X(83)90095-1zbMath0506.68069MaRDI QIDQ1836997

Juha Karhunen, Erkki Oja

Publication date: 1983

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

pattern recognitionsubspace classifierpattern space

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items

On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic approximation methods for constrained and unconstrained systems
• Computational aspects of F. L. Bauer's simultaneous iteration method
• Regression and the Moore-Penrose pseudoinverse
• Foundations of the theory of learning systems. Translated by Z. J. Nikolic
• Eigenvalue Properties of Projection Operators and Their Application to the Subspace Method of Feature Extraction
• Analysis of recursive stochastic algorithms
• Randomly Generated Nonlinear Transformations for Pattern Recognition
• On the generalized Karhunen-Loeve expansion (Corresp.)
• Application of the Karhunen-Loève Expansion to Feature Selection and Ordering
• Monotoneity Properties of Solutions of Hermitian Riccati Matrix Differential Equations