Difference between revisions of "Finding Related Pages Using Green Measures: an Illustration with Wikipedia"
(Finding Related Pages Using Green Measures: an Illustration with Wikipedia - new page) |
(Wikilinks) |
||
| Line 1: | Line 1: | ||
| − | '''Finding Related Pages Using Green Measures: an Illustration with Wikipedia''' - scientific work related to Wikipedia quality published in 2007, written by Yann Ollivier and Pierre Senellart. | + | '''Finding Related Pages Using Green Measures: an Illustration with Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2007, written by [[Yann Ollivier]] and [[Pierre Senellart]]. |
== Overview == | == Overview == | ||
| − | Authors 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. Authors test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. Authors present an extensive comparative study of the performance of 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. | + | Authors 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. Authors test it in the case of the hyperlink structure of the English version of [[Wikipedia]], the on-line encyclopedia. Authors present an extensive comparative study of the performance of 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. |
Revision as of 09:01, 2 February 2021
Finding Related Pages Using Green Measures: an Illustration with Wikipedia - scientific work related to Wikipedia quality published in 2007, written by Yann Ollivier and Pierre Senellart.
Overview
Authors 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. Authors test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. Authors present an extensive comparative study of the performance of 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.
