This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Successive Group Selection for Microaggregation
May 2013 (vol. 25 no. 5)
pp. 1191-1195
Costas Panagiotakis, University of Crete, Ierapetra
Georgios Tziritas, University of Crete, Heraklion
In this paper, we propose an efficient clustering algorithm that has been applied to the microaggregation problem. The goal is to partition $(N)$ given records into clusters, each of them grouping at least $(K)$ records, so that the sum of the within-partition squared error (SSE) is minimized. We propose a successive Group Selection algorithm that approximately solves the microaggregation problem in $(O(N^2 \log N))$ time, based on sequential Minimization of SSE. Experimental results and comparisons to existing methods with similar computation cost on real and synthetic data sets demonstrate the high performance and robustness of the proposed scheme.
Index Terms:
Clustering algorithms,GSM,Vegetation,Indexes,Partitioning algorithms,Loss measurement,Minimization,microaggregation,Clustering,partition
Citation:
Costas Panagiotakis, Georgios Tziritas, "Successive Group Selection for Microaggregation," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 5, pp. 1191-1195, May 2013, doi:10.1109/TKDE.2011.242
Usage of this product signifies your acceptance of the Terms of Use.