Bregman Bubble Clustering: A Robust, Scalable Framework for Locating Multiple, Dense Regions in Data

Authors:
Gunjan Gupta;Joydeep Ghosh
Affiliations:
University of Texas at Austin, USA;University of Texas at Austin, USA
Venue:
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Year:
2006

Citing 0
Cited 4

Bregman bubble clustering: A robust framework for mining dense clusters

ACM Transactions on Knowledge Discovery from Data (TKDD)
A rate-distortion one-class model and its applications to clustering

Proceedings of the 25th international conference on Machine learning
A scalable framework for discovering coherent co-clusters in noisy data

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Mining temporal patterns in popularity of web items

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In traditional clustering, every data point is assigned to at least one cluster. On the other extreme, One Class Clustering algorithms proposed recently identify a single dense cluster and consider the rest of the data as irrelevant. However, in many problems, the relevant data forms multiple natural clusters. In this paper, we introduce the notion of Bregman bubbles and propose Bregman Bubble Clustering (BBC) that seeks k dense Bregman bubbles in the data. We also present a corresponding generative model, Soft BBC, and show several connections with Bregman Clustering, and with a One Class Clustering algorithm. Empirical results on various datasets show the effectiveness of our method.