Deep Clustering Research Articles

Self-supervised clustering with assistance from off-the-shelf classifier

Deep clustering outperforms conventional clustering by mutually promoting representation learning and cluster assignment. However, most existing deep clustering methods suffer from two major drawbacks. Firstly, most cluster assignment methods are highly dependent on the intermediate target distribution generated by a handcrafted nonlinear mapping function. Secondly, the clustering results can be easily guided towards wrong direction by the misassigned samples in each cluster. The existing deep clustering methods are incapable of discriminating such samples. These facts largely limit the possible performance that deep clustering methods can reach. To address these issues, a novel Self-Supervised Clustering (SSC) framework is constructed, which boosts the clustering performance by classification in an unsupervised manner. Fuzzy theory is used to score the membership of each sample to the clusters in terms of probability in each training epoch, which evaluates the intermediate clustering result certainty of each sample. The most reliable samples can be selected with the help of a sample selection method according to the membership and enhanced by data augmentation method. These augmented data are employed to fine-tune an off-the-shelf deep network classifier with the labels provided by the clustering in a self-supervised way. The classification results of the original dataset are used as the target distribution to guide the training process of the deep clustering model. The proposed framework can efficiently discriminate sample outliers and generate better target distribution with the assistance of the powerful classifier. Extensive experiments indicate that the proposed framework remarkably outperforms state-of-the-art deep clustering methods on four benchmark datasets.

Deep collaborative learning with class-rebalancing for semi-supervised change detection in SAR images

Deep learning reveals excellent potential for accomplishing change detection in SAR imagery. Yet, it suffers from the problem of requiring large amounts of labeled samples, whilst labeling SAR imagery for change detection requires experts to label individual images at the pixel level, which is extremely tedious and time-consuming. Also, sample imbalance continues to present a serious challenge for the existing change detection techniques. To tackle these problems, in this study, a Deep Collaborative semi-supervised learning Framework with Class-Rebalancing (DCF-CRe) is proposed for SAR imagery change detection, by exploiting Convolutional Neural Network (CNN) and deep clustering. In particular, a Siamese Difference Fusion Network (SDFNet) is devised to implement change detection while effectively reducing the information loss due to the generation of difference images and highlighting features of the changed regions.In so doing, only a tiny batch of labeled samples is utilized to train SDFNet in order to obtain predicted change map and deep features. In addition, the Approximate Rank-Order Clustering (AROC) algorithm is employed to cluster the deep features, generating pseudo-labels for abundant unlabeled samples. DCF-CRe is then applied to select appropriate pseudo-labels and to add labeled samples to train SDFNet. Experimental results evaluated on six challenging datasets show that this proposed approach can achieve performance superior to state-of-the-art change detection methods for SAR imagery.

Heterogeneous Tri-stream Clustering Network

Contrastive deep clustering has recently gained significant attention with its ability of joint contrastive learning and clustering via deep neural networks. Despite the rapid progress, previous works mostly require both positive and negative sample pairs for contrastive clustering, which rely on a relative large batch-size. Moreover, they typically adopt a two-stream architecture with two augmented views, which overlook the possibility and potential benefits of multi-stream architectures (especially with heterogeneous or hybrid networks). In light of this, this paper presents a new end-to-end deep clustering approach termed Heterogeneous Tri-stream Clustering Network (HTCN). The tri-stream architecture in HTCN consists of three main components, including two weight-sharing online networks and a target network, where the parameters of the target network are the exponential moving average of that of the online networks. Notably, the two online networks are trained by simultaneously (i) predicting the instance representations of the target network and (ii) enforcing the consistency between the cluster representations of the target network and that of the two online networks. Experimental results on four challenging image datasets demonstrate the superiority of HTCN over the state-of-the-art deep clustering approaches. The code is available at https://github.com/dengxiaozhi/HTCN .

Deep radio signal clustering with interpretability analysis based on saliency map

With the development of information technology, radio communication technology has made rapid progress. Many radio signals that have appeared in space are difficult to classify without manually labeling. Unsupervised radio signal clustering methods have recently become an urgent need for this situation. Meanwhile, the high complexity of deep learning makes it difficult to understand the decision results of the clustering models, making it essential to conduct interpretable analysis. This paper proposed a combined loss function for unsupervised clustering based on autoencoder. The combined loss function includes reconstruction loss and deep clustering loss. Deep clustering loss is added based on reconstruction loss, which makes similar deep features converge more in feature space. In addition, a features visualization method for signal clustering was proposed to analyze the interpretability of autoencoder utilizing Saliency Map. Extensive experiments have been conducted on a modulated signal dataset, and the results indicate the superior performance of our proposed method over other clustering algorithms. In particular, for the simulated dataset containing six modulation modes, when the SNR is 20 ​dB, the clustering accuracy of the proposed method is greater than 78%. The interpretability analysis of the clustering model was performed to visualize the significant features of different modulated signals and verified the high separability of the features extracted by clustering model.

DC-FUDA: Improving deep clustering via fully unsupervised domain adaptation

By transferring knowledge from a source domain, the performance of deep clustering on an unlabeled target domain can be greatly improved. When achieving this, traditional approaches assume that an adequate amount of labeled data are available in the source domain. However, this assumption is not always satisfied in practice. First, it cannot be guaranteed that rich labeled samples are readily available in the selected source domain. Second, the noisy data in the source domain may lead to negative transferring. In this paper, we propose a novel transfer learning framework to improve deep clustering via fully unsupervised domain adaptation, called DC-FUDA. Specifically, to select reliable instances in the source domain for transferring, we propose a novel adaptive threshold algorithm to select low entropy instances. To transfer important features of the selected instances, we propose a feature-level domain adaptation network (FeatureDA) that cancels an unstable instance generation process. With extensive experiments, we validate that our method effectively improves deep clustering. Besides, without using any labeled data in the source domain, our method achieves competitive results, compared to the state-of-the-art methods using labeled data in the source domain.

Short-term wind power prediction method based on deep clustering-improved Temporal Convolutional Network

Carbon neutrality has become the global consensus, and wind power is one of the key technologies to achieve carbon neutrality in the power system. However, the randomness and fluctuation of wind energy pose a great challenge to the safe and stable operation of the power system. Accurate wind power prediction results can effectively reduce the adverse effects of wind power uncertainty on power system operation. The high proportion of wind power connected to the grid requires higher prediction accuracy. However, the existing wind power prediction methods exist the problems of inaccurate classification of numerical weather prediction (NWP) and insufficient consideration of actual characteristics. Therefore, a short-term wind power prediction method based on deep clustering-improved Temporal Convolutional Network (TCN) is proposed in this paper. First, 22 typical features of NWP are extracted (including maximum and minimum wind speed, maximum and minimum temperature, etc.). Then, a deep clustering model based on Categorical Generative Adversarial Network is constructed to classify the extracted NWP features accurately. Finally, to address the problem of partial feature loss in the training process of traditional TCN, a gating mechanism is introduced to improve the activation function of its residual block, and an improved TCN prediction model for each class is established. The actual operation data of three wind farms are used to verify the effectiveness and robustness of the proposed wind power prediction method. The results show that the proposed method can reduce the prediction error (Root Mean Squared Error) from 7.18% to 12.87% in three wind farms, compared with other traditional prediction methods.

Fentanyl analogs classification via Siamese network and mass spectral library searching

Fentanyl and its analogs, as emerging psychotropic drugs, have led to a sharp increasing fatality due to their abuse in recent years. It is difficult to identify their differences due to the diversified molecular structures and small sample characteristics. This paper proposed a novel deep classification model based on Siamese network and mass spectral library searching to classify fentanyl analogs accurately. After embedding the query mass spectrum and reference spectrum into a low-dimensional space, the best matched spectrum is obtained by calculating their similarity, so as to determine the category of the query analogue. Three experiments were performed to verify the classification performance of the proposed model on two open datasets of fentanyl analogs. Compared with two spectral library searching methods of simple match factor (sMF) and hybrid match factor (hMF), four machine learning methods of linear discriminant analysis (LDA), support vector machine (SVM), random forest (RF) and Adaboost, and two deep learning methods of deep clustering and contrastive learning, the proposed model can achieve the highest classification accuracy of 96.13%, 95.83% and 94.17%, respectively.

ScDCCA: deep contrastive clustering for single-cell RNA-seq data based on auto-encoder network.

The advances in single-cell ribonucleic acid sequencing (scRNA-seq) allow researchers to explore cellular heterogeneity and human diseases at cell resolution. Cell clustering is a prerequisite in scRNA-seq analysis since it can recognize cell identities. However, the high dimensionality, noises and significant sparsity of scRNA-seq data have made it a big challenge. Although many methods have emerged, they still fail to fully explore the intrinsic properties of cells and the relationship among cells, which seriously affects the downstream clustering performance. Here, we propose a new deep contrastive clustering algorithm called scDCCA. It integrates a denoising auto-encoder and a dual contrastive learning module into a deep clustering framework to extract valuable features and realize cell clustering. Specifically, to better characterize and learn data representations robustly, scDCCA utilizes a denoising Zero-Inflated Negative Binomial model-based auto-encoder to extract low-dimensional features. Meanwhile, scDCCA incorporates a dual contrastive learning module to capture the pairwise proximity of cells. By increasing the similarities between positive pairs and the differences between negative ones, the contrasts at both the instance and the cluster level help the model learn more discriminative features and achieve better cell segregation. Furthermore, scDCCA joins feature learning with clustering, which realizes representation learning and cell clustering in an end-to-end manner. Experimental results of 14 real datasets validate that scDCCA outperforms eight state-of-the-art methods in terms of accuracy, generalizability, scalability and efficiency. Cell visualization and biological analysis demonstrate that scDCCA significantly improves clustering and facilitates downstream analysis for scRNA-seq data. The code is available at https://github.com/WJ319/scDCCA.

Deep Reinforcement Clustering

Deep clustering has attracted plentiful attention in various domains owning to the superior performance. However, the previous deep clustering methods are guided by pre-specified clustering strategies that lack sustained explorations of data structures, degrading recognition of intrinsic patterns hidden in data. To address this challenge, deep reinforcement clustering (DRC) is proposed to learn an adaptive partition policy for pattern mining, which can fully explore structure knowledge of data in an adaptive manner. DRC is defined as a Markov decision process of data partitions, which chooses the optimal cluster prototype for data via maximizing the cumulative reward in state transition of environment. To implement the definition, a Bernoulli action prototype is devised to capture decision distributions in the transition of states, where the heavy-tailed Cauchy distribution precisely measures the structure divergences of data. Furthermore, a reward maximizing policy is designed to guide sustained explorations of data structures, which ensures intra-cluster compactness and inter-cluster separation of data partitions. Finally, extensive experiments are conducted on eight benchmark datasets, and the results demonstrate that DRC outperforms the state-of-the-art baseline methods.

Unsupervised Clustering of Microseismic Signals Using a Contrastive Learning Model

Distinguishing useful microseismic signals is a critical step in microseismic monitoring. Here, we present the time series contrastive clustering (TSCC) method, an end-to-end unsupervised model for clustering microseismic signals that employs a contrastive learning network and a centroidal-based clustering model. The TSCC framework consists of two successive phases: pre-training and fine-tuning. In the pre-training phase, two random cropping augmentations are used to transform the time series microseismic data into two distinct but correlated views. Then, the multi-scale temporal and instance contrasting learning are used to discriminate between negative and positive views, thus motivating the encoder to capture microseismic signal contextual information from multiple perspectives and generate distinct representations from unlabeled data. During the fine-tuning phase, the encoder weights are iteratively fine-tuned by simultaneously performing contrast learning and clustering. The corresponding loss is a weighted combination of the contrastive and clustering loss functions, which induces the encoder to learn representations that improve clustering performance. The test results demonstrate that the proposed method can achieve better clustering accuracy than popular clustering methods, including k-means, deep embedding clustering, unsupervised clustering with deep convolutional autoencoders, and deep clustering with self-supervision. Moreover, the TSCC model can produce results comparable to supervised deep learning approaches while requiring no labeled data, manual feature extraction, or large training datasets. In practice, the TSCC model has a clustering accuracy of 98.07% and a normalized mutual information of 86.26%.

Seismic Stratigraphic Interpretation Based on Deep Active Learning

Seismic stratigraphic interpretation plays an important role in geophysics and geosciences. Recently, deep learning has been explored for seismic stratigraphic interpretation. However, deep learning-based interpretation methods usually require sufficient labeled samples. This is often too hard to be satisfied in field seismic interpretation. In this paper, we propose a deep active learning-based method to address this issue. Active learning typically exploits prediction uncertainty to reduce labeling effort. We found that uncertainty of prediction is easily obtained in the field of seismic interpretation. Since adjacent seismic images are very similar, they should have similar predictions. When the model performs poorly, the predictions of adjacent images will differ significantly. Thus, the uncertainty can be easily obtained by measuring the similarity of the predictions of adjacent seismic images. Then, data with the highest uncertainty is annotated by geological expert and used for the next round of training. For few-shot active learning, initial models obtained by different initial training sets are quite different. We combine deep clustering and uncertainty sampling to select initial training datasets, with which a good initial model can be obtained. To improve generalization, we introduce a random thin plate spine transformation to simulate changes of terrain. We apply the proposed method to the F3 field seismic data. The results demonstrated that the proposed method can effectively improve performance of learned seismic interpretation network with very limited labeled samples.

Blind source separation by long-term monitoring: A variational autoencoder to validate the clustering analysis.

Noise exposure influences the comfort and well-being of people in several contexts, such as work or learning environments. For instance, in offices, different kind of noises can increase or drop the employees' productivity. Thus, the ability of separating sound sources in real contexts plays a key role in assessing sound environments. Long-term monitoring provide large amounts of data that can be analyzed through machine and deep learning algorithms. Based on previous works, an entire working day was recorded through a sound level meter. Both sound pressure levels and the digital audio recording were collected. Then, a dual clustering analysis was carried out to separate the two main sound sources experienced by workers: traffic and speech noises. The first method exploited the occurrences of sound pressure levels via Gaussian mixture model and K-means clustering. The second analysis performed a semi-supervised deep clustering analyzing the latent space of a variational autoencoder. Results show that both approaches were able to separate the sound sources. Spectral matching and the latent space of the variational autoencoder validated the assumptions underlying the proposed clustering methods.

Contrastive Clustering for Unsupervised Recognition of Interference Signals

Interference signals recognition plays an important role in anti-jamming communication. With the development of deep learning, many supervised interference signals recognition algorithms based on deep learning have emerged recently and show better performance than traditional recognition algorithms. However, there is no unsupervised interference signals recognition algorithm at present. In this paper, an unsupervised interference signals recognition method called double phases and double dimensions contrastive clustering (DDCC) is proposed. Specifically, in the first phase, four data augmentation strategies for interference signals are used in data-augmentation-based (DA-based) contrastive learning. In the second phase, the original dataset’s k-nearest neighbor set (KNNset) is designed in double dimensions contrastive learning. In addition, a dynamic entropy parameter strategy is proposed. The simulation experiments of 9 types of interference signals show that random cropping is the best one of the four data augmentation strategies; the feature dimensional contrastive learning in the second phase can improve the clustering purity; the dynamic entropy parameter strategy can improve the stability of DDCC effectively. The unsupervised interference signals recognition results of DDCC and five other deep clustering algorithms show that the clustering performance of DDCC is superior to other algorithms. In particular, the clustering purity of our method is above 92%, SCAN’s is 81%, and the other three methods’ are below 71% when jamming-noise-ratio (JNR) is −5 dB. In addition, our method is close to the supervised learning algorithm.

Data-Efficient Learning via Minimizing Hyperspherical Energy.

Deep learning on large-scale data is currently dominant nowadays. The unprecedented scale of data has been arguably one of the most important driving forces behind its success. However, there still exist scenarios where collecting data or labels could be extremely expensive, e.g., medical imaging and robotics. To fill up this gap, this paper considers the problem of data-efficient learning from scratch using a small amount of representative data. First, we characterize this problem by active learning on homeomorphic tubes of spherical manifolds. This naturally generates feasible hypothesis class. With homologous topological properties, we identify an important connection - finding tube manifolds is equivalent to minimizing hyperspherical energy (MHE) in physical geometry. Inspired by this connection, we propose a MHE-based active learning (MHEAL) algorithm, and provide comprehensive theoretical guarantees for MHEAL, covering convergence and generalization analysis. Finally, we demonstrate the empirical performance of MHEAL in a wide range of applications for data-efficient learning, including deep clustering, distribution matching, version space sampling, and deep active learning.

Microseismic Events Recognition via Joint Deep Clustering With Residual Shrinkage Dense Network

Microseismic Events Recognition via Joint Deep Clustering With Residual Shrinkage Dense Network

AugDMC: Data Augmentation Guided Deep Multiple Clustering

Clustering aims to group similar objects together while separating dissimilar ones apart. Thereafter, structures hidden in data can be identified to help understand data in an unsupervised manner. Traditional clustering methods such as k-means provide only a single clustering for one data set. Deep clustering methods such as auto-encoder based clustering methods have shown a better performance, but still provide a single clustering. However, a given dataset might have multiple clustering structures and each represents a unique perspective of the data. Therefore, some multiple clustering methods have been developed to discover multiple independent structures hidden in data. Although deep multiple clustering methods provide better performance, how to efficiently capture the alternative perspectives in data is still a problem. In this paper, we propose AugDMC, a novel data Augmentation guided Deep Multiple Clustering method, to tackle the challenge. Specifically, AugDMC leverages data augmentations to automatically extract features related to a certain aspect of the data using a self-supervised prototype-based representation learning, where different aspects of the data can be preserved under different data augmentations. Moreover, a stable optimization strategy is proposed to alleviate the unstable problem from different augmentations. Thereafter, multiple clusterings based on different aspects of the data can be obtained. Experimental results on three real-world datasets compared with state-of-the-art methods validate the effectiveness of the proposed method.

Consensus graph learning-based self-supervised ensemble clustering

目的 随着实际应用场景中海量数据采集技术的发展和数据标注成本的不断增加，自监督学习成为海量数据分析的一个重要策略。然而，如何从海量数据中抽取有用的监督信息，并该监督信息下开展有效的学习仍然是制约该方向发展的研究难点。为此，提出了一个基于共识图学习的自监督集成聚类框架。方法 框架主要包括3个功能模块。首先，利用集成学习中多个基学习器构建共识图；其次，利用图神经网络分析共识图，捕获节点优化表示和节点的聚类结构，并从聚类中挑选高置信度的节点子集及对应的类标签生成监督信息；再次，在此标签监督下，联合其他无标注样本更新集成成员基学习器。交替迭代上述功能块，最终提高无监督聚类的性能。结果 为验证该框架的有效性，在标准数据集（包括图像和文本数据）上设计了一系列实验。实验结果表明，所提方法在性能上一致优于现有聚类方法。尤其是在MNIST-Test （modified national institute of standards and technology database）上，本文方法实现了97.78%的准确率，比已有最佳方法高出3.85%。结论 该方法旨在利用图表示学习提升自监督学习中监督信息捕获的能力，监督信息的有效获取进一步强化了集成学习中成员构建的能力，最终提升了无监督海量数据本质结构的挖掘性能。;Objective Clustering is focused on machine learning-related data segmentation for multiple datasets. Its applications are in relevant to such domains like image segmentation and anomaly detection. In addition，to simplify complex tasks optimize its performance，clustering is used in data preprocessing tasks of those are data sub-blocks segmentation， pseudo-labels generation，and abnormal points-removal. Self-supervised learning has become an essential technique for massive data analysis. However，it is challenged to extract effective supervision information and analyze the input data. Method A consensus graph learning based self-supervised ensemble clustering（CGL-SEC）framework is developed. It consists of three main modules：1）to construct the consensus graph based on several ensemble components（i. e. ，the basic clustering methods）. 2）to extract the supervision information by learning the consensus graph representation，and 3）its node clustering results，where the subset of nodes with the high-confidence are selected as labeled samples. To optimize the ensemble components and the corresponding consensus graph，t basic clustering methods are re-trained in related the option of samples-labeled and other samples-unlabeled. The final clustering results can be optimized iteratively until the learning process converges. Result A series of experiments are carried out on benchmarks，including both image and textual datasets. Especially，CGL-SEC is 3. 85% over baseline in terms of clustering evaluation metric on themodified national institute of standards and technology database（MNIST-Test）. First，to optimize data representation and cluster assignment at the same time，deep embedding clustering can be focused on data itself as the supervision information and auto-encoder with the reconstruction loss is pre-trained. The soft cluster assignment of features-embedded is then calculated，and the KL（Kullback-Leibler）divergence is minimized between the soft cluster assignment and the auxiliary target distribution. To improve the performance of the model further，following deep clustering network（DCN）can use hard clustering instead of soft allocation，and local constraints are applied by improved deep embedding clustering（IDEC）. The pseudo-label strategy is implemented as a self-supervised learning method that uses the prediction results of the neural network as the label to simulate the supervision information compared to using data itself as the supervision information. Deepcluster-based K-means clustering is used to generate pseudo-labels to guide the training of convolutional networks. However，the generated pseudo-labels have lower confidence and are prone to trivial solutions in the initial stage of network training. Deep embedding clustering with data augmentation（DEC-DA）and MixMatch-based prediction of data-enhanced samples are used as the supervision information of the original data，which improves the accuracy of the supervision information to a certain extent，but this method is difficult to extend to text and other fields. Deep adaptive clustering-based high-confidence pseudo-label subsets-selected are iteratively trained the network in the prediction results，but lowconfidence samples-involved data distribution information is ignored. Pseudo-semi-supervised clustering votes are used to select a subset of high-confidence pseudo-labels，and all samples are used to train semi-supervised neural network. Although the ensemble strategy can improve the confidence of the pseudo-label，the voting strategy is concerned of category representation only without the feature representation of the sample itself，which can reduce the clustering performance in some cases. The ensemble learning is regarded as a representative machine learning method that reflects the ability of group intelligence，whereas a learning method can improve the overall prediction performance via multiple base learners training and their coordinated prediction results. In pseudo-label-based clustering tasks，it can coordinate multiple base learners to obtain high-confidence pseudo-labels. However，the effectiveness of the supervision information acquisition is still to be resolved. The category information of the sample is considered for current pseudo-label-based ensemble clustering method only when the label is captured and some effective information are ignored like the feature representation of the sample itself and the clustering structure between samples. Conclusion Graph neural network is composed of content information of nodes and the structural information between nodes at the same time. To design a self-supervised ensemble clustering method based on consensus graph representation learning，it is required to make full use of sample features and relationships between samples in ensemble learning. To obtain higher confidence pseudo-labels as supervised information and improve the performance of self-supervised clustering，it is necessary to mine global and local information at the same time. We illustrate a learnable data ensemble representation through graph neural network. The confidence of pseudo-labels is improved，and the entire model is trained in self-supervision iteratively. To be summarized：1）Commonly-used consensus graph learning-integrated clustering framework is developed，which can use multi-level information like clusteringintegrated sample characteristics and category structure. 2）Self-supervision method is proposed，which uses graph neural network to mine the global and local information of the consensus graph，and high-confidence pseudo-labels are obtained as supervised information. 3）Experiments are demonstrated that the consensus graph learning ensemble clustering method has its potentials on image and text datasets.

Analysis of Driving Behavior in Unprotected Left Turns for Autonomous Vehicles using Ensemble Deep Clustering

Analysis of Driving Behavior in Unprotected Left Turns for Autonomous Vehicles using Ensemble Deep Clustering

Latent Features Embedded Dynamic Graph Evolution Deep Clustering Network

As a typical unsupervised machine learning task, clustering is always a hot research topic. Motivated by deep learning approaches, deep clustering has become prevalent in recent years, and achieves appealing performance. Most of current deep clustering methods focus on learning a new discriminative representation to enhance separability of original data, i.e., autoencoder, multilayer perceptrons and deep belief networks. However, the structure information which is very important in unsupervised learning, attracts little attention in previous deep feature representation learning clustering works. In this paper, a dynamic graph evolution based graph convolutional network (DGE-GCN) is introduced for clustering task, in which the data structural information and learned latent features are integrated into a unified network for deep clustering. Instead of using a fixed graph during the graph convolution process, we design a dynamic graph evolution strategy to refine the initial graph which could be not accurate. In addition, the latent representations learned by an autoencoder are embedded for refining the graph in a layer-wise manner. In such a manner, the latent features can help improve the graph structure, while the refined graph can in turn constrain the autoencoder to learn more discriminative features. In order to unify the graph convolutional network branch and autoencoder branch, a dual self-supervised mechanism is designed to guide the parameter learning of the whole network architecture. Comprehensive experiments demonstrate that the proposed network consistently performs better than several state-of-the-art methods on various benchmark datasets.

Deep clustering of cooperative multi-agent reinforcement learning to optimize multi chiller HVAC systems for smart buildings energy management

Chillers are responsible for almost half of the total energy demand in buildings. Hence, the obligation of control systems of multi-chiller due to changes indoor environments is one of the most significant parts of a smart building. Such a controller is described as a nonlinear and multi-objective algorithm, and its fabrication is crucial to achieving the optimal balance between indoor thermal comfort and running a minimum number of chillers. This work proposes deep clustering of cooperative multi-agent reinforcement learning (DCCMARL) as well-suited to such system control, which supports centralized control by learning of agents. In MARL, since the learning of agents is based on discrete sets of actions and stats, this drawback significantly affects the model of agents for representing their actions with efficient performance. This drawback becomes considerably worse when increasing the number of agents, due to the increased complexity of solving MARL, which makes modeling policy very challenging. Therefore, the DCCMARL of multi-objective reinforcement learning is leveraging powerful frameworks of a hybrid clustering algorithm to deal with complexity and uncertainty, which is a critical factor that influences to the achievement of high levels of a performance action. The results showed that the ability of agents to manipulate the behavior of the smart building could improve indoor thermal conditions, as well as save energy up to 44.5% compared to conventional methods. It seems reasonable to conclude that agents' performance is influenced by what type of model structure.