arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.07988cs.SIcs.LG
收藏

基于图表示学习的复杂网络关键节点识别

Identifying critical nodes in complex networks by graph representation learning

University of Electronic Science and Technology of China(电子科技大学);Union Big Data Tech. Inc.(联合大数据技术有限公司)

Enyu Yu, Duanbing Chen, Yan Fu, Yuanyuan Xu

摘要:

由于其广泛的应用,关键节点识别已成为网络科学微观层面的重要研究课题。影响力最大化是关键节点挖掘中的主要问题之一,通常采用启发式算法来处理。本文提出了一种深度图学习框架IMGNN,并设计了相应的训练样本生成方案。该框架以网络中节点的中心性作为输入,以节点在最优初始传播器中的概率作为输出。通过在大量小型合成网络上进行训练,IMGNN在固定感染规模下最小化初始传播者的大小方面比基于人类的免疫学更有效。在一个合成网络和五个真实网络上的实验结果表明,与传统的非迭代节点排序算法相比,当最终感染规模固定时,IMGNN在不同感染概率下具有最小的初始传播者比例. IMGNN的重新排序版本优于所有最新的关键节点挖掘算法。

英文摘要:

Because of its wide application, critical nodes identification has become an important research topic at the micro level of network science. Influence maximization is one of the main problems in critical nodes mining and is usually handled with heuristics. In this paper, a deep graph learning framework IMGNN is proposed and the corresponding training sample generation scheme is designed. The framework takes centralities of nodes in a network as input and the probability that nodes in the optimal initial spreaders as output. By training on a large number of small synthetic networks, IMGNN is more efficient than human-based heuristics in minimizing the size of initial spreaders under the fixed infection scale. The experimental results on one synthetic and five real networks show that, compared with traditional non-iterative node ranking algorithms, IMGNN has the smallest proportion of initial spreaders under different infection probabilities when the final infection scale is fixed. And the reordered version of IMGNN outperforms all the latest critical nodes mining algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑