scientific article; zbMATH DE number 7164760
From MaRDI portal
Publication:5214254
zbMath1440.68233arXiv1810.06702MaRDI QIDQ5214254
James M. Murphy, Mauro Maggioni
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1810.06702
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Unnamed Item ⋮ Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations ⋮ Time-Inhomogeneous Diffusion Geometry and Topology ⋮ Functional diffusion maps ⋮ The noncommutative $\ell_1-\ell_2$ inequality for Hilbert C*-modules and the exact constant ⋮ A multiscale environment for learning by diffusion ⋮ Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Geometric bounds for eigenvalues of Markov chains
- Non-linear independent component analysis with diffusion maps
- Stochastic methods. A handbook for the natural and social sciences
- Data spectroscopy: eigenspaces of convolution operators and clustering
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Comparison theorems for reversible Markov chains
- Learning the geometry of common latent variables using alternating-diffusion
- Hybrid linear modeling via local best-fit flats
- Spectral clustering based on local linear approximations
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Robust subspace clustering
- Good (K-means) clusterings are unique (up to small perturbations)
- Latent common manifold learning with alternating diffusion: analysis and applications
- The geometry of kernelized spectral clustering
- Two faces of active learning
- Diffusion maps
- Consistency of Cheeger and Ratio Graph Cuts
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Normalized Cuts Are Approximately Inverse Exit Times
- Vector diffusion maps and the connection Laplacian
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels
- Local Partitioning for Directed Graphs Using PageRank
- Diffusion Maps, Reduction Coordinates, and Low Dimensional Representation of Stochastic Systems
- Approximating the Permanent
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Consistency of Single Linkage for High-Density Clusters
- The estimation of the gradient of a density function, with applications in pattern recognition
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Statistical inference on random dot product graphs: a survey
- Clustering subgaussian mixtures by semidefinite programming
- Spectral convergence of the connection Laplacian from random samples
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Finding sparse cuts locally using evolving sets
- The exact constant for the ℓ_1-ℓ_2 norm inequality
- Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
- Learning Theory
- Aggregation of Variables in Dynamic Systems
- Non-Parametric Inference for Density Modes
- Large deviations
- The elements of statistical learning. Data mining, inference, and prediction
