A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis

DOI10.1016/j.patcog.2011.10.006zbMath1231.68196OpenAlexW2006652788MaRDI QIDQ663375

Liya Fan, Yan Cui

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

zbMATH Keywords

positive definite kernelsdimensionality reductionindefinite kernelsintrinsic graphpenalty graph

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (5)

Subclass graph embedding and a marginal Fisher analysis paradigm ⋮ Global plus local: a complete framework for feature extraction and recognition ⋮ A general framework for dimensionality reduction of K-means clustering ⋮ Unnamed Item ⋮ A new linear discriminant analysis algorithm based on L1-norm maximization and locality preserving projection

Uses Software

• KPCA plus LDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph-optimized locality preserving projections
• Principal component analysis.
• Penalized discriminant analysis
• A direct LDA algorithm for high-dimensional data -- with application to face recognition

This page was built for publication: A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis