scientific article; zbMATH DE number 7370580
From MaRDI portal
Publication:4998963
Authors:
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1901.10651
Title of this publication is not available (Why is that?)
Recommendations
- Geometrical embeddings of graphs
- Graph Embeddings and Laplacian Eigenvalues
- Simultaneous Geometric Graph Embeddings
- Graph embeddings and simplicial maps
- scientific article; zbMATH DE number 510842
- Embeddings of graphs in Euclidean spaces
- A Riemannian approach to graph embedding
- scientific article; zbMATH DE number 2149406
- Geodesic embeddings and planar graphs
- Geometric Characterizations of Graphs Using Heat Kernel Embeddings
Cites Work
- Spectral clustering and the high-dimensional stochastic blockmodel
- Diffusion maps
- Measure theory. Vol. I and II
- The Rotation of Eigenvectors by a Perturbation. III
- Towards a theoretical foundation for Laplacian-based manifold methods
- Consistency of spectral clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- The geometry of kernelized spectral clustering
- Learning Theory
- Variational Analysis in Sobolev and BV Spaces
- A graph discretization of the Laplace-Beltrami operator
- A Note on the Generalized Dumbbell Problem
- Analysis of \(p\)-Laplacian regularization in semisupervised learning
- A variational approach to the consistency of spectral clustering
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Convergence of Laplacian spectra from random samples
- Continuum limits of posteriors in graph Bayesian inverse problems
- Title not available (Why is that?)
- Variational limits of \(k\)-NN graph-based functionals on data clouds
- A new analytical approach to consistency and overfitting in regularized empirical risk minimization
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
Cited In (10)
- Geometric structure of graph Laplacian embeddings
- Model change active learning in graph-based semi-supervised learning
- Geometric Characterizations of Graphs Using Heat Kernel Embeddings
- Geometrical embeddings of graphs
- Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
- Spectral analysis of weighted Laplacians arising in data clustering
- Title not available (Why is that?)
- Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998963)