TL;DRASC 是一种用于图分区的启发式算法,其包含两个子程序,即通过幂方法计算近似的谱嵌入,并使用近似的 k-means 聚类算法对 resulting vector set 进行分区,通过其得到的 k-means 分区自然地引发了 G 中的 k-way 节点划分。
Abstract
approximate spectral clustering (ASC) is a popular and successful heuristic
for partitioning the nodes of a graph $G$ into clusters for which the ratio of
outside connections compared to the volume (sum of degrees) is small. ASC
consists of the following two subroutines: i) compute an