Fast graph-based relaxed clustering for large data sets using minimal enclosing ball.
Although graph-based relaxed clustering (GRC) is one of the spectral clustering algorithms with straightforwardness and self-adaptability, it is sensitive to the parameters of the adopted similarity measure and also has high time complexity  O(N(3)) which severely weakens its usefulness for large data sets. In order to overcome these shortcomings, after introducing certain constraints for GRC, an enhanced version of GRC [constrained GRC (CGRC)] is proposed to increase the robustness of GRC to the parameters of the adopted similarity measure, and accordingly, a novel algorithm called fast GRC (FGRC) based on CGRC is developed in this paper by using the core-set-based minimal enclosing ball approximation. A distinctive advantage of FGRC is that its asymptotic time complexity is linear with the data set size  N. At the same time, FGRC also inherits the straightforwardness and self-adaptability from GRC, making the proposed FGRC a fast and effective clustering algorithm for large data sets. The advantages of FGRC are validated by various benchmarking and real data sets.
School of Digital Media, Jiangnan Univeristy, Wuxi, China. qianpjiang@hotmail.com
Pengjiang
P
Qian
Fu-Lai
FL
Chung
Shitong
S
Wang
Zhaohong
Z
Deng
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003198:Computer Simulation; D016208:Databases, Factual; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*