Convergence proof of matrix dynamics for online linear discriminant analysis
From MaRDI portal
Publication:632750
Recommendations
- The dynamics of on-line principal component analysis
- Algorithms and networks for accelerated convergence of adaptive LDA
- Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
- Maxi-Min discriminant analysis via online learning
- Superlinear convergence of a general algorithm for the generalized Foley-Sammon discriminant analysis
Cites work
- scientific article; zbMATH DE number 3052156 (Why is no real title available?)
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- A simplified neuron model as a principal component analyzer
- Adaptive algorithms for first principal eigenvector computation
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Pattern classification.
- Pattern recognition and machine learning.
- Stochastic approximation methods for constrained and unconstrained systems
This page was built for publication: Convergence proof of matrix dynamics for online linear discriminant analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632750)