But the PAM can work well with large data set. To solve the problem,this paper shows an Approximated Linear Clustering Method(ALCM),and proves that the complexity of the new algorithm is O(n),where n is the number of data set.

• 本文针对PAM算法不适应大数据集的缺点；给出一个近似的线性时间聚类算法(ALCM)；并且从理论上证明了该算法复杂度为关于数据集个数的线性时间复杂度.