增量图计算:动态社交网络中的锚点跟踪
Incremental Graph Computation: Anchored Vertex Tracking in Dynamic Social Networks
摘要:
最近,用户参与在理解许多在线社交网络平台中的社区的衰退和扩张方面受到了极大的关注。当用户选择离开社交网络平台时,可能会导致她的朋友之间的级联退出。在许多情况下,说服关键用户在网络中保持活跃并防止这种级联是一个好主意,因为关键用户可以对整个网络的用户参与度产生重大影响。许多用户参与研究已经进行了静态的社会网络中找到一组关键(锚定)用户。然而,社交网络是高度动态的,其结构不断演变。为了充分利用锚定用户在网络中的作用,现有的研究需要在不同的时间挖掘多个锚定用户集,这带来了昂贵的计算成本。为了更好地了解用户在不断发展的网络中的参与,我们在本文中针对一个新的研究问题称为锚定顶点跟踪(AVT),旨在跟踪锚定用户在每个时间戳的不断发展的网络。尽管如此,这是不平凡的处理AVT问题,我们已经证明是NP-难的。为了解决这个问题,我们开发了一个贪心算法的启发,以前的锚定k-核心的研究在静态网络。此外,我们设计了一个增量算法,有效地解决AVT问题,利用网络结构的平滑演化。在真实数据集和人工数据集上进行的大量实验证明了我们提出的算法的性能和解决AVT问题的有效性。
英文摘要:
User engagement has recently received significant attention in understanding the decay and expansion of communities in many online social networking platforms. When a user chooses to leave a social networking platform, it may cause a cascading dropping out among her friends. In many scenarios, it would be a good idea to persuade critical users to stay active in the network and prevent such a cascade because critical users can have significant influence on user engagement of the whole network. Many user engagement studies have been conducted to find a set of critical (anchored) users in the static social network. However, social networks are highly dynamic and their structures are continuously evolving. In order to fully utilize the power of anchored users in evolving networks, existing studies have to mine multiple sets of anchored users at different times, which incurs an expensive computational cost. To better understand user engagement in evolving network, we target a new research problem called Anchored Vertex Tracking (AVT) in this paper, aiming to track the anchored users at each timestamp of evolving networks. Nonetheless, it is nontrivial to handle the AVT problem which we have proved to be NP-hard. To address the challenge, we develop a greedy algorithm inspired by the previous anchored k-core study in the static networks. Furthermore, we design an incremental algorithm to efficiently solve the AVT problem by utilizing the smoothness of the network structure's evolution. The extensive experiments conducted on real and synthetic datasets demonstrate the performance of our proposed algorithms and the effectiveness in solving the AVT problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。