PageRank beyond the web
DF Gleich - siam REVIEW, 2015 - SIAM
Google's PageRank method was developed to evaluate the importance of web-pages via
their link structure. The mathematics of PageRank, however, are entirely general and apply …
their link structure. The mathematics of PageRank, however, are entirely general and apply …
[PDF][PDF] Highly predictive blacklisting.
J Zhang, PA Porras, J Ullrich - USENIX security symposium, 2008 - usenix.org
The notion of blacklisting communication sources has been a well-established defensive
measure since the origins of the Internet community. In particular, the practice of compiling …
measure since the origins of the Internet community. In particular, the practice of compiling …
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random
surfer model governed by a teleportation parameter. Commonly denoted alpha, this …
surfer model governed by a teleportation parameter. Commonly denoted alpha, this …
Automatically generating reading lists
JG Jardine - 2014 - cl.cam.ac.uk
This thesis addresses the task of automatically generating reading lists for novices in a
scientific field. Reading lists help novices to get up to speed in a new field by providing an …
scientific field. Reading lists help novices to get up to speed in a new field by providing an …
Contents and time sensitive document ranking of scientific literature
H Xu, E Martin, A Mahidadia - Journal of Informetrics, 2014 - Elsevier
A new link-based document ranking framework is devised with at its heart, a contents and
time sensitive random literature explorer designed to more accurately model the behaviour …
time sensitive random literature explorer designed to more accurately model the behaviour …
Randomly sparsified Richardson iteration is really fast
J Weare, RJ Webber - arXiv preprint arXiv:2309.17270, 2023 - arxiv.org
Recently, a class of algorithms combining classical fixed point iterations with repeated
random sparsification of approximate solution vectors has been successfully applied to …
random sparsification of approximate solution vectors has been successfully applied to …
Monte carlo methods for top-k personalized pagerank lists and name disambiguation
K Avrachenkov, N Litvak, DA Nemirovsky… - arXiv preprint arXiv …, 2010 - arxiv.org
We study a problem of quick detection of top-k Personalized PageRank lists. This problem
has a number of important applications such as finding local cuts in large graphs, estimation …
has a number of important applications such as finding local cuts in large graphs, estimation …
Large-Scale Analysis of Wikipedia's Link Structure and its Applications in Learning Path Construction
Y Song, CH Leung - … on Information Reuse and Integration for …, 2023 - ieeexplore.ieee.org
As the largest encyclopedia in history, Wikipedia represents an unprecedented unification of
the world's knowledge. Its internal links are an invaluable resource for understanding the …
the world's knowledge. Its internal links are an invaluable resource for understanding the …
[PDF][PDF] The impact of Wikipedia on scientific research
R Khoury - 3rd International Conference on Internet Technologies …, 2009 - ift.ulaval.ca
Recently, many researchers have conducted scientific studies with, about, or using the
online encyclopaedia known as Wikipedia. While they have obtained promising results and …
online encyclopaedia known as Wikipedia. While they have obtained promising results and …
Utilizing Wikipedia for Text Mining Applications
M Qureshi - 2015 - boa.unimib.it
Textual data forms a popular form of communication; however, textual data is complex in
nature as it is produced by humans. Given the huge amount of textual data currently …
nature as it is produced by humans. Given the huge amount of textual data currently …