A Note on the K-Member Clustering Problem

Abstract

Recently, K-member clustering method attracts many researcher’s interest in the field of the privacy protection. The method automatically classifys many objects into some clusters of which the size is more than K, however, this problem is known as NP-complete. This paper proposes Extended Two-Division Clustering for K-Anonymity of Cluster Maximization and verifies the clustering methods through nermerical samples.