DRBM-ClustNet: A Deep Restricted Boltzmann-Kohonen Architecture for Data Clustering

by   J. Senthilnath, et al.

A Bayesian Deep Restricted Boltzmann-Kohonen architecture for data clustering termed as DRBM-ClustNet is proposed. This core-clustering engine consists of a Deep Restricted Boltzmann Machine (DRBM) for processing unlabeled data by creating new features that are uncorrelated and have large variance with each other. Next, the number of clusters are predicted using the Bayesian Information Criterion (BIC), followed by a Kohonen Network-based clustering layer. The processing of unlabeled data is done in three stages for efficient clustering of the non-linearly separable datasets. In the first stage, DRBM performs non-linear feature extraction by capturing the highly complex data representation by projecting the feature vectors of d dimensions into n dimensions. Most clustering algorithms require the number of clusters to be decided a priori, hence here to automate the number of clusters in the second stage we use BIC. In the third stage, the number of clusters derived from BIC forms the input for the Kohonen network, which performs clustering of the feature-extracted data obtained from the DRBM. This method overcomes the general disadvantages of clustering algorithms like the prior specification of the number of clusters, convergence to local optima and poor clustering accuracy on non-linear datasets. In this research we use two synthetic datasets, fifteen benchmark datasets from the UCI Machine Learning repository, and four image datasets to analyze the DRBM-ClustNet. The proposed framework is evaluated based on clustering accuracy and ranked against other state-of-the-art clustering methods. The obtained results demonstrate that the DRBM-ClustNet outperforms state-of-the-art clustering algorithms.


page 1

page 6

page 8

page 9

page 12


Deep Density-based Image Clustering

Recently, deep clustering, which is able to perform feature learning tha...

A General Hybrid Clustering Technique

Here, we propose a clustering technique for general clustering problems ...

A brief survey on deep belief networks and introducing a new object oriented toolbox (DeeBNet)

Nowadays, this is very popular to use the deep architectures in machine ...

ThetA – fast and robust clustering via a distance parameter

Clustering is a fundamental problem in machine learning where distance-b...

GuCNet: A Guided Clustering-based Network for Improved Classification

We deal with the problem of semantic classification of challenging and h...

Graph clustering with Boltzmann machines

Graph clustering is the process of grouping vertices into densely connec...

Dimensionality's Blessing: Clustering Images by Underlying Distribution

Many high dimensional vector distances tend to a constant. This is typic...

Please sign up or login with your details

Forgot password? Click here to reset