A new clustering algorithm for large datasets

Qing-feng Li , Wen-feng Peng

Journal of Central South University ›› 2011, Vol. 18 ›› Issue (3) : 823 -829.

PDF
Journal of Central South University ›› 2011, Vol. 18 ›› Issue (3) : 823 -829. DOI: 10.1007/s11771-011-0768-5
Article

A new clustering algorithm for large datasets

Author information +
History +
PDF

Abstract

The Circle algorithm was proposed for large datasets. The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices. This algorithm makes use of the connection between clustering aggregation and the problem of correlation clustering. The best deterministic approximation algorithm was provided for the variation of the correlation of clustering problem, and showed how sampling can be used to scale the algorithms for large datasets. An extensive empirical evaluation was given for the usefulness of the problem and the solutions. The results show that this method achieves more than 50% reduction in the running time without sacrificing the quality of the clustering.

Keywords

data mining / Circle algorithm / clustering categorical data / clustering aggregation

Cite this article

Download citation ▾
Qing-feng Li, Wen-feng Peng. A new clustering algorithm for large datasets. Journal of Central South University, 2011, 18(3): 823-829 DOI:10.1007/s11771-011-0768-5

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF

104

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/