LiveRank: How to Refresh Old Datasets - Archive ouverte HAL Access content directly
Journal Articles Internet Mathematics Year : 2015

LiveRank: How to Refresh Old Datasets

(1, 2) , (2, 1) , (3, 1)
1
2
3

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.
Fichier principal
Vignette du fichier
liverank_journal.pdf (4.3 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01251552 , version 1 (06-01-2016)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

The Dang Huynh, Fabien Mathieu, Laurent Viennot. LiveRank: How to Refresh Old Datasets. Internet Mathematics, 2015, ⟨10.1080/15427951.2015.1098756⟩. ⟨hal-01251552⟩
209 View
168 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More