期刊文献+

基于元图归一化相似性度量的实体推荐 被引量:2

Entity recommendation based on normalized similarity measure of meta graph in heterogeneous information network
原文传递
导出
摘要 基于异构信息网络(heterogeneous information networks, HIN)中元图的良好表征特性,提出一种结合隐式反馈和PathSim(meta path-based similarity)的归一化相似性度量(normalized similarity measure of meta graph, NSMG),以解决对异构信息网络中高度可见实体的偏好问题。针对Yelp和Amazon数据集构建Yelp-HIN(heterogeneousinformation networks in Yelp)和Amazon-HIN(heterogeneous information networks in Amazon),定义不同类型的元图及归一化相似度量,使用矩阵分解和因子分解机来组合计算不同元图上的相似性。试验结果表明,基于NSMG的方法在非常稀疏的数据集上性能表现优于常用的HIN实体推荐方法。 Based on the promising result of meta graph in heterogeneous information networks(HIN), normalized similarity measure of meta graph(NSMG) was proposed which combined implicit feedback matrix and PathSim(meta path-based similarity) to solve the problem of preference for large degree entities. Yelp-HIN(heterogeneous information networks in Yelp) and Amazon-HIN(heterogeneous information networks in Amazon) were constructed based on Yelp and Amazon datasets. Different types of meta graphs and normalized similarity measures were defined. Matrix decomposition and factorization machine were used to combine the similarities on different meta graphs. The experimental results showed that the proposed method based on normalization similarity measure of meta graphs performed better than the commonly used entity recommendation method in HIN on very sparse data sets.
作者 张文凯 禹可 吴晓非 ZHANG Wenkai;YU Ke;WU Xiaofei(School of Information and Communication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China)
出处 《山东大学学报(工学版)》 CAS CSCD 北大核心 2020年第2期66-75,共10页 Journal of Shandong University(Engineering Science)
基金 国家自然科学基金资助项目(61601046,61171098) 中国111基地资助项目(B08004) 欧盟FP7 IRSES资助项目(612212)。
关键词 异构信息网络 元图 归一化相似性度量 实体推荐 矩阵分解 因子分解机 heterogeneous information networks meta graph normalized similarity measure entity recommendation matrix decomposition factorization machine
  • 相关文献

参考文献6

二级参考文献38

  • 1O' Madadhain J, Hutchins J, Smyth P. Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explorations Newsletter, 2005, 7(2): 23-30.
  • 2Taskar B, Wong M F, Abbeel P, Koller D. Link prediction in relational data//Proceedings of the Neural Information Processing Systems. Vancouver, British Columbia, Canada, 2003.
  • 3Li L, Zhou T. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, 2011, 390(6).. 1150-1170.
  • 4Liben Nowell D, Kleinberg J. The link prediction problem for social networks/Proceedings of the lgth International Conference on Information and Knowledge Management. New Orleans, Louisiana, USA, 2003= 556-559.
  • 5A1 Hasan M, Chaoji V, Salem S, et al. IAnk prediction using supervised learning//Proeeedings of the SDM'06 Workshop on Link Analysis, Counterterrorism and Security. Seoul, Korea, 2006.
  • 6Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks. Nature, 2008, 453(7191).. 98 101.
  • 7Leroy V, Cambazoglu B B, Bonchi F. Cold start link prediction //Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, USA, 2010:393-402.
  • 8Lichtenwalter R N, Lussier J T, Chawla N V. New perspec- tives and methods in link prediction//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, USA, 2010: 243-252.
  • 9Yang Y, Chawla N, Sun Y, Hart J. Predicting iinks in multi- relational and heterogeneous networks//Proceedings of the 2012 IEEE 12th International Conference on Data Mining. Brussels, Belgium, 2012:755 764.
  • 10Liehtenwalter R N, Chawla N V. Vertex collocation profiles Subgraph counting for link analysis and prediction// Proceedings of the 21st International Conference on World Wide Web. Lyon, France, 2012 1019-1028.

共引文献59

同被引文献29

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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