期刊文献+

采用组合方法进行链路预测的理论极限研究 被引量:5

Theoretical limit of link prediction using a combination method
下载PDF
导出
摘要 对链路预测组合方法是否存在理论极限以及如何抵近极限开展研究。从是否使用多维度信息或是否直接定义多维度信息之间关系的角度,将链路预测方法分为单机制方法和组合方法。采用简单函数列逼近可测函数的方法,得出链路预测组合方法的理论极限定理;提出使组合方法准确性达到理论上限的组合规则,并给出所提组合规则的几何解释和针对极限定理的仿真示例说明。极限定理揭示了组合方法的本质和组合方法相比单机制方法具有更高准确性及稳健性的原因。 The problem that whether there a theoretical limit exists for link prediction combination methods and how to approximate was investigated.Link prediction methods were divided into single or combination methods,based on whether multidimension information was used,or whether the relation of multidimension information was defined directly.Limit theorems for link prediction by approximating a measurable function by a simple function sequence were provided.Combination rule and corresponding geometric interpretations and simulation examples for limit theorems were also provided.Limit theorems show why combination methods have higher accuracy and robustness than single methods.
作者 吴翼腾 于洪涛 黄瑞阳 李华巍 WU Yiteng;YU Hongtao;HUANG Ruiyang;LI Huawei(Information Engineering University,Zhengzhou 450002,China;Unit 92538 of the PLA,Lyushun 116041,China)
机构地区 信息工程大学 [
出处 《通信学报》 EI CSCD 北大核心 2020年第6期34-50,共17页 Journal on Communications
基金 国家自然科学基金资助项目(No.61601513) 郑州市协同创新重大专项基金资助项目(No.162/32410218)。
关键词 复杂网络 链路预测 组合方法 理论极限 complex network link prediction combination method theoretical limit
  • 相关文献

参考文献5

二级参考文献208

  • 1方锦清,汪小帆,郑志刚,毕桥,狄增如,李翔.一门崭新的交叉科学:网络科学(上)[J].物理学进展,2007,27(3):239-343. 被引量:129
  • 2Getoor L, Diehl C P. Link mining: A survey. ACM SIGKDD Explorations Newsletter. 2005. 7( 2): 3-12.
  • 3Richard E. Savalle P. Vayatis N. Estimation of simultaneously sparse and low rank matrices[C]//Proc of the 29th Int Conf on Machine Learning (ICML 2012). Madison: Omnipress , 2012: 1351-1358.
  • 4Liben-Nowell D. Kleinberg J. The link-prediction problem for social networks[J]. Journal of the American Society for Information Science and Technology. 2007. 58 (7): 1019- 1031.
  • 5Song H H. Cho T W. Dave V. et a1. Scalable proximity estimation and link prediction in online social networks[C]// Proc of the 9th ACM SIGCOMM Conf on Internet Measurement Conference. New York: ACM. 2009: 322-335.
  • 6Lu L, Zhou T. Link prediction in complex networks: A survey[J]. Physica A: Statistical Mechanics and its Applications. 2011. 390(6): 1150-1170.
  • 7Sarkar P. Moore A W. Prakash A. Fast incremental proximity search in large graphs[C]//Proc of the 25th Int Conf on Machine Learning. New York: ACM. 2008: 896- 903.
  • 8Hasan M A. Chaoji V. Salem S. et a1. Link prediction using supervised learning[C/OL]//Proc of 2006 SDM Workshop on Link Analysis. Counterterrorism and Security.[2014 11 05]. http://www. siam. org/meetings/sdm06/workproceed/ LinkAnalysis/12. pdf.
  • 9Raymond R. Kashima H. Fast and Scalable Algorithms for Semi-Supervised Link Prediction on Static and Dynamic Graphs[M] / /Machine Learning and Knowledge Discovery in Databases. Berlin: Springer. 2010: 131-147.
  • 10Liu Y. Wang Z. Yin J. et al. A Scalable Proximity Measure for Link Prediction via Low-rank Matrix Estimation[C]// Proc of the 3rd Int Coni on Computer Science and Service System. Paris: Atlantis. 2014.

共引文献90

同被引文献62

引证文献5

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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