Convergence proof of matrix dynamics for online linear discriminant analysis
From MaRDI portal
Publication:632750
DOI10.1016/J.JMVA.2010.12.005zbMATH Open1327.62375OpenAlexW2007091177MaRDI QIDQ632750FDOQ632750
Authors: Kazuyuki Hiraoka
Publication date: 25 March 2011
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2010.12.005
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Pattern recognition and machine learning.
- Stochastic approximation methods for constrained and unconstrained systems
- Pattern classification.
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- A simplified neuron model as a principal component analyzer
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Adaptive algorithms for first principal eigenvector computation
- Title not available (Why is that?)
Uses Software
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)