arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07601cs.SI
收藏

社交网络中主题感知的最具影响力社区搜索

Topic-aware Most Influential Community Search in Social Networks

Long Teng, Yanhao Wang, Zhe Lin, Fei Yu

AI总结:

本文提出主题感知最具影响力社区搜索问题TAMICS,通过在线算法和基于索引的启发式算法在不确信有向图中高效发现与查询主题高度相关且影响力最大的内聚社区,实验证明其效果和效率优于现有方法。

摘要:

影响力社区搜索(ICS)旨在从社交网络中找到一组连接紧密且影响力高的顶点。尽管已有大量工作致力于ICS问题,但大多数现有方法没有考虑所找到的影响力社区与特定主题的相关性。少数针对主题感知ICS问题的尝试无法刻画社交网络中社区形成和影响力传播的随机性质。为解决这些问题,我们提出了一种新的主题感知最具影响力社区搜索(TAMICS)问题:对于给定的主题向量q,在不确信有向交互图中发现一组顶点,使其诱导出一个$(k, l, η)$-核,并在独立级联(IC)模型下具有最高的影响力得分。我们提出了一种在线算法,可为任意TAMICS查询提供具有有界误差的近似结果。此外,我们设计了两种索引结构以及一种基于索引的启发式算法,用于高效的TAMICS查询处理。最后,我们在多个真实世界数据集上通过实验评估了所提方法的有效性和效率。结果表明:(1)与几种最先进的主题感知和影响力社区搜索方法相比,TAMICS得到的社区在查询主题相关性、社会影响力以及结构内聚性方面均更高;(2)基于索引的算法相比在线算法实现了最高达三个数量级的加速,同时索引构建开销在可接受范围内。

英文摘要:

Influential community search (ICS) finds a set of densely connected and high-impact vertices from a social network. Although great effort has been devoted to ICS problems, most existing methods do not consider how relevant the influential community found is to specific topics. A few attempts at topic-aware ICS problems cannot capture the stochastic nature of community formation and influence propagation in social networks. To address these issues, we introduce a novel problem of topic-aware most influential community search (TAMICS) to discover a set of vertices such that for a given topic vector q, they induce a $(k, l, η)$-core in an uncertain directed interaction graph and have the highest influence scores under the independent cascade (IC) model. We propose an online algorithm to provide an approximate result for any TAMICS query with bounded errors. Furthermore, we design two index structures and an index-based heuristic algorithm for efficient TAMICS query processing. Finally, we experimentally evaluate the efficacy and efficiency of our proposed approaches on various real-world datasets. The results show that (1) the communities of TAMICS have higher relevance and social influence w.r.t.~the query topics as well as structural cohesiveness than those of several state-of-the-art topic-aware and influential CS methods and (2) the index-based algorithm achieves speed-ups of up to three orders of magnitude over the online algorithm with an affordable overhead for index construction.

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

↑