An analysis of convergence for a learning version of the subspace method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3139261 (Why is no real title available?)
- scientific article; zbMATH DE number 3821631 (Why is no real title available?)
- scientific article; zbMATH DE number 3615730 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3278796 (Why is no real title available?)
- scientific article; zbMATH DE number 3340933 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- Analysis of recursive stochastic algorithms
- Application of the Karhunen-Loève Expansion to Feature Selection and Ordering
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Eigenvalue Properties of Projection Operators and Their Application to the Subspace Method of Feature Extraction
- Foundations of the theory of learning systems. Translated by Z. J. Nikolic
- Monotoneity Properties of Solutions of Hermitian Riccati Matrix Differential Equations
- On the generalized Karhunen-Loeve expansion (Corresp.)
- Randomly Generated Nonlinear Transformations for Pattern Recognition
- Regression and the Moore-Penrose pseudoinverse
- Stochastic approximation methods for constrained and unconstrained systems
Cited in
(1)
This page was built for publication: An analysis of convergence for a learning version of the subspace method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836997)
