期刊文献+

基于元路径与节点属性的合著关系预测 被引量:1

Prediction of Co-authorship Based on Meta-Path and Node Attributes
下载PDF
导出
摘要 在异构社会网络中,合著关系的预测是具有代表性的一类关系预测,与同构网络的链接预测方法在节点表示、网络构造等方面存在较大差异。综合考虑异构社会网络特有的元路径信息和节点属性特征,提出了节点的复合向量化表示:将节点的TF-IDF特征与基于Metapath2vec算法的向量化表示相结合;在元路径的表示上采取元路径中同类型节点归并重构的方法,以提取元路径中同类型节点间的隐含信息;并通过卷积神经网络(CNN)实现学术网络的合著关系预测。实验结果表明,节点的复合向量化表示及重构元路径方法可以更好地表征异构社会网络,与其他方法对比中均获得更好的预测评价指标。 In heterogeneous social networks,the prediction of co-authorship is a representative prediction of relationship,which is quite different from the link prediction method of homogeneous networks in node representation,network construction and so on.Fully considering the unique information of meta-path and node attribute characteristics of heterogeneous networks,a composite vectorization representation of nodes is proposed,which combines the TF-IDF features of nodes with network embedding based on Metapath2vec.In the representation of meta-path,the same type of nodes in metapath are merged and reconstructed to further extract the implicit information between the same type of nodes in meta-path.Also,the prediction of co-authorship in bibliographic network is realized by Convolutional Neural Network(CNN).Experimental results show that the method of complex vectorization of nodes and reconstruction of meta-path can better characterize heterogeneous social networks,as well as,better evaluation indexes of prediction are given compared with other methods.
作者 张雪婷 程华 房一泉 ZHANG Xueting;CHENG Hua;FANG Yiquan(Institute of Information Science and Engineering,East China University of Science and Technology,Shanghai 200237,China)
出处 《计算机工程与应用》 CSCD 北大核心 2021年第2期164-169,共6页 Computer Engineering and Applications
基金 赛尔网络下一代互联网技术创新项目(NGII20170520)。
关键词 链接预测 合著关系 异构社会网络 语义属性 元路径 link prediction co-authorship heterogeneous social network semantic attributes meta-path
  • 相关文献

参考文献2

二级参考文献69

  • 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.

共引文献244

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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