TL;DR该论文提出了一种利用两个相关指标来估算子空间嵌入中的聚类数,使用增长型神经气 (GNG) 逼近的算法,有效地解决了聚类问题,并在效率上与手动设置 k 的相似方法竞争。
Abstract
The recently emerged spectral clustering surpasses conventional clustering
methods by detecting clusters of any shape without the convexity assumption.
Unfortunately, with a computational complexity of $O(n^3)$,