Enhanced graph-based dimensionality reduction with repulsion Laplaceans
From MaRDI portal
Publication:2270698
DOI10.1016/j.patcog.2009.04.005zbMath1176.68182MaRDI QIDQ2270698
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.04.005
supervised learning; orthogonal projections; face recognition; linear dimensionality reduction; graph Laplacean
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
Related Items
A two-dimensional neighborhood preserving projection for appearance-based face recognition, Towards collaborative feature extraction for face recognition, DISCOVERING ROBUST EMBEDDINGS IN (DIS)SIMILARITY SPACE FOR HIGH-DIMENSIONAL LINGUISTIC FEATURES
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Principal component analysis.
- Discriminant neighborhood embedding for classification
- On Spectral Graph Drawing
- 10.1162/153244304322972667
- Matrix Analysis
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- A spectral algorithm for envelope reduction of sparse matrices
- Graph Drawing
- Self-organizing maps.