The link‐prediction problem for social networks

Wiley - Tập 58 Số 7 - Trang 1019-1031 - 2007
David Liben‐Nowell1, Jon Kleinberg2
1Department of Computer Science, Carleton College, Northfield, MN 55057
2.Department of Computer Science Cornell University Ithaca, NY, 14853,

Tóm tắt

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 we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a network. Experiments on large coauthorship 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.

Từ khóa


Tài liệu tham khảo

10.1016/S0378-8733(03)00009-1

10.1126/science.286.5439.509

10.1016/S0378-4371(02)00736-7

10.1016/S0169-7552(98)00110-X

10.1007/BF03025416

Davidsen J., 2002, Emergence of a small world from local interactions: Modeling acquaintance networks, Physical Review Letters, 88

10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9

10.1006/iilr.1999.0103

Essen U., 1992, 161

10.1073/pnas.0735871100

Grossman J.W., 2002, The evolution of the mathematical research collaboration graph, Congressus Numerantium, 158, 201

Haveliwala T. Kamvar S. &Jeh G.(2003).An analytical comparison of approaches to personalizing PageRank (Technical Report). Stanford CA: Stanford University.

10.1109/TKDE.2003.1208999

Jeh G., 2002, Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 271

Jeh G., 2003, Proceedings of the 12th International World Wide Web Conference (WWW12), 271, 10.1145/775152.775191

Jin E.M., 2001, The structure of growing social networks, Physical Review Letters E, 64

Kamvar S.D. Haveliwala T.H. Manning C.D. &Golub G.H.(2003).Exploiting the block structure of the Web for computing PageRank (Technical Report). Stanford CA: Stanford University.

10.1007/BF02018100

10.1016/S0048-7333(96)00917-1

10.1007/BF02289026

10.1145/245108.245123

Krebs V., 2002, Mapping networks of terrorist cells, Connections, 24, 43

Lee L., 1999, Proceedings of the Annual Meeting of the Association for Computational Linguistics, 25

10.1007/BF02129600

10.1080/15427951.2004.10129088

10.1017/CBO9780511814075

Newman M.E.J., 2001, Clustering and preferential attachment in growing networks, Physical Review Letters E, 64

10.1073/pnas.98.2.404

10.1016/S0010-4655(02)00201-1

10.1137/S003614450342480

Palmer C., 2002, Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 81

Popescul A., 2003, Workshop on Learning Statistical Models From Relational Data at the International Joint Conference on Artificial Intelligence, 81

10.1109/4236.989007

Salton G., 1983, Introduction to modern information retrieval

Schölkopf B. Platt J.C. Shawe‐Taylor J. Smola A.J. &Williamson R.C.(1999).Estimating the support of a high‐dimensional distribution (Technical Report. No. MSR‐TR‐99–87). Microsoft Research.

Taskar B., 2003, Proceedings of Neural Information Processing Systems, 659

10.1515/9780691188331

10.1038/30918

10.1145/956863.956909