Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.patrec.2010.04.001
Title: A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
Authors: Feng, L.
Qiu, M.-H.
Wang, Y.-X.
Xiang, Q.-L. 
Yang, Y.-F.
Liu, K.
Keywords: Divisive clustering
Hierarchical clustering
Particle swarm optimizer
Issue Date: 2010
Source: Feng, L., Qiu, M.-H., Wang, Y.-X., Xiang, Q.-L., Yang, Y.-F., Liu, K. (2010). A fast divisive clustering algorithm using an improved discrete particle swarm optimizer. Pattern Recognition Letters 31 (11) : 1216-1225. ScholarBank@NUS Repository. https://doi.org/10.1016/j.patrec.2010.04.001
Abstract: As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive clustering, which is a branch of hierarchical clustering, has been studied and widely used due to its computational efficiency. Generally, which cluster should be split and how to split the selected cluster are two major principles that should be taken into account when a divisive clustering algorithm is used. However, one disadvantage of the divisive clustering is its degraded performance compared to the partitional clustering, thus making it hard to achieve a good trade-off between computational time and clustering performance. To tackle this problem, we propose a novel divisive clustering algorithm by integrating an improved discrete particle swarm optimizer into a divisive clustering framework. Experiments on several synthetic data sets, real-world data sets and two real-world applications (document clustering and vector quantization) show some promising results. Firstly, the proposed algorithm performs better or at least comparable to the other representative clustering algorithms in terms of clustering quality and robustness. Secondly, the proposed algorithm runs much faster than the other competing algorithms on all the benchmark sets. At last, the good time-quality trade-off is still achievable when the size of the problem instance is increased. © 2010 Elsevier B.V. All rights reserved.
Source Title: Pattern Recognition Letters
URI: http://scholarbank.nus.edu.sg/handle/10635/39541
ISSN: 01678655
DOI: 10.1016/j.patrec.2010.04.001
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

14
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

10
checked on Dec 5, 2017

Page view(s)

73
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


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