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

整体影响力最大化:将Scalability和效率与意见感知模型相结合

Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models

Sainyam Galhotra, Akhil Arora, Shourya Roy

摘要:

来自社交网络的图形数据的稳定增长导致了在寻找影响力最大化问题的解决方案方面的广泛研究。在本文中,我们提出了一个整体解决方案的影响力最大化(IM)问题。(1)我们引入了一个意见暨互动(OI)模型,密切反映了现实世界的场景。在OI模型下,我们引入了一个新的问题,最大化的有效意见(MEO)的影响用户。我们证明了MEO问题是NP-困难的,除非P=NP,否则不能在一个常数比内近似。(2)我们提出了一个启发式算法OSIM有效地解决MEO问题。为了更好地解释OSIM启发式,我们首先介绍EaSyIM -OSIM的意见无关版本,一个可扩展的算法,能够在商品硬件上的实际计算时间内运行。除了作为OSIM的基本构建块之外,EaSyIM还能够解决IM问题的可伸缩性方面-内存消耗和运行时间。从经验上讲,我们的算法是能够保持在传播的偏差始终在5%的文献中最知名的方法。此外,我们的实验表明,OSIM和EaSyIM都是有效的,高效的,可扩展的,并显着提高了分析真实数据集的能力。

英文摘要:

The steady growth of graph data from social networks has resulted in wide-spread research in finding solutions to the influence maximization problem. In this paper, we propose a holistic solution to the influence maximization (IM) problem. (1) We introduce an opinion-cum-interaction (OI) model that closely mirrors the real-world scenarios. Under the OI model, we introduce a novel problem of Maximizing the Effective Opinion (MEO) of influenced users. We prove that the MEO problem is NP-hard and cannot be approximated within a constant ratio unless P=NP. (2) We propose a heuristic algorithm OSIM to efficiently solve the MEO problem. To better explain the OSIM heuristic, we first introduce EaSyIM - the opinion-oblivious version of OSIM, a scalable algorithm capable of running within practical compute times on commodity hardware. In addition to serving as a fundamental building block for OSIM, EaSyIM is capable of addressing the scalability aspect - memory consumption and running time, of the IM problem as well. Empirically, our algorithms are capable of maintaining the deviation in the spread always within 5% of the best known methods in the literature. In addition, our experiments show that both OSIM and EaSyIM are effective, efficient, scalable and significantly enhance the ability to analyze real datasets.

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

↑