Logarithmic proximity measures outperform plain ones in graph nodes clustering.

Vladimir Ivashkin Pavel Chebotarev

Published in: CoRR (2016)

Keyphrases

proximity measures
random walk
distance measure
neighborhood structure
link prediction
similarity measure
directed graph
markov chain
edit distance
retrieval model
graph structure
bayesian networks
k means
data points
data clustering