【24h】

Predicting Friendship Links in Social Networks Using a Topic Modeling Approach

机译:使用主题建模方法预测社交网络中的友情链接

获取原文

摘要

In the recent years, the number of social network users has increased dramatically. The resulting amount of data associated with users of social networks has created great opportunities for data mining problems. One data mining problem of interest for social networks is the friendship link prediction problem. Intuitively, a friendship link between two users can be predicted based on their common friends and interests. However, using user interests directly can be challenging, given the large number of possible interests. In the past, approaches that make use of an explicit user interest ontology have been proposed to tackle this problem, but the construction of the ontology proved to be computationally expensive and the resulting ontology was not very useful. As an alternative, we propose a topic modeling approach to the problem of predicting new friendships based on interests and existing friendships. Specifically, we use Latent Dirichlet Allocation (LDA) to model user interests and, thus, we create an implicit interest ontology. We construct features for the link prediction problem based on the resulting topic distributions. Experimental results on several LiveJournal data sets of varying sizes show the usefulness of the LDA features for predicting friendships.
机译:近年来,社交网络用户的数量急剧增加。与社交网络用户相关联的最终数据量为数据挖掘问题创造了巨大的机会。社交网络感兴趣的一个数据挖掘问题是友谊链接预测问题。直观地,可以基于两个用户的共同朋友和兴趣来预测两个用户之间的友谊链接。但是,鉴于存在大量可能的利益,直接使用用户利益可能会带来挑战。过去,已经提出了利用明确的用户兴趣本体的方法来解决该问题,但是事实证明,本体的构造在计算上是昂贵的,并且所得到的本体不是很有用。作为替代方案,我们针对基于兴趣和现有友谊来预测新友谊的问题提出了一种主题建模方法。具体来说,我们使用潜在狄利克雷分配(LDA)对用户兴趣进行建模,因此,我们创建了一个隐式兴趣本体。我们根据结果主题分布为链接预测问题构建特征。在几个不同大小的LiveJournal数据集上的实验结果表明,LDA功能可用于预测友谊。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号