TL;DR该研究论文探讨了用于动态演变图的聚类算法,证明了在某些簇结构的条件下,最终图的簇可以被谱聚类算法的动态变体很好地近似,并运行时间复杂度为 O (1) 和查询时间复杂度为 o (n_T),实验证明了该算法的实用性。
Abstract
This paper studies clustering algorithms for dynamically evolving graphs
$\{G_t\}$, in which new edges (and potential new vertices) are added into a
graph, and the underlying cluster structure of the graph can gr