Abstract | ||
---|---|---|
In this paper, we describe our on-going research on the problem of predicting needed hyperlinks between pairs of Wikipedia pages (u,v) that are not connected, yet show readers' search navigation from u to v. We propose a solution that first estimates how long will these searches last and then predicts new hyperlinks according to descending order of duration. Our initial experimental results show that our best solution achieves an AUROC of 0.77 on the Wikipedia Clickstream dataset and a [email protected]% of 1.0 and significantly beats the baselines.
|
Year | DOI | Venue |
---|---|---|
2018 | 10.1145/3184558.3191644 | WWW '18: The Web Conference 2018
Lyon
France
April, 2018 |
DocType | ISBN | Citations |
Conference | 978-1-4503-5640-4 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Laxmi Amulya Gundala | 1 | 0 | 1.35 |
Francesca Spezzano | 2 | 80 | 19.08 |