Multiplicative Mixture Models for Overlapping Clustering

The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we present an overlapping clustering algorithm based on multiplicative mixture models. We analyze a general setting where each component of the multiplicative mixture is from an exponential family, and present an efficient alternating maximization algorithm to learn the model and infer overlapping clusters. We also show that when each component is assumed to be a Gaussian, we can apply the kernel trick leading to non-linear cluster separators and obtain better clustering quality. The efficacy of the proposed algorithms is demonstrated using experiments on both UCI benchmark datasets and a microarray gene expression dataset.

• Type: Conference
• Year: 2008
• Where: ICDM
• Authors: Qiang Fu, Arindam Banerjee
• Keywords: Data Mining, ICDM 2008, Multiplicative Mixture, Overlapping Clustering, Overlapping Clustering Algorithm