局部环网络自动机及双曲几何在复杂网络链路预测中的作用
Local-ring network automata and the impact of hyperbolic geometry in complex network link-prediction
摘要:
拓扑链路预测可以利用整个网络拓扑(全局方法)或仅利用链路的邻域(局部方法)进行预测。全球方法被认为是最好的。这种普遍的信念有充分的根据吗?随机区组模型(SBM)是一种全局性的方法,被认为是最好的链接预测器之一,因此它被认为是比较的参考。但是,我们的研究结果表明,SBM,其计算时间是高的,不能在一般情况下克服Cannistraci-Hebb(CH)网络自动机模型,这是一个简单的局部学习规则的拓扑自组织证明是目前最好的本地为基础的和无参数的确定性规则的链接预测。为了解释这一意外结果的原因,我们正式引入了局部环网络自动机模型的概念,以及它们与复杂网络理论中公共邻居定义的性质之间的关系。经过广泛的测试,我们推荐结构摄动方法(SPM)作为新的最佳全局方法基线。然而,即使SPM整体上也没有超过CH,在几个评估框架中,我们发现情况正好相反。特别是,CH是由流行度相似性优化(PSO)模型生成的合成网络的最佳预测器,其在具有社区结构的PSO网络中的性能甚至优于使用原始的节点间双曲距离作为链接预测器。有趣的是,当在非双曲合成网络上进行测试时,CH的性能显着下降,表明这种网络自组织规则可能与复杂网络中双曲几何的兴起密切相关。全局方法的优越性似乎是一种“误导性的信念”,这是由以前研究中用作基准的少数小网络的潜在几何偏差引起的。本文提出建立复杂网络中链接预测的隐几何理论。
英文摘要:
Topological link-prediction can exploit the entire network topology (global methods) or only the neighbourhood (local methods) of the link to predict. Global methods are believed the best. Is this common belief well-founded? Stochastic-Block-Model (SBM) is a global method believed as one of the best link-predictors, therefore it is considered a reference for comparison. But, our results suggest that SBM, whose computational time is high, cannot in general overcome the Cannistraci-Hebb (CH) network automaton model that is a simple local-learning-rule of topological self-organization proved as the current best local-based and parameter-free deterministic rule for link-prediction. To elucidate the reasons of this unexpected result, we formally introduce the notion of local-ring network automata models and their relation with the nature of common-neighbours' definition in complex network theory. After extensive tests, we recommend Structural-Perturbation-Method (SPM) as the new best global method baseline. However, even SPM overall does not outperform CH and in several evaluation frameworks we astonishingly found the opposite. In particular, CH was the best predictor for synthetic networks generated by the Popularity-Similarity-Optimization (PSO) model, and its performance in PSO networks with community structure was even better than using the original internode-hyperbolic-distance as link-predictor. Interestingly, when tested on non-hyperbolic synthetic networks the performance of CH significantly dropped down indicating that this rule of network self-organization could be strongly associated to the rise of hyperbolic geometry in complex networks. The superiority of global methods seems a "misleading belief" caused by a latent geometry bias of the few small networks used as benchmark in previous studies. We propose to found a latent geometry theory of link-prediction in complex networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。