A Deep Clustering Algorithm based on Gaussian Mixture Model

12Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Clustering autonomously learns the implicit cluster structure in the original data without prior knowledge. The effect of ordinary clustering algorithms is not good to cluster high-dimensional data. In this paper, we propose a deep clustering algorithm based on Gaussian mixture model, which combines two models of stacked auto-encoder and Gaussian mixture model. This algorithm uses the expectation maximization algorithm of reducing dimension data feature to train Gaussian mixture and updates the data cluster so that the data is clustered in the feature space. The experimental results demonstrate that the proposed algorithm improves the clustering accuracy, and verifies the effectiveness of the algorithm.

Cite

CITATION STYLE

APA

Lin, X., Yang, X., & Li, Y. (2019). A Deep Clustering Algorithm based on Gaussian Mixture Model. In Journal of Physics: Conference Series (Vol. 1302). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1302/3/032012

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