arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.07378cs.SIcs.LG
收藏

DISCO:影响力最大化与网络嵌入和深度学习相遇

DISCO: Influence Maximization Meets Network Embedding and Deep Learning

Xidian University(西安电子科技大学);Nanyang Technological University(南洋理工大学)

Hui Li, Mengting Xu, Sourav S Bhowmick, Changsheng Sun, Zhongyuan Jiang, Jiangtao Cui

摘要:

自2003年引入以来,影响力最大化(IM)问题在文献中引起了极大的研究关注。IM的目标是选择一组k个用户,这些用户可以影响社交网络中最多的个人。该问题被证明是NP难的。已经提出了大量的近似算法来解决这个问题。最先进的算法估计基于采样的扩散路径的节点的预期影响。由于所需样本的数量最近已被证明是由一个特定的阈值,这使得精度和效率之间的折衷下界,这些传统的解决方案的结果质量是很难进一步提高,而不牺牲效率。在本文中,我们提出了一个正交的和新的范式来解决IM问题,利用深度学习模型来估计预期的影响。具体来说,我们提出了一个名为DISCO的新框架,它结合了网络嵌入和深度强化学习技术来解决这个问题。对真实网络的实验研究表明,与最先进的经典解决方案相比,DISCO实现了最佳的性能w.r.t效率和影响传播质量。此外,我们还表明,学习模型具有良好的通用性。

英文摘要:

Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM is to select a set of k users who can influence the most individuals in the social network. The problem is proven to be NP-hard. A large number of approximate algorithms have been proposed to address this problem. The state-of-the-art algorithms estimate the expected influence of nodes based on sampled diffusion paths. As the number of required samples have been recently proven to be lower bounded by a particular threshold that presets tradeoff between the accuracy and efficiency, the result quality of these traditional solutions is hard to be further improved without sacrificing efficiency. In this paper, we present an orthogonal and novel paradigm to address the IM problem by leveraging deep learning models to estimate the expected influence. Specifically, we present a novel framework called DISCO that incorporates network embedding and deep reinforcement learning techniques to address this problem. Experimental study on real-world networks demonstrates that DISCO achieves the best performance w.r.t efficiency and influence spread quality compared to state-of-the-art classical solutions. Besides, we also show that the learning model exhibits good generality.

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

↑