Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Problems of learning on manifolds
Problems of learning on manifolds
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
From graphs to manifolds – weak and strong pointwise consistency of graph laplacians
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Towards a theoretical foundation for laplacian-based manifold methods
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Cut locus and topology from surface point data
Proceedings of the twenty-fifth annual symposium on Computational geometry
Graph construction and b-matching for semi-supervised learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
A general learning framework using local and global regularization
Pattern Recognition
Perfect histogram matching PCA for face recognition
Multidimensional Systems and Signal Processing
Defining, contouring, and visualizing scalar functions on point-sampled surfaces
Computer-Aided Design
An iterated graph laplacian approach for ranking on manifolds
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Laplacian Support Vector Machines Trained in the Primal
The Journal of Machine Learning Research
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Anisotropic $\alpha$-Kernels and Associated Flows
SIAM Journal on Imaging Sciences
A Topological View of Unsupervised Learning from Noisy Data
SIAM Journal on Computing
Hearing the clusters of a graph: A distributed algorithm
Automatica (Journal of IFAC)
Local homology transfer and stratification learning
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Pattern Recognition Letters
On the relation of slow feature analysis and laplacian eigenmaps
Neural Computation
Nonrigid Matching of Undersampled Shapes via Medial Diffusion
Computer Graphics Forum
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Multidimensional spectral hashing
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Document Re-ranking Using Partial Social Tagging
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Manifold regularization and semi-supervised learning: some theoretical analyses
The Journal of Machine Learning Research
SMI 2013: Heat diffusion kernel and distance on surface meshes and point sets
Computers and Graphics
Surface- and volume-based techniques for shape modeling and analysis
SIGGRAPH Asia 2013 Courses
Nonparametric sparsity and regularization
The Journal of Machine Learning Research
| Hi-index | 0.00 |
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ''manifold-motivated'' as they lack any explicit theoretical guarantees. In this paper we take a step towards closing the gap between theory and practice for a class of Laplacian-based manifold methods. These methods utilize the graph Laplacian associated to a data set for a variety of applications in semi-supervised learning, clustering, data representation. We show that under certain conditions the graph Laplacian of a point cloud of data samples converges to the Laplace-Beltrami operator on the underlying manifold. Theorem 3.1 contains the first result showing convergence of a random graph Laplacian to the manifold Laplacian in the context of machine learning.