A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis
From MaRDI portal
Publication:663375
DOI10.1016/J.PATCOG.2011.10.006zbMATH Open1231.68196OpenAlexW2006652788MaRDI QIDQ663375FDOQ663375
Publication date: 14 February 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.10.006
Recommendations
- Semi-supervised local Fisher discriminant analysis for dimensionality reduction
- Dimensionality Reduction by Integrating Sparse Representation and Fisher Criterion and its Applications
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Supervised dimension reduction of intrinsically low-dimensional data
- Semi-supervised double sparse graphs based discriminant analysis for dimensionality reduction
- Generalized null space uncorrelated Fisher discriminant analysis for linear dimensionality reduction
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Principal component analysis.
- Title not available (Why is that?)
- Penalized discriminant analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kernel Fisher discriminants.
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- Computational and theoretical analysis of null space and orthogonal linear discriminant analysis
- The Schur algorithm, reproducing kernel spaces and system theory. Transl. from the French by Stephen S. Wilson
- Graph-optimized locality preserving projections
Cited In (8)
- Subclass graph embedding and a marginal Fisher analysis paradigm
- A general framework for dimensionality reduction of K-means clustering
- A new linear discriminant analysis algorithm based on L1-norm maximization and locality preserving projection
- A study of the classification of low-dimensional data with supervised manifold learning
- Graph optimization for dimensionality reduction with sparsity constraints
- Solution for supervised graph embedding: A case study
- Global plus local: a complete framework for feature extraction and recognition
- How to solve classification and regression problems on high-dimensional data with a supervised extension of slow feature analysis
Uses Software
This page was built for publication: A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q663375)