@inproceedings{ollivier2007finding,
  abstract = {We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, adjustment-free and easy to implement. We test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. We present an extensive comparative study of the performance of our method versus several other classical methods in the case of Wikipedia. The Green method is found to have both the best average results and the best robustness.},
  acmid = {1619874},
  author = {Ollivier, Yann and Senellart, Pierre},
  booktitle = {Proceedings of the 22nd national conference on Artificial intelligence},
  interhash = {a291b1b4e195dd09a11c8ffe329fc0e5},
  intrahash = {76e219fe6e8a257b30c6665af8b273da},
  isbn = {978-1-57735-323-2},
  location = {Vancouver, British Columbia, Canada},
  numpages = {7},
  pages = {1427--1433},
  publisher = {AAAI Press},
  title = {Finding related pages using Green measures: an illustration with Wikipedia},
  url = {http://dl.acm.org/citation.cfm?id=1619797.1619874},
  volume = 2,
  year = 2007
}