基于特征子图的异构信息网络节点相似性度量 *

doi:10.3969/j.issn.1000-0801.2014.11.012

电信科学 ›› 2014, Vol. 30 ›› Issue (11): 66-72.doi: 10.3969/j.issn.1000-0801.2014.11.012

基于特征子图的异构信息网络节点相似性度量 ^*

张彪^1,^2,³,李川^1,^2,³,徐洪宇¹,李艳梅¹,杨宁¹,罗谦⁴

¹ 四川大学计算机学院成都 610065
² 国家空管自动化系统技术重点实验室成都 610065
³ 武汉大学软件工程国家重点实验室武汉 430072
⁴ 中国民用航空总局第二研究所成都 610065

出版日期:2014-11-20 发布日期:2017-07-15
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家“十二五”科技支撑计划基金资助项目;武汉大学软件工程国家重点实验室开放基金资助项目

Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph

Biao Zhang^1,^2,³,Chuan Li^1,^2,³,Hongyu Xu¹,Yanmei Li¹,Ning Yang¹,Qian Luo⁴

¹ College of Computer Science， Sichuan University， Chengdu 610065， China
² National Key Laboratory of Air Control Automation System Technology， Chengdu 610065， China
³ State Key Laboratory of Software Engineering of Wuhan University， Wuhan 430072， China
⁴ The Second Research Institute of CACC， Chengdu 610065， China

Online:2014-11-20 Published:2017-07-15

摘要/Abstract

摘要：

摘要：为解决异构信息网络相似性度量的问题，提出了基于节点特征子图的节点相似性度量算法，通过节点特征子图的最大公共子图与最小公共超图之间的差异性，进行节点间的相似性度量。该算法以图理论为基础，根据连边的不同类型设定不同权值，在考虑节点信息相似的同时，加入节点在网络中的结构信息，最大程度地利用了异构信息网络所富含的信息。实验结果表明，提出的算法具有较好的性能和有效性。

关键词: 异构信息网络, 图相似, 相似性度量, 特征子图

Abstract:

To solve the problem in measuring the similarity of heterogeneous information networks, a similarity measuring algorithm was proposed. It calculates the difference between the maximum common sub-graph and minimum common hyper-graph, based on feature sub-graph of the current node. The algorithm takes graph theory as its foundation, set different weight to different kinds of edges, considers nodes information as well as graph to topological information, and makes full use of the information in heterogeneous network. The result shows that the proposed algorithm has wonderful effectiveness and efficiency.

Key words: heterogeneous information network, graph similarity, similarity measurement, feature sub-graph

张彪,李川,徐洪宇,李艳梅,杨宁,罗谦. 基于特征子图的异构信息网络节点相似性度量 ^*[J]. 电信科学, 2014, 30(11): 66-72.

Biao Zhang,Chuan Li,Hongyu Xu,Yanmei Li,Ning Yang,Qian Luo. Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph[J]. Telecommunications Science, 2014, 30(11): 66-72.

图/表 9

表1

表2

图1

表3

图2

图3

图4

图5

图6

参考文献 14

1	Han J W , Yan X F , Yu P S . Scalable OLAP and mining of information networks. Proceedings of the 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, 2009
2	Chen M S , Han J W , Yu P S . Data mining: an overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering 1996,8(6): 866～883
3	Chen C , Yan X F , Zhu F D , et al. Graph OLAP: towards online analytical processing on graphs. Proceedings of the 8th IEEE International Conference on Data Mining, Pisa,Italy, 2008: 103～112
4	李川, 赵磊, 唐常杰等. Graph OLAPing的建模、设计与实现. 软件学报 2011,22(2): 258～268
5	Sun Y Z , Han J W , Yan X F , et al. Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proceedings of the VLDB Conference, Seattle, Washington, USA, 2011
6	Glen J , Widom J . Scaling personalized web search. Proceedings of the 12th International Conference on World Wide Web, Budapest, Hungary, 2003: 1～35
7	Jeh G , Widom J . SimRank: a measure of structural-context similarity. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002: 1～11
8	Balmin A , Hristidis V , Papakonstantinou Y . Objectrank:authority-based keyword search in databases. Proceedings of the 30th VLDB Conference, Toronto, Canada, 2004: 564～575
9	Fortunato S . Community detection in graphs. Physics Reports, 2010,486(3～5): 75～174
10	Biggs N , Lloyd E K , Wilson R J . Graph Theory 1736-1936． New York： Oxford University Press 1976
11	Hamilton W R . Memorandum respecting a new system of roots of unity. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 1856,12(81): 446
12	Han J , Sun Y , Yan X , et al. Mining knowledge from databases:an information network analysis approach. Proceedings of the ACM SIGMOD International Conference on Management of Data, Indianapolis, Indiana, USA, 2010: 1251～1252
13	Ji M , Han J , Danilevsky M . Ranking-based classification of heterogeneous information networks. Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 2011: 1298～1306
14	Mashaghi A Ramezanpour A Karimipour V . Investigation of aprotein complex network. The European Physical Journal B-Condensed Matter and Complex Systems, 2004,41(1): 113～121

	作者	论文	会议	关键词
fullDBLP	913 312	1 348 545	6 485	129 226
CCF DBLP	304 742	358 118	280	45 551

	作者—论文	论文—会议	论文—关键字
fullDBLP	4 246 559	1 348 545	9 518 924
CCF DBLP	1 113 476	358 118	2 501 663

排名	Tang Changjie	Han Jiawei	SubFG-Sim	PathSim-AP	PathSim-PAP
1	Qiao Shaojie	Philip S Yu	Christos Faloutsos	Christos Faloutsos	Christos Faloutsos
2	Li Chuan	Pei Jian	Sun Jimeng	Spiros Papadimitriou	Han Jiawei
3	Duan Lei	Yan Xifeng	Spiros Papadimitriou	Sun Jimeng	Rakesh Agrawal
4	Zuo Jie	Sun Yizhou	Agma J M Traina	Pan Jiayu	Pei Jian
5	Zhang Tianqing	Aggarwal Charu C	Caetano Traina Jr	Agma J M Traina	Charu C Aggarwal
6	Qiu Jiangtao	Gao Jing	Pan Jiayu	Jure Leskovec	H V Jagadish
7	Peng Jing	Fan Wei	Jure Leskovec	Caetano Traina Jr	Raghu Ramakrishnan
8	Dai Shucheng	Wang Ke	Philip S Yu	Tong Hanghang	Nick Koudas
9	Liu Yintian	Jin Xin	Tong Hanghang	Deepayan Chakrabarti	Surajit Chaudhuri
10	Yang Ning	Wang Haixun	Dimitrios Gunopulos	Flip Korn	Divesh Srivastava

基于特征子图的异构信息网络节点相似性度量 ^*

Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献 14

相关文章 0

Metrics

推荐阅读 0