作者
Michael Fire, Lena Tenenboim, Ofrit Lesser, Rami Puzis, Lior Rokach, Yuval Elovici
发表日期
2011/10/9
研讨会论文
2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing
页码范围
73-80
出版商
IEEE
简介
Online social networking sites have become increasingly popular over the last few years. As a result, new interdisciplinary research directions have emerged in which social network analysis methods are applied to networks containing hundreds millions of users. Unfortunately, links between individuals may be missing due to imperfect acquirement processes or because they are not yet reflected in the online network (i.e., friends in real world did not form a virtual connection.) Existing link prediction techniques lack the scalability required for full application on a continuously growing social network which may be adding everyday users with thousands of connections. The primary bottleneck in link prediction techniques is extracting structural features required for classifying links. In this paper we propose a set of simple, easy-to-compute structural features that can be analyzed to identify missing links. We show that a …
引用总数
2011201220132014201520162017201820192020202120222023202431222252623232517231811156
学术搜索中的文章
M Fire, L Tenenboim, O Lesser, R Puzis, L Rokach… - 2011 IEEE third international conference on privacy …, 2011