.png){kind=icon}
.png){kind=icon}
Return
Spectral Connectivity Analysis
.png){kind=icon}
OA
AI
DOI：10.1198/jasa.2010.tm09754.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spectral kernel methods are techniques or mapping data into a coordinate system that efficiently reveals the geometric structure-in particular, the connectivity-of the data. These methods depend on tuning parameters. We analyze the dependence of the method on these tuning parameters. We focus on one particular technique-diffusion maps-but our analysis can be used for other spectral methods as well. We identify the key population quantities, we define an appropriate risk function for analyzing the estimators, and we explain how these methods relate to classical kernel smoothing. We also show that, in some cases, fast rates of convergence are possible even in high dimensions. The Appendix of the article is available online as supplementary materials.
Keywords:
Diffusion maps
Graph Laplacian
Kernels
Manifold learning
Smoothing
Spectral clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.1K
Citations:
4.8W