Enhanced graph-based dimensionality reduction with repulsion Laplaceans
DOI10.1016/J.PATCOG.2009.04.005zbMATH Open1176.68182OpenAlexW2142130234MaRDI QIDQ2270698FDOQ2270698
Authors: Yanyan Li 
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
Recommendations
- Graph Embeddings and Laplacian Eigenvalues
- Graph optimization for dimensionality reduction with sparsity constraints
- Discriminative and geometry-preserving adaptive graph embedding for dimensionality reduction
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Intrinsic graph structure estimation using graph Laplacian
- scientific article; zbMATH DE number 7370580
supervised learningface recognitionorthogonal projectionslinear dimensionality reductiongraph Laplacean
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Principal component analysis.
- Matrix Analysis
- Title not available (Why is that?)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- 10.1162/153244304322972667
- Title not available (Why is that?)
- Self-organizing maps.
- A spectral algorithm for envelope reduction of sparse matrices
- On spectral graph drawing
- Title not available (Why is that?)
- Discriminant neighborhood embedding for classification
- Graph Drawing
Cited In (3)
Uses Software
This page was built for publication: Enhanced graph-based dimensionality reduction with repulsion Laplaceans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270698)
