流动社区：一种竞争性、可扩展性和多样性的社区发现算法
Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm
摘要：
我们介绍了一个社区发现算法（流体社区）的基础上的想法，流体在环境中相互作用，扩大和收缩的结果，相互作用。Fluid Communities基于传播方法，在计算成本和可扩展性方面代表了最先进的技术。在高效的同时，Fluid Communities能够在合成图中找到社区，其准确性接近当前最佳替代品。此外，Fluid Communities是第一个能够识别网络中可变数量社区的基于传播的算法。为了说明该算法的相关性，我们评估了流体社区发现的社区的多样性，并发现它们与其他方法发现的社区有显着不同。
英文摘要：
We introduce a community detection algorithm (Fluid Communities) based on the idea of fluids interacting in an environment, expanding and contracting as a result of that interaction. Fluid Communities is based on the propagation methodology, which represents the state-of-the-art in terms of computational cost and scalability. While being highly efficient, Fluid Communities is able to find communities in synthetic graphs with an accuracy close to the current best alternatives. Additionally, Fluid Communities is the first propagation-based algorithm capable of identifying a variable number of communities in network. To illustrate the relevance of the algorithm, we evaluate the diversity of the communities found by Fluid Communities, and find them to be significantly different from the ones found by alternative methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
