Scalable clustering algorithms with balancing constraints

Arindam Banerjee, Joydeep Ghosh

Research output: Contribution to journalArticlepeer-review

70 Scopus citations

Abstract

Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., of approximately the same size or importance. In this paper, we propose a general framework for scalable, balanced clustering. The data clustering process is broken down into three steps: sampling of a small representative subset of the points, clustering of the sampled data, and populating the initial clusters with the remaining data followed by refinements. First, we show that a simple uniform sampling from the original data is sufficient to get a representative subset with high probability. While the proposed framework allows a large class of algorithms to be used for clustering the sampled set, we focus on some popular parametric algorithms for ease of exposition. We then present algorithms to populate and refine the clusters. The algorithm for populating the clusters is based on a generalization of the stable marriage problem, whereas the refinement algorithm is a constrained iterative relocation scheme. The complexity of the overall method is O(kN log N) for obtaining k balanced clusters from N data points, which compares favorably with other existing techniques for balanced clustering. In addition to providing balancing guarantees, the clustering performance obtained using the proposed framework is comparable to and often better than the corresponding unconstrained solution. Experimental results on several datasets, including high-dimensional (>20,000) ones, are provided to demonstrate the efficacy of the proposed framework.

Original languageEnglish (US)
Pages (from-to)365-395
Number of pages31
JournalData Mining and Knowledge Discovery
Volume13
Issue number3
DOIs
StatePublished - Nov 2006

Bibliographical note

Funding Information:
The research was supported in part by NSF grants IIS 0325116, IIS 0307792, and an IBM PhD fellowship.

Keywords

  • Balanced clustering
  • Constrained clustering
  • Sampling
  • Scalable clustering
  • Stable marriage problem
  • Text clustering

Fingerprint Dive into the research topics of 'Scalable clustering algorithms with balancing constraints'. Together they form a unique fingerprint.

Cite this