
浏览全部资源
扫码关注微信
1. 四川大学计算机学院 成都 610065
2. 国家空管自动化系统技术重点实验室 成都 610065
3. 武汉大学软件工程国家重点实验室 武汉 430072
4. 中国民用航空总局第二研究所 成都 610065
Published Online:2014-11,
Published:20 November 2014
移动端阅览
Biao Zhang, Chuan Li, Hongyu Xu, et al. Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph[J]. Dianxin kexue, 2014, 30(11): 66-72.
Biao Zhang, Chuan Li, Hongyu Xu, et al. Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph[J]. Dianxin kexue, 2014, 30(11): 66-72. DOI: 10.3969/j.issn.1000-0801.2014.11.012.
摘 要:为解决异构信息网络相似性度量的问题,提出了基于节点特征子图的节点相似性度量算法,通过节点特征子图的最大公共子图与最小公共超图之间的差异性,进行节点间的相似性度量。该算法以图理论为基础,根据连边的不同类型设定不同权值,在考虑节点信息相似的同时,加入节点在网络中的结构信息,最大程度地利用了异构信息网络所富含的信息。实验结果表明,提出的算法具有较好的性能和有效性。
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.
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
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
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
李川 , 赵磊 , 唐常杰 等 . Graph OLAPing的建模、设计与实现 . 软件学报 2011 , 22 ( 2 ): 258 ~ 268
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
Glen J , Widom J . Scaling personalized web search . Proceedings of the 12th International Conference on World Wide Web , Budapest, Hungary , 2003 : 1 ~ 35
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
Balmin A , Hristidis V , Papakonstantinou Y . Objectrank:authority-based keyword search in databases . Proceedings of the 30th VLDB Conference , Toronto, Canada , 2004 : 564 ~ 575
Fortunato S . Community detection in graphs . Physics Reports , 2010 , 486 ( 3~5 ): 75 ~ 174
Biggs N , Lloyd E K , Wilson R J . Graph Theory 1736-1936 . New York : Oxford University Press 1976
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
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
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
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
0
Views
536
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621