Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds

DOI10.1137/18M1188999zbMath1499.49058arXiv1607.00696OpenAlexW2963144360MaRDI QIDQ5025776

No author found.

Publication date: 3 February 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

gamma-convergencespectral clusteringgraph cutdiscrete to continuum limitCheeger cut\(k\)-NN graph

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Geometric probability and stochastic geometry (60D05) Graph theory (including graph drawing) in computer science (68R10) Methods involving semicontinuity and convergence; relaxation (49J45) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (5)

Large data limit for a phase transition model with the p-Laplacian on point clouds ⋮ A continuum limit for the PageRank algorithm ⋮ Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs ⋮ Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs ⋮ Unnamed Item

Cites Work

• Continuum limit of total variation on point clouds
• A new approach to Sobolev spaces and connections to \(\Gamma\)-convergence
• A variational approach to the consistency of spectral clustering
• Towards a theoretical foundation for Laplacian-based manifold methods
• An introduction to \(\Gamma\)-convergence
• Consistency of spectral clustering
• Diffusion maps
• From graph to manifold Laplacian: the convergence rate
• Consistency of Cheeger and Ratio Graph Cuts
• Sets of Finite Perimeter and Geometric Variational Problems
• A new analytical approach to consistency and overfitting in regularized empirical risk minimization
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
• Continuum Limits of Posteriors in Graph Bayesian Inverse Problems
• On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
• Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
• Random Geometric Graphs
• Spectral convergence of the connection Laplacian from random samples
• The game theoreticp-Laplacian and semi-supervised learning with few labels
• The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
• Analysis of $p$-Laplacian Regularization in Semisupervised Learning
• Learning Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds