LiveRank: How to Refresh Old DatasetsReport as inadecuate

LiveRank: How to Refresh Old Datasets - Download this document for free, or read online. Document in PDF available to download.

1 LINCS - Laboratory of Information, Network and Communication Sciences 2 Alcatel-Lucent Bell Labs France Nozay 3 GANG - Networks, Graphs and Algorithms LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt

Abstract : This paper considers the problem of refreshing a dataset. More precisely , given a collection of nodes gathered at some time Web pages, users from an online social network along with some structure hyperlinks, social relationships, we want to identify a significant fraction of the nodes that still exist at present time. The liveness of an old node can be tested through an online query at present time. We call LiveRank a ranking of the old pages so that active nodes are more likely to appear first. The quality of a LiveRank is measured by the number of queries necessary to identify a given fraction of the active nodes when using the LiveRank order. We study different scenarios from a static setting where the Liv-eRank is computed before any query is made, to dynamic settings where the LiveRank can be updated as queries are processed. Our results show that building on the PageRank can lead to efficient LiveRanks, for Web graphs as well as for online social networks.

Author: The Dang Huynh - Fabien Mathieu - Laurent Viennot -



Related documents