scientific article; zbMATH DE number 7626762
From MaRDI portal
Publication:5053269
Ryan J. Tibshirani, Alden Green, Sivaraman Balakrishnan
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/1911.09714
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal rates for plug-in estimators of density level sets
- Generalized density clustering
- Spectral clustering and the high-dimensional stochastic blockmodel
- Minimax theory of image reconstruction
- A variational approach to the consistency of spectral clustering
- Adaptive Hausdorff estimation of density level sets
- Fully adaptive density-based clustering
- Data spectroscopy: eigenspaces of convolution operators and clustering
- On nonparametric estimation of density level sets
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Random matrix approximation of spectra of integral operators
- Spectral convergence of graph Laplacian and heat kernel reconstruction in \(L^\infty\) from random samples
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Consistency of spectral clustering in stochastic block models
- The geometry of kernelized spectral clustering
- Consistency of spectral clustering
- Evolving sets, mixing and heat kernel bounds
- Spectral analysis of weighted Laplacians arising in data clustering
- Consistency of Cheeger and Ratio Graph Cuts
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Spectral Sparsification of Graphs
- On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
- Consistency of Single Linkage for High-Density Clusters
- A First Course in Sobolev Spaces
- Spectral convergence of the connection Laplacian from random samples
- Lipschitz Regularity of Graph Laplacians on Random Data Clouds
- A continuum limit for the PageRank algorithm
- Finding sparse cuts locally using evolving sets
- DBSCAN: Optimal Rates For Density Based Clustering
- Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
- Convex and Discrete Geometry
- Operator norm convergence of spectral clustering on level sets
- Local Partitioning for Directed Graphs Using PageRank
- Distances of Probability Measures and Random Variables
- Hierarchical Community Detection by Recursive Partitioning
This page was built for publication:
