scientific article; zbMATH DE number 7255037

zbMath1497.68430arXiv1712.06206MaRDI QIDQ4969037

James M. Murphy, Anna V. Little, Mauro Maggioni

Publication date: 5 October 2020

Full work available at URL: https://arxiv.org/abs/1712.06206

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fast algorithmsunsupervised learningspectral clusteringmanifold learningshortest path distance

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (11)

Balancing Geometry and Density: Path Distances on High-Dimensional Data ⋮ Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation ⋮ Unnamed Item ⋮ Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations ⋮ Geometric scattering on measure spaces ⋮ Unnamed Item ⋮ Introducing User-Prescribed Constraints in Markov Chains for Nonlinear Dimensionality Reduction ⋮ Unnamed Item ⋮ A compositional model to assess expression changes from single-cell RNA-seq data ⋮ A multiscale environment for learning by diffusion ⋮ Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks

Uses Software

• UCI-ml
• COIL-20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuum limit of total variation on point clouds
• On Cartesian trees and range minimum queries
• Generalized density clustering
• A variational approach to the consistency of spectral clustering
• Foundations of a multi-way spectral clustering framework for hybrid linear modeling
• A linear time algorithm for the maximum capacity path problem
• A guided tour of Chernoff bounds
• The Min-Max Spanning Tree Problem and some extensions
• The longest edge of the random minimal spanning tree
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• A strong law for the longest edge of the minimal spanning tree
• The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
• A geometric analysis of subspace clustering with outliers
• Spectral clustering based on local linear approximations
• Robust subspace clustering
• The geometry of kernelized spectral clustering
• Robust path-based spectral clustering
• Diffusion maps
• Consistency of Cheeger and Ratio Graph Cuts
• Algorithms for the Assignment and Transportation Problems
• Curvature Measures
• Integration and Modern Analysis
• On Cartesian Trees and Range Minimum Queries
• Algorithms for two bottleneck optimization problems
• Random Plane Networks
• Consistency of Single Linkage for High-Density Clusters
• Multidimensional binary search trees used for associative searching
• Beyond kappa: A review of interrater agreement measures
• The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• Community Detection and Stochastic Block Models
• An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
• A Simple SVD Algorithm for Finding Hidden Partitions
• Clustering subgaussian mixtures by semidefinite programming
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
• Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: