期刊文献+

异质网络中基于节点影响力的相似度度量方法 被引量:5

Node Influence Based Similarity Measure Method in Heterogeneous Network
下载PDF
导出
摘要 异质网络相似度学习,即分析两个不同类型对象间的相关程度.不同类型对象在异质网络中的重要程度不同,它们在相似度学习过程中的发挥的作用也不同.针对异质网络,提出了一种基于节点影响力的相似度度量方法NISim,该模型既考虑了网络中的链接结构,也保留了网络中的语义信息,同时区分不同类型节点对异质网络的作用.在异质信息网络环境下,通过启发式规则区分并量化不同类型节点的影响力权值,并结合网络链接结构和节点间语义关系,解决了提高相似度学习准确性的问题.实验结果表明,该方法能够有效地对异质信息网络不同类型节点进行相似度度量,可以应用在网络搜索、推荐系统以及知识图谱构建等不同领域. Heterogeneous network similarity learning is to analyze the degree of correlation between two different types of objects.Different types of objects have different degrees of importance in heterogeneous networks,and play different roles in the similarity learning process.This paper proposes a node influence based similarity measure method(NISim) heterogeneous information network.This method not only considers the link structure in network but also keeps the semantic information in heterogeneous networks.Also,this method distinguishes the effect to heterogeneous network brought by different types of nodes.In heterogeneous network,the heuristic rules are used to distinguish and quantify the influence weight of different types of nodes.In addition,the link structure in network and the semantic relationship are combined to solve the problem of improving similarity learning accuracy.Experimental results show that this method can measure the similarity between different types of nodes effectively.It can be applied in different fields such as network search,recommendation system and knowledge graph construction and so on.
作者 刘露 胡封晔 牛亮 彭涛 LIU Lu;HU Feng-ye;NIU Liang;PENG Tao(College of Software,Jilin University,Changchun,Jilin 130012,China;Key Laboratory of Symbolic Computation and Knowledge Engineering(Jilin University),Ministry of Education,Changchun,Jilin 130012,China;College of Computer Science and Technology,Jilin University,Changchun,Jilin 130012,China;College of Communication Engineering,Jilin University,Changchun,Jilin 130012,China;The First Hospital of Jilin University,Changchun,Jilin 130012,China)
出处 《电子学报》 EI CAS CSCD 北大核心 2019年第9期1929-1936,共8页 Acta Electronica Sinica
基金 国家自然科学基金(No.61872163,No.61806084) 中国博士后科研基金项目(No.2018M631872) 吉林省教育厅项目(No.JJKH20190160KJ) 吉林省科技厅重点科技研发项目(No.20180201044GX)
关键词 数据挖掘 异质网络 推荐系统 知识图谱 网络搜索 节点影响力 链接结构 语义关系 data mining heterogeneous network recommended system knowledge graph network search node influence link structure semantic relationship
  • 相关文献

参考文献2

二级参考文献25

  • 1Gupta P, Gael A, Lin J, Sharma A, Wang D, Zadeh R. WTF: the who to follow service at Twitter. In: Proceedings of International World Wide Web Conference. 2013,505-514.
  • 2Liben-Nowell D, Kleinberg J. The link-prediction problem for social networks. Journal of the Association for Information Science and Tech?nology, 2007, 58(7); 1019-1031.
  • 3Joshi A, Kumar R, Reed B, Tomkins A. Anchor-based proximity mea?sures. In: Proceedings of International World Wide Web Conference. 2007, 1131-1132.
  • 4Antonellis I, Molina H G, Chang C C. SimRank++: query rewriting through link analysis of the click graph. Proceedings of the VLDB En?dowment, 2008, 1(1): 408--421.
  • 5Jeh G, Widorn J. Scaling personalized web search. In: Proceedings of International World Wide Web Conference. 2003,271-279.
  • 6Jeh 0, Widom J. SimRank: a measure of structural-context similarity. In: Proceedings of ACM SIGKDD Conference on Knowledge Discov?ery and Data Mining. 2002,538-543.
  • 7Sarkar P, Moore A W, Prakash A. Fast iucrernental proximity search in large graphs. In: Proceedings of International Conference on Machine Learning. 2008, 896-903.
  • 8Sarkar P, Moore A W. A tractable approach to finding closest truncated?commute-time neighbors in large graphs. In: Proceedings of Uncer?tainty in Artificial Intelligence. 2007,335-343.
  • 9Zhao P, Han J, Sun Y P-Rank: a comprehensive structural similarity measure over information networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management. 2009, 553- 562.
  • 10Lizorkin D, Velikhov P, Grinev M N, Turdakov D. Accuracy estimate and optimization techniques for SimRank computation. Proceedings of the VLDB Endowment, 2008, 1(1): 422-433.

共引文献12

同被引文献42

引证文献5

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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