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

大规模多目标网络降尺度影响最大化

Large-scale multi-objective influence maximisation with network downscaling

University of Trento(特伦托大学);University of Twente(特文特大学)

Elia Cunegatti, Giovanni Iacca, Doina Bucur

摘要:

寻找网络中最有影响力的节点是一个计算困难的问题,在各种基于网络的问题中有几种可能的应用。虽然已经提出了几种方法来解决影响最大化(IM)问题,但当网络规模增加时,它们的运行时间通常会很差。在这里,我们提出了一种基于网络降尺度的原创方法,该方法允许多目标进化算法(MOEA)解决缩小规模网络上的IM问题,同时保留原始网络的相关属性。然后,使用基于中心性度量(如PageRank)的机制,将缩小的解决方案升级到原始网络。我们在八个大型网络(包括两个$\sim$ 50 k节点)上的结果表明,与原始网络所需的时间相比,所提出的方法具有超过10倍的运行时间增益,并且与CELF相比,最多可减少$82\%$时间。

英文摘要:

Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several methods have been proposed for tackling the influence maximisation (IM) problem, their runtime typically scales poorly when the network size increases. Here, we propose an original method, based on network downscaling, that allows a multi-objective evolutionary algorithm (MOEA) to solve the IM problem on a reduced scale network, while preserving the relevant properties of the original network. The downscaled solution is then upscaled to the original network, using a mechanism based on centrality metrics such as PageRank. Our results on eight large networks (including two with $\sim$50k nodes) demonstrate the effectiveness of the proposed method with a more than 10-fold runtime gain compared to the time needed on the original network, and an up to $82\%$ time reduction compared to CELF.

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

↑