Enhanced graph-based dimensionality reduction with repulsion Laplaceans
From MaRDI portal
Publication:2270698
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
Cites work
- scientific article; zbMATH DE number 5046126 (Why is no real title available?)
- scientific article; zbMATH DE number 3327941 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- 10.1162/153244304322972667
- A spectral algorithm for envelope reduction of sparse matrices
- Discriminant neighborhood embedding for classification
- Graph Drawing
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Matrix Analysis
- On spectral graph drawing
- Principal component analysis.
- Self-organizing maps.
Cited in
(3)
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)