摘要
对链路预测组合方法是否存在理论极限以及如何抵近极限开展研究。从是否使用多维度信息或是否直接定义多维度信息之间关系的角度,将链路预测方法分为单机制方法和组合方法。采用简单函数列逼近可测函数的方法,得出链路预测组合方法的理论极限定理;提出使组合方法准确性达到理论上限的组合规则,并给出所提组合规则的几何解释和针对极限定理的仿真示例说明。极限定理揭示了组合方法的本质和组合方法相比单机制方法具有更高准确性及稳健性的原因。
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