Learning Theory

DOI10.1007/b137542zbMath1137.68521MaRDI QIDQ5473632

Mikhail Belkin, Partha Niyogi

Publication date: 22 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137542

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68T05: Learning and adaptive systems in artificial intelligence

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Learning Binary Hash Codes for Large-Scale Image Search, Spectral Techniques to Explore Point Clouds in Euclidean Space, with Applications to Collective Coordinates in Structural Biology, Universally consistent vertex classification for latent positions graphs, The use of unlabeled data in predictive modeling, Orientability and diffusion maps, Sampling, filtering and sparse approximations on combinatorial graphs, A Riemannian approach to graph embedding, Non-linear independent component analysis with diffusion maps, Towards a theoretical foundation for Laplacian-based manifold methods, Learning and approximation by Gaussians on Riemannian manifolds, Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs, Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces, Diffusion maps, spectral clustering and reaction coordinates of dynamical systems, From graph to manifold Laplacian: the convergence rate, Spectral independent component analysis