Name
Abstract | ||
|---|---|---|
Based on the extensive Kuramoto model, synchronization-inspired partitioning clustering algorithm was recently proposed and is attracting more and more attentions, due to the fact that it simulates the synchronization phenomena in clustering where each data object is regarded as a phase oscillator and the dynamic behavior of the objects is simulated over time. In order to circumvent the serious difficulty that its existing version can only be effectively carried out on considerably small/medium datasets, a novel scalable synchronization-inspired partitioning clustering algorithm termed LSSPC, based on the center-constrained minimal enclosing ball and the reduced set density estimator, is proposed for large dataset applications. LSSPC first condenses a large scale dataset into its reduced dataset by using a fast minimal-enclosing-ball based approximation for the reduced set density estimator, thus achieving an asymptotic time complexity that is linear in the size of dataset and a space complexity that is independent of this size. Then it carries out clustering adaptively on the obtained reduced dataset by using Sync with the Davies-Bouldin clustering criterion and a new order parameter which can help us observe the degree of local synchronization. Finally, it finishes clustering by using the proposed algorithm CRD on the remaining objects in the large dataset, which can capture the outliers and isolated clusters effectively. The effectiveness of the proposed clustering algorithm LSSPC for large datasets is theoretically analyzed and experimentally verified by running on artificial and real datasets. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TKDE.2013.178 | IEEE Trans. Knowl. Data Eng. |
Keywords | Field | DocType |
large datasets,pattern clustering,kde based density estimation,kuramoto model,isolated cluster capturing,reduced set,dynamic object behavior simulation,large-scale dataset applications,space complexity,minimal enclosing ball,computational complexity,phase oscillator,scalable synchronization-inspired partitioning clustering algorithm,crd algorithm,synchronization-inspired partitioning clustering,local synchronization degree,asymptotic time complexity,reduced set density estimator,lsspc algorithm,davies-bouldin clustering criterion,real datasets,center-constrained minimal-enclosing-ball based approximation,sync,order parameter,dataset size,artificial datasets,synchronisation,outlier capturing | Fuzzy clustering,Canopy clustering algorithm,Data mining,CURE data clustering algorithm,Data stream clustering,Correlation clustering,Computer science,Constrained clustering,FLAME clustering,Artificial intelligence,Cluster analysis,Machine learning | Journal |
Volume | Issue | ISSN |
26 | 8 | 1041-4347 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhao Ying | 1 | 22 | 3.78 |
| Fu Lai Chung | 2 | 1534 | 86.72 |
| Shitong Wang | 3 | 1485 | 109.13 |