arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.07784cs.SIphysics.soc-ph
收藏

演化社交网络中不同社区追踪方法的比较研究

A Comparative Study of Different Approaches for Tracking Communities in Evolving Social Networks

Ziwei He, Etienne Gael Tajeuna, Shengrui Wang, Mohamed Bouguessa

摘要:

在现实世界的社交网络中,人们越来越关注跟踪用户组的演变并检测他们可能经历的各种变化。为此,已经提出了几种方法。在研究这些方法时,我们观察到其中大多数使用两个阶段的过程。在第一阶段,他们运行一种算法来识别每个时间戳的用户组。在第二阶段,采用基于相似性度量的成对比较来跟踪用户组并检测他们可能经历的变化。虽然大多数现有方法使用两阶段过程,但它们都运行不同的算法来识别社区,并依赖不同的相似性度量来跟踪用户组。注意到不同的方法可能会根据所调查的动态社交网络而有所不同,我们决定对一些现有的跟踪方法进行高级别调查,然后对其中一些进行比较分析。在我们的分析中,我们比较了两种主要情况下的算法:$(1)$当用户组不重叠和$(2)$当组重叠。这项研究是在从DBLP、自治系统(AS)和Yelp数据集中提取的三个不同的测试平台上进行的。

英文摘要:

In real-world social networks, there is an increasing interest in tracking the evolution of groups of users and detecting the various changes they are liable to undergo. Several approaches have been proposed for this. In studying these approaches, we observed that most of them use a two-stage process. In the first stage, they run an algorithm to identify groups of users at each timestamp. In the second stage, a pair-wise comparison based on a similarity measure is employed to track groups of users and detect changes they may undergo. While the majority of existing approaches use a two-stage process, they all run different algorithms to identify communities and rely on different similarity measures to track groups of users over time. Noting that the different approaches may perform differently depending on the dynamic social network under investigation, we decided to make a high level survey of some existing tracking approaches and then do a comparative analysis of some of them. In our analysis, we compared the algorithms in two main situations: $(1)$ when groups of users do not overlap and $(2)$ when the groups are overlapping. The study was done on three different testbeds extracted from the DBLP, Autonomous System (AS) and Yelp datasets.

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

↑