Incremental linear discriminant analysis using sufficient spanning sets and its applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5957283 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- Semi-supervised learning on Riemannian manifolds
- The pyramid match kernel: efficient learning with sets of features
Cited in
(10)- Incremental linear discriminate analysis based on a residual natural power method
- Feature extraction by using dual-generalized discriminative common vectors
- Incremental regularized least squares for dimensionality reduction of large-scale data
- Incremental supervised subspace learning for face recognition
- Incremental sample dimensionality reduction and recognition based on clustering adaptively manifold learning
- Advances in Neural Networks – ISNN 2005
- Incremental supervised subspace learning for face recognition
- An online incremental orthogonal component analysis method for dimensionality reduction
- Incremental learning of discriminant common vectors for feature extraction
- Incremental complete LDA for face recognition
This page was built for publication: Incremental linear discriminant analysis using sufficient spanning sets and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408852)