arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.00525cs.SIcs.AIcs.DS
收藏

打包与度量:社交网络中影响力传播的一种有效方法

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks

Lebanese American University(黎巴嫩美国大学)

Faisal N. Abu-Khzam, Ghinwa Bou Matar, Sergio Thoumi

AI总结:

本文研究了独立级联模型下的影响力最大化问题,提出基于 $d$-packing 和顶点中心性的“打包与度量”种子集选择方法,通过选取距离远且局部影响力高的顶点,实现了高效的种子选择。

摘要:

本文考虑了独立级联模型(IC)下的影响力最大化问题。该问题要求寻找一个最小的顶点集作为“种子集”,期望从中实现最大规模的影响力传播。基于 $d$-packing 和顶点中心性的概念,本文引入了新的种子集选择方法。具体而言,我们侧重于选择彼此距离较远且在其局部社区中影响力值最高的种子顶点。我们的最佳结果是通过初始计算 $d$-Packing,随后在其各自的闭邻域中选择高度数或高中心性的顶点来实现的。这种整体的“打包与度量”方法作为一种种子选择方法证明是非常有效的。

英文摘要:

The Influence Maximization problem under the Independent Cascade model (IC) is considered. The problem asks for a minimal set of vertices to serve as "seed set" from which a maximum influence propagation is expected. New seed-set selection methods are introduced based on the notions of a $d$-packing and vertex centrality. In particular, we focus on selecting seed-vertices that are far apart and whose influence-values are the highest in their local communities. Our best results are achieved via an initial computation of a $d$-Packing followed by selecting either vertices of high degree or high centrality in their respective closed neighborhoods. This overall "Pack and Measure" approach proves highly effective as a seed selection method.

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

↑