|
计算机应用研究 2011
k-medoids clustering algorithm based on CF tree
|
Abstract:
k-medoids algorithm has better robustness when the dataset exist noise and outlier points.However,computational cost of k-medoids algorithm is higher on big datasets.CF tree is a common structure in Birch algorithm,and it has better sca-lability on the clustering of big datasets.But CF tree has poor clustering results on the non-spherical data.Therefore,this paper presented a k-medoids algorithm based on CF tree on the basis of the two algorithms.First,the improved algorithm constructed CF tree by the data ...