Please use this identifier to cite or link to this item:
Title: Scaling up synchronization-inspired partitioning clustering
Authors: Ying, WH
Chung, FL 
Wang, ST
Keywords: KDE based density estimation
Minimal enclosing ball
Synchronization-inspired partitioning clustering
Large datasets
Reduced set
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on knowledge and data engineering, 2014, v. 26, no. 8, p. 2045-2057 How to cite?
Journal: IEEE transactions on knowledge and data engineering 
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.
ISSN: 1041-4347
EISSN: 1558-2191
DOI: 10.1109/TKDE.2013.178
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Nov 8, 2018


Last Week
Last month
Citations as of Nov 14, 2018

Page view(s)

Last Week
Last month
Citations as of Nov 12, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.