FastEnsemble:大规模网络上的可扩展集成聚类
FastEnsemble: scalable ensemble clustering on large networks
AI总结:
针对社区检测算法结果不稳定、不同方法/参数结果差异大的问题,提出新共识聚类方法FastEnsemble,在多种合成网络条件下准确率优于ECG和FastConsensus,且可扩展到300万节点以上网络,还能缓解分辨率限制、处理部分社区覆盖的网络。
摘要:
许多社区检测算法本质上具有随机性,其输出会因输入参数和随机种子的不同而产生差异。这种可变性使得这些算法单次运行的结果可靠性较低。此外,不同的聚类算法、优化准则(例如模块度、Constant Potts模型)以及分辨率值,会在同一网络上产生差异极大的划分结果。已有研究提出了ECG(集成共识聚类方法,如ECG和FastConsensus,这类方法通过组合聚类算法多次运行得到的一组划分结果,来降低非确定性算法的不稳定性并提升其准确性。在本研究中,我们提出了一种新的共识聚类方法FastEnsemble。我们在大量合成网络上的实验结果表明,在多种模型条件下,FastEnsemble生成的聚类结果比另外两种共识聚类方法ECG和FastConsensus更准确。此外,FastEnsemble的运行速度足够快,可应用于节点数超过300万的网络,因此在速度和可扩展性上均优于FastConsensus。最后,我们展示了共识聚类方法在缓解分辨率限制的影响、对仅部分被社区覆盖的网络进行聚类方面的实用价值。
英文摘要:
Many community detection algorithms are inherently stochastic, leading to variations in their output depending on input parameters and random seeds. This variability makes the results of a single run of these algorithms less reliable. Moreover, different clustering algorithms, optimization criteria (e.g., modularity, the Constant Potts model), and resolution values can result in substantially different partitions on the same network. Consensus clustering methods, such as ECG and FastConsensus, have been proposed to reduce the instability of non-deterministic algorithms and improve their accuracy by combining a set of partitions resulting from multiple runs of a clustering algorithm. In this work, we introduce FastEnsemble, a new consensus clustering method. Our results on a wide range of synthetic networks show that FastEnsemble produces more accurate clusterings than two other consensus clustering methods, ECG and FastConsensus, for many model conditions. Furthermore, FastEnsemble is fast enough to be used on networks with more than 3 million nodes, and so improves on the speed and scalability of FastConsensus. Finally, we showcase the utility of consensus clustering methods in mitigating the effect of resolution limit and clustering networks that are only partially covered by communities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。