146
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
165
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
140
Voted
COLT
2005
Springer
15 years 10 months ago
2005
Springer
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...