Next Article in Journal
Lifts of Symmetric Tensors: Fluids, Plasma, and Grad Hierarchy
Next Article in Special Issue
Study on the Influence of Diversity and Quality in Entropy Based Collaborative Clustering
Previous Article in Journal
On NACK-Based rDWS Algorithm for Network Coded Broadcast
Previous Article in Special Issue
Estimating Topic Modeling Performance with Sharma–Mittal Entropy
Open AccessArticle

A Hierarchical Gamma Mixture Model-Based Method for Classification of High-Dimensional Data

College of Computer Science and Software Engineering, Shenzhen University, Shenzhen 518060, China
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(9), 906; https://doi.org/10.3390/e21090906
Received: 20 August 2019 / Revised: 8 September 2019 / Accepted: 11 September 2019 / Published: 18 September 2019
(This article belongs to the Special Issue Information-Theoretical Methods in Data Mining)
Data classification is an important research topic in the field of data mining. With the rapid development in social media sites and IoT devices, data have grown tremendously in volume and complexity, which has resulted in a lot of large and complex high-dimensional data. Classifying such high-dimensional complex data with a large number of classes has been a great challenge for current state-of-the-art methods. This paper presents a novel, hierarchical, gamma mixture model-based unsupervised method for classifying high-dimensional data with a large number of classes. In this method, we first partition the features of the dataset into feature strata by using k-means. Then, a set of subspace data sets is generated from the feature strata by using the stratified subspace sampling method. After that, the GMM Tree algorithm is used to identify the number of clusters and initial clusters in each subspace dataset and passing these initial cluster centers to k-means to generate base subspace clustering results. Then, the subspace clustering result is integrated into an object cluster association (OCA) matrix by using the link-based method. The ensemble clustering result is generated from the OCA matrix by the k-means algorithm with the number of clusters identified by the GMM Tree algorithm. After producing the ensemble clustering result, the dominant class label is assigned to each cluster after computing the purity. A classification is made on the object by computing the distance between the new object and the center of each cluster in the classifier, and the class label of the cluster is assigned to the new object which has the shortest distance. A series of experiments were conducted on twelve synthetic and eight real-world data sets, with different numbers of classes, features, and objects. The experimental results have shown that the new method outperforms other state-of-the-art techniques to classify data in most of the data sets. View Full-Text
Keywords: data mining; unsupervised classification; decision cluster; gamma mixture model; expectation maximization; high-dimensional data; curse of dimensionality data mining; unsupervised classification; decision cluster; gamma mixture model; expectation maximization; high-dimensional data; curse of dimensionality
Show Figures

Figure 1

MDPI and ACS Style

Azhar, M.; Li, M.J.; Zhexue Huang, J. A Hierarchical Gamma Mixture Model-Based Method for Classification of High-Dimensional Data. Entropy 2019, 21, 906.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop