Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
From MaRDI portal
Recommendations
- Null Foley-Sammon transform
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- Advances in Neural Networks – ISNN 2005
- Geometric linear discriminant analysis for pattern recognition
- A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
Cited in
(49)- Fast adaptive algorithms and networks for class-separability features.
- Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- Maxi-Min discriminant analysis via online learning
- Fuzzy linear discriminant analysis-guided maximum entropy fuzzy clustering algorithm
- On an eigenvector-dependent nonlinear eigenvalue problem from the perspective of relative perturbation theory
- A density matrix approach to the convergence of the self-consistent field iteration
- On generalizing trace minimization principles
- Flexible non-greedy discriminant subspace feature extraction
- On general matrix exponential discriminant analysis methods for high dimensionality reduction
- On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients
- Fast discriminative stochastic neighbor embedding analysis
- MBLDA: a novel multiple between-class linear discriminant analysis
- A comparison of generalized linear discriminant analysis algorithms
- Algorithms and networks for accelerated convergence of adaptive LDA
- Laplacian linear discriminant analysis
- A Rayleigh-Ritz style method for large-scale discriminant analysis
- New results on multi-dimensional linear discriminant analysis
- Perturbation analysis for the trace quotient problem
- Ratio trace criterion for marginal discriminant projection
- The iterative solution of linear discriminant analysis and its application
- A new and fast orthogonal linear discriminant analysis on undersampled problems
- Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems
- The variables affecting the performance of LDA
- Characterization of all solutions for undersampled uncorrelated linear discriminant analysis problems
- A Least Squares Approach to Linear Discriminant Analysis
- FAST CLUSTERING-BASED KERNEL FOLEY–SAMMON TRANSFORM
- Superlinear convergence of a general algorithm for the generalized Foley-Sammon discriminant analysis
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- A note on the trace quotient problem
- scientific article; zbMATH DE number 7267211 (Why is no real title available?)
- A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
- Advances in Neural Networks – ISNN 2005
- An eigenvalue-based method for the unbalanced Procrustes problem
- On the generalized trace ratio problem
- A branch and bound method solving the max–min linear discriminant analysis problem
- Trace ratio optimization with an application to multi-view learning
- Convergence proof of matrix dynamics for online linear discriminant analysis
- Locally unitarily invariantizable NEPv and convergence analysis of SCF
- A theory of the NEPv approach for optimization on the Stiefel manifold
- A nonlinear eigenvalue problem associated with the sum-of-Rayleigh-quotients maximization
- A convergence analysis on the iterative trace ratio algorithm and its refinements
- Globally maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold
- A subspace method for large-scale trace ratio problems
- The multi-class Stackelberg prediction game with least squares loss
- Variations of orthonormal basis matrices of subspaces
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- A new and fast implementation for null space based linear discriminant analysis
This page was built for publication: Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053112)
