Deep embedded clustering with adversarial distribution adaptation

11Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Clustering methods based on deep neural networks have been extensively studied and applied in data mining. Most existing unsupervised deep embedded clustering methods jointly learn feature representations and cluster assignments with deep neural networks. However, to the best of our knowledge, most of them ignore the relevance between representation learning and clustering, so that fail to couple feature representation learning and cluster assignments effectively, which leads to non-representative features for clustering and this in turn hurts clustering performance. In this paper, we propose Adversarial Deep Embedded Clustering (ADEC), a novel unsupervised clustering method based on adversarial auto-encoder (AAE) and k-means clustering method. Specifically, ADEC matches distribution of feature representations with the given prior distribution to preserve the data structure with AAE, and k-means based on distribution distance metrics is conducted for clustering with these feature representations, simultaneously. ADEC optimizes a clustering objective iteratively with backpropagation algorithm in learning AAE from data space to feature space. Extensive experiments have demonstrated the effectiveness of our proposed method on images clustering compared to several strong baseline methods.

Cite

CITATION STYLE

APA

Zhou, W., & Zhou, Q. (2019). Deep embedded clustering with adversarial distribution adaptation. IEEE Access, 7, 113801–113809. https://doi.org/10.1109/ACCESS.2019.2935388

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free