Consistency of regularized spectral clustering

DOI10.1016/j.acha.2010.09.002zbMath1216.68213OpenAlexW1976336580MaRDI QIDQ533498

Ying Cao, Di-Rong Chen

Publication date: 3 May 2011

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2010.09.002

zbMATH Keywords

graph Laplacianlearning rateregularized spectral clusteringtarget function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary ⋮ Generalization errors of Laplacian regularized least squares regression ⋮ On the regularized Laplacian eigenmaps ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Performance analysis of the LapRSSLG algorithm in learning theory ⋮ A signal-diffusion-based spectral clustering method for community detection ⋮ The geometry of kernelized spectral clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Geometry on probability spaces
• Spectral partitioning works: planar graphs and finite element meshes
• Strong consistency of k-means clustering
• The covering number in learning theory
• Optimum bounds for the distributions of martingales in Banach spaces
• Consistency of spectral clustering
• Learning rates of least-square regularized regression
• Shannon sampling. II: Connections to learning theory
• Learning theory estimates via integral operators and their approximations
• On the mathematical foundations of learning
• Learning Theory
• Capacity of reproducing kernel spaces in learning theory
• Consistency of Single Linkage for High-Density Clusters
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Theory of Reproducing Kernels

This page was built for publication: Consistency of regularized spectral clustering