Hitting and commute times in large random neighborhood graphs.

Ulrike von Luxburg Agnes Radl Matthias Hein

Published in: J. Mach. Learn. Res. (2014)

Keyphrases

neighborhood graph
random walk
manifold learning
knn
minimum spanning trees
data distribution
data points
data sets
markov chain
machine learning
euclidean distance
image processing
k nearest neighbor
graph construction