99 search results - page 2 / 20 » An Analysis of the Convergence of Graph Laplacians |
COLT
2005
Springer
13 years 10 months ago
2005
Springer
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ā...
ML
2010
ACM
12 years 11 months ago
2010
ACM
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
In the machine learning community it is generally believed that graph Laplacians corresponding to a ļ¬nite sample of data points converge to a continuous Laplace operator if the s...
NIPS
2008
13 years 6 months ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...