DAC: Deep Autoencoder-based Clustering, a General Deep Learning Framework of Representation Learning
Clustering performs an essential role in many real world applications, such as market research, pattern recognition, data analysis, and image processing. However, due to the high dimensionality of the input feature values, the data being fed to clustering algorithms usually contains noise and thus could lead to in-accurate clustering results. While traditional dimension reduction and feature selection algorithms could be used to address this problem, the simple heuristic rules used in those algorithms are based on some particular assumptions. When those assumptions does not hold, these algorithms then might not work. In this paper, we propose DAC, Deep Autoencoder-based Clustering, a generalized data-driven framework to learn clustering representations using deep neuron networks. Experiment results show that our approach could effectively boost performance of the K-Means clustering algorithm on a variety types of datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDimensionality Reductionfeature selectionRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
An Introductory Survey to Autoencoder-based Deep Clustering -- Sandboxes for Combining Clustering with Deep Learning
Autoencoders offer a general way of learning low-dimensional, non-linear representations from data without labels. This is achieved without making any particular assumptions about the data type or other domain knowledge.…
ClusteringDeep ClusteringRepresentation Learning for Short Text Clustering
Effective representation learning is critical for short text clustering due to the sparse, high-dimensional and noise attributes of short text corpus. Existing pre-trained models (e.g., Word2vec and BERT) have greatly im…
ClusteringRepresentation LearningShort Text ClusteringText ClusteringMasked AutoEncoder for Graph Clustering without Pre-defined Cluster Number k
Graph clustering algorithms with autoencoder structures have recently gained popularity due to their efficient performance and low training cost. However, for existing graph autoencoder clustering algorithms based on GCN…
ClusteringDecoderGraph ClusteringSpectral Clustering via Ensemble Deep Autoencoder Learning (SC-EDAE)
Recently, a number of works have studied clustering strategies that combine classical clustering algorithms and deep learning methods. These approaches follow either a sequential way, where a deep representation is learn…
ClusteringDeep ClusteringEnsemble LearningBinding via Reconstruction Clustering
Disentangled distributed representations of data are desirable for machine learning, since they are more expressive and can generalize from fewer examples. However, for complex data, the distributed representations of mu…
ClusteringDenoisingRepresentation Learning