A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances

@inproceedings{Yen2008AFO,
  title={A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances},
  author={Luh Yen and Marco Saerens and Amin Mantrach and Masashi Shimbo},
  booktitle={KDD},
  year={2008}
}
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimilarity, depends on a parameter θ and has the interesting property of reducing, on one end, to the standard shortest-path distance when θ is large and, on the other end, to the commute-time (or resistance) distance when θ is small (near zero). Intuitively, it corresponds to the expected cost incurred by a random walker… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Cyclic flows, Markov process and stochastic traffic assignment

  • T. Akamatsu
  • Transportation Research B,
  • 1996
Highly Influential
5 Excerpts

Resistance distance

  • D. J. Klein, M. Randic
  • Journal of Mathematical Chemistry,
  • 1993
Highly Influential
7 Excerpts

Link-based community detection based on the sigmoid commute-time kernel

  • L. Yen, F. Fouss, C. Decaestecker, P. Francq, M. Saerens
  • Manuscript submitted for publication,
  • 2008
Highly Influential
4 Excerpts

A measure of betweenness centrality based on random walks

  • M. Newman
  • Social Networks,
  • 2005
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…