.png){kind=icon}
.png){kind=icon}
Return
Successive Group Selection for Microaggregation
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2011.242.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 logN) 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.
Keywords:
Clustering
partition
microaggregation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W