Robust deep k-means: An effective and simple method for data clustering. (September 2021)

• Record Type: Journal Article
• Authors: Huang, Shudong; Kang, Zhao; Xu, Zenglin; Liu, Quanhui
• Is Part Of: Pattern recognition. Volume 117(2021)
• Publication Date: 2021-09
• Subjects: k-means algorithm -- Robust clustering -- Deep learning; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2021.107996
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: A novel robust deep model is proposed to perform k -means hierarchically, thus the hierarchical semantics of data can be explored in a layerwise way. As a result, data samples from the same class are effectively gathered closer layer by layer. To solve the optimization problem of our model, the corresponding objective function is derived to a more trackable form and an alternative updating algorithm is presented to solve the optimization problem. Experiments over 12 benchmark data sets are conducted and show promising results, compared to both classical and state-of-the-art methods. Abstract: Clustering aims to partition an input dataset into distinct groups according to some distance or similarity measurements. One of the most widely used clustering method nowadays is the k -means algorithm because of its simplicity and efficiency. In the last few decades, k -means and its various extensions have been formulated to solve the practical clustering problems. However, existing clustering methods are often presented in a single-layer formulation (i.e., shallow formulation). As a result, the mapping between the obtained low-level representation and the original input data may contain rather complex hierarchical information. To overcome the drawbacks of low-level features, deep learning techniques are adopted to extract deep representations and improve the clustering performance. In this paper, we propose a robust deep k -means model to learn the hidden representations associate with different implicit lower-level attributes. By using the deep structure to hierarchically perform k -means, the hierarchical semantics of data can be exploited in a layerwise way. Data samples from the same class are forced to be closer layer by layer, which is beneficial for clustering task. The objective function of our model is derived to a more trackable form such that the optimization problem can be tackled more easily and the final robust results can be obtained. Experimental results over 12 benchmark data sets substantiate that the proposed model achieves a breakthrough in clustering performance, compared with both classical and state-of-the-art methods.