Deep Clustering using Dirichlet Process Gaussian Mixture and Alpha Jensen-Shannon Divergence Clustering Loss
Kart-Leong Lim

TL;DR
This paper introduces a deep clustering method that uses Jensen-Shannon divergence and a Dirichlet process Gaussian mixture model to improve cluster quality and automatically determine the number of clusters without prior knowledge.
Contribution
It proposes a novel deep clustering approach combining Jensen-Shannon divergence with a Dirichlet process Gaussian mixture model for joint clustering and model selection.
Findings
Outperforms traditional methods on large datasets
Automatically determines the optimal number of clusters
Improves clustering quality with Jensen-Shannon divergence
Abstract
Deep clustering is an emerging topic in deep learning where traditional clustering is performed in deep learning feature space. However, clustering and deep learning are often mutually exclusive. In the autoencoder based deep clustering, the challenge is how to jointly optimize both clustering and dimension reduction together, so that the weights in the hidden layers are not only guided by reconstruction loss, but also by a loss function associated with clustering. The current state-of-the-art has two fundamental flaws. First, they rely on the mathematical convenience of Kullback-Leibler divergence for the clustering loss function but the former is asymmetric. Secondly, they assume the prior knowledge on the number of clusters is always available for their dataset of interest. This paper tries to improve on these problems. In the first problem, we use a Jensen-Shannon divergence to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Gaussian Processes and Bayesian Inference
