期刊文献+

基于概率矩阵分解的个性化链接预测算法 被引量:2

PERSONALISED LINK PREDICTION ALGORITHM BASED ON PROBABILISTIC MATRIX FACTORISATION
下载PDF
导出
摘要 链接预测是社会网络分析中一个具有挑战性的问题。社会网络中的链接预测问题就是预测社会实体间未被发现的链接和即将演化产生的链接。已有的链接预测算法大多基于社会网络本身的拓扑结构,而忽视社会实体自身的个性化特征。针对以上问题,结合社会实体的个性化特征和社会网络的拓扑特征,提出一种基于概率矩阵分解模型的个性化链接预测算法。该算法整合了社会网络的拓扑特征和实体的个性化信息,建立概率矩阵分解模型,并通过基于梯度的优化算法对模型进行求解。在两个数据集上进行多组实验,一个是数据挖掘领域的合作者网络,另一个是电子商务消费者的信任网络。实验结果证明该算法较现有方法预测准确率有了较大提高。 Link prediction is a challenging task in social network analysis. The problem of link prediction in social network is tantamount to finding out the missing links and inferring the future links on evolution among social entities. Previous studies on link prediction algorithm focus more on the topological structure of social network itself but ignore the personalised features of social entity its own. In light of the problems above,this paper presents a personalised prediction algorithm,which is based on probabilistic matrix factorisation model,in combination with the personalised features of social entities and the topological features of social network. The algorithm integrates the topological features of social network and the personalised information of entities,builds probabilistic matrix factorisation model,and seeks the solution through gradient-based optimisation algorithm. We conduct groups of experiment on 2 real datasets,a co-authorship network in data mining field and a trust network of e-commerce consumers. Experimental results prove that our algorithm has big improvement than current approaches in prediction accuracy.
作者 吴世伟 熊赟
出处 《计算机应用与软件》 CSCD 2015年第8期243-247,314,共6页 Computer Applications and Software
基金 国家科技支撑计划项目(2012BAH13F02) 上海市科委基金项目(12511502403)
关键词 链接预测 概率模型 矩阵分解 Link prediction Probabilistic model Matrix factorisation
  • 相关文献

参考文献10

  • 1吕琳媛.复杂网络链路预测[J].电子科技大学学报,2010,39(5):651-661. 被引量:238
  • 2Lu Linyuan, Zhou Tao. Link Prediction in Complex Networks : A Sur-vey[ OL]. (2010) http://arxiv.org/abs/1010.0725.
  • 3Hasan M A, Chaoji V, Salem S,et al. Link prediction using super-vised leaming[ C ] //Proceedings of SDM 06 workshop on Link Analy-sis, 2006.
  • 4Menon A K, Elkan C. Link R-ediction via Matrix Factorization [ J ].Machine Learning and Knowledge Discovery in Databases, 2011,6912(2011) : 437-452.
  • 5Yang Shuanghong, Long Bo, Smola A, et al. Like like alike - jointfriendship and interest propagation in social networks [ C ]//Proceed-ings of the 20th international conference on World wide web. NewYork: ACM, 2011.
  • 6Cui Peng, Wang Fei, Yang Shiqiang, et al. Item-Level Social Influ- ence Prediction with Probabilistic Hybrid Factor Matrix Factorization[ C ]//Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. San Francisco: AAAI, 2011.
  • 7Backstrom L, Leskovec J. Supervised random walks: predicting and recommending links in social networks[ C]//Proceedings of the 4th In- ternational Conference on Web Search and Data Mining, Hong Kong: WSDM,2011.
  • 8Jamali M , Ester M. A Transitivity Aware Matrix Factofization Model for Recommendation in Social Networks [ C ]//Proceeding of the 22nd International Joint Conference on Artificial Intelligence. Barcelona: IJ- CAI, 2011.
  • 9Dong Y, Tang J, Wu S, et al. Link Prediction and Recommendation across Heterogenous Social Networks [ C ]//Proceedings of 2012 IEEE International Conference on Data Mining. ICDM 2012.
  • 10David Liben-Nowell, Kleinberg J. The Link Prediction Problem for So- cial Networks [ J ]. Journal of the American Society for Information Sci- ence and Technology, 2007,58 (7) :1019 -1031.

二级参考文献66

  • 1GETOOR L,DIEHL C P.Link mining:a survey[J].ACM SIGKDD Explorations Newsletter,2005,7(2):3-12.
  • 2SARUKKAI R R.Link prediction and path analysis using markov chains[J].Computer Networks,2000,33(1-6):377-386.
  • 3ZHU J,HONG J,HUGHES J G Using markov chains for link prediction in adaptive web sites[J].Lect Notes Comput Sci,2002,2311:60-73.
  • 4POPESCUL A,UNGAR L.Statistical relational learning for link prediction[C] //Proceedings of the Workshop on Learning Statistical Models from Relational Data.New York:ACM Press,2003:81-87.
  • 5O'MADADHAIN J,HUTCHINS J,SMYTH P.Prediction and ranking algorithms for event-based network data[C] //Proceedings of the ACM SIGKDD 2005.New York:ACM Press,2005:23-30.
  • 6LIN D.An information-theoretic definition of similarity[C] //Proceedings of the 15th Intl Conf Mach.Learn..San Francisco,Morgan Kaufman Publishers,1998:296-304.
  • 7LIBEN-NOWELL D,KLEINBERG J.The link-prediction problem for social networks[J].J Am Soc Inform Sci Technol,2007,58(7):1019-1031.
  • 8CLAUSET A,MOORE C,NEWMAN M E J.Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453:98-101.
  • 9HOLLAND P W,LASKEY K B,LEINHARD S.Stochastic blockmodels:First steps[J].Social Networks,1983,5:109-137.
  • 10GUIMERA R,SALES-PARDO M.Missing and spurious interactions and the reconstruction of complex networks[J].Proc Natl Sci Acad USA,2009,106(52):22073-22078.

共引文献237

同被引文献10

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部