0


在大型网络中学习推断社会关系

Learning to Infer Social Ties in Large Network
课程网址: http://videolectures.net/ecmlpkdd2011_tang_learning/  
主讲教师: Wenbin Tang
开课单位: 清华大学
开课时间: 2011-10-03
课程语种: 英语
中文简介:
在在线社交网络中,大多数关系都缺乏意义标签(例如,";同事";和";亲密朋友";),这仅仅是因为用户不花时间给它们贴标签。一个有趣的问题是:我们能自动推断出大型网络中的社会关系类型吗?什么是暗示社会关系类型的基本因素?在这项工作中,我们将社会关系学习问题形式化为一个半监督框架,并提出了一个部分标记的成对因子图模型(PLP-FGM),用于学习推断社会关系的类型。我们在三种不同类型的数据集上测试了模型:发布、电子邮件和移动。实验结果表明,所提出的PLP-FGM模型能够准确地推断出92.7%的顾问-咨询关系来自合著者网络(出版物),88.0%的经理-下属关系来自电子邮件网络(电子邮件),83.1%的朋友来自移动网络(移动)。最后,我们开发了一个分布式学习算法,将模型扩展到真正的大型网络中。
课程简介: In online social networks, most relationships are lack of meaning labels (e.g., "colleague" and "intimate friends"), simply because users do not take the time to label them. An interesting question is: can we automatically infer the type of social relationships in a large network? what are the fundamental factors that imply the type of social relationships? In this work, we formalize the problem of social relationship learning into a semi-supervised framework, and propose a Partially-labeled Pairwise Factor Graph Model (PLP-FGM) for learning to infer the type of social ties. We tested the model on three different genres of data sets: Publication, Email and Mobile. Experimental results demonstrate that the proposed PLP-FGM model can accurately infer 92.7% of advisor-advisee relationships from the coauthor network (Publication), 88.0% of manager-subordinate relationships from the email network (Email), and 83.1% of the friendships from the mobile network (Mobile). Finally, we develop a distributed learning algorithm to scale up the model to real large networks.
关 键 词: 计算机科学; 网络分析; 社交网络
课程来源: 视频讲座网
最后编审: 2021-01-29:nkq
阅读次数: 83