Skip to Main content Skip to Navigation
Conference papers

Cold Start Link Prediction

Abstract : In the traditional link prediction problem, a snapshot of a so- cial network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely to ap- pear in the future. In this paper, we introduce cold start link prediction as the problem of predicting the structure of a social network when the network itself is totally missing while some other information regarding the nodes is avail- able. We propose a two-phase method based on the bootstrap probabilistic graph. The first phase generates an implicit so- cial network under the form of a probabilistic graph. The second phase applies probabilistic graph-based measures to produce the final prediction. We assess our method empiri- cally over a large data collection obtained from Flickr, using interest groups as the initial information. The experiments confirm the effectiveness of our approach.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00485619
Contributor : Vincent Leroy <>
Submitted on : Friday, May 21, 2010 - 11:38:42 AM
Last modification on : Tuesday, June 15, 2021 - 4:13:29 PM
Long-term archiving on: : Thursday, September 16, 2010 - 2:49:46 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00485619, version 1

Citation

Vincent Leroy, B. Barla Cambazoglu, Francesco Bonchi. Cold Start Link Prediction. The 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Jul 2010, Washington DC, United States. 12 p. ⟨inria-00485619⟩

Share

Metrics

Record views

771

Files downloads

1453