Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link prediction problem, and develop approaches to link prediction based on measures the "proximity" of nodes in a network. Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
%0 Conference Paper
%1 Liben-Nowell-2007
%A Liben-Nowell, David
%A Kleinberg, Jon
%B CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management
%C New York, NY, USA
%D 2003
%I ACM
%K link_prediction
%P 556--559
%R http://doi.acm.org/10.1145/956863.956972
%T The link prediction problem for social networks
%U http://portal.acm.org/citation.cfm?id=956972
%X Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link prediction problem, and develop approaches to link prediction based on measures the "proximity" of nodes in a network. Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
%@ 1-58113-723-0
@inproceedings{Liben-Nowell-2007,
abstract = {Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link prediction problem, and develop approaches to link prediction based on measures the "proximity" of nodes in a network. Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.},
added-at = {2008-06-01T19:18:44.000+0200},
address = {New York, NY, USA},
author = {Liben-Nowell, David and Kleinberg, Jon},
biburl = {https://www.bibsonomy.org/bibtex/25ea4aec308221402c617efa9559e5ee5/kurtjx},
booktitle = {CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management},
doi = {http://doi.acm.org/10.1145/956863.956972},
interhash = {1920da9fec5905f031a0ab3919553362},
intrahash = {5ea4aec308221402c617efa9559e5ee5},
isbn = {1-58113-723-0},
keywords = {link_prediction},
location = {New Orleans, LA, USA},
pages = {556--559},
publisher = {ACM},
timestamp = {2008-06-01T19:18:44.000+0200},
title = {The link prediction problem for social networks},
url = {http://portal.acm.org/citation.cfm?id=956972},
year = 2003
}