Diffusion representations
From MaRDI portal
Publication:723009
DOI10.1016/j.acha.2016.10.003zbMath1391.68096arXiv1511.06208OpenAlexW4206927375WikidataQ110233659 ScholiaQ110233659MaRDI QIDQ723009
Moshe Salhov, Guy Wolf, Amit Bermanis, Amir Z. Averbuch
Publication date: 30 July 2018
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06208
dimensionality reductionmanifold learningdiffusion mapskernel PCAdiffusion distancedistance preservation
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (3)
Diffusion-based kernel methods on Euclidean metric measure spaces ⋮ Diffusion representation for asymmetric kernels ⋮ Geometric component analysis and its applications to data analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Diffusion-based kernel methods on Euclidean metric measure spaces
- Hierarchical data organization, clustering and denoising via localized diffusion folders
- Measure-based diffusion grid construction and high-dimensional data discretization
- Multiscale data sampling and function extension
- Cover-based bounds on the numerical rank of Gaussian kernels
- Recent advances in trust region algorithms
- Diffusion maps
- Efficient graph-based image segmentation
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Graph Coloring Using Eigenvalue Decomposition
- Computing a Trust Region Step
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- Audio-Visual Group Recognition Using Diffusion Maps
- Parametrization of Linear Systems Using Diffusion Kernels
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Fast computation of low rank matrix approximations
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- Maximization by Quadratic Hill-Climbing
- Estimating the components of a mixture of normal distributions
This page was built for publication: Diffusion representations
