MRAttractor:从大规模图中检测社区
MRAttractor: Detecting Communities from Large-Scale Graphs
摘要:
检测具有相似观点、兴趣或社交行为的用户组已成为许多应用程序的重要任务。最近的一项研究表明,基于动态距离的吸引子,一个社区发现算法,优于其他社区发现算法,如光谱聚类,卢万和Infomap,实现更高的归一化互信息(NMI)和调整兰德指数(ARI)。然而,Attractor通常需要很长时间来检测社区,需要多次迭代。为了克服这个缺点并处理大规模的图形,在本文中,我们提出了MRAttractor,这是一个高级版本的Attractor,可以在MapReduce框架上运行。特别是,我们(i)应用滑动窗口技术,以减少运行时间,保持相同的社区发现质量;(ii)设计和实现的MapReduce框架的吸引子算法;和(iii)评估MRAttractor的合成和真实世界的数据集上的性能。实验结果表明,我们的算法显着减少了运行时间,并能够处理大规模的图形。
英文摘要:
Detecting groups of users, who have similar opinions, interests, or social behavior, has become an important task for many applications. A recent study showed that dynamic distance based Attractor, a community detection algorithm, outperformed other community detection algorithms such as Spectral clustering, Louvain and Infomap, achieving higher Normalized Mutual Information (NMI) and Adjusted Rand Index (ARI). However, Attractor often takes long time to detect communities, requiring many iterations. To overcome the drawback and handle large-scale graphs, in this paper we propose MRAttractor, an advanced version of Attractor to be runnable on a MapReduce framework. In particular, we (i) apply a sliding window technique to reduce the running time, keeping the same community detection quality; (ii) design and implement the Attractor algorithm for a MapReduce framework; and (iii) evaluate MRAttractor's performance on synthetic and real-world datasets. Experimental results show that our algorithm significantly reduced running time and was able to handle large-scale graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。