Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/9005
DC FieldValueLanguage
dc.contributor.authorDr. AZHAR Muhammaden_US
dc.contributor.authorLi, Mark Junjieen_US
dc.contributor.authorHuang, Joshua Zhexueen_US
dc.date.accessioned2024-03-13T03:21:36Z-
dc.date.available2024-03-13T03:21:36Z-
dc.date.issued2019-
dc.identifier.citationEntropy, 2019, vol. 21(9).en_US
dc.identifier.issn1099-4300-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/9005-
dc.description.abstractData 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.en_US
dc.language.isoenen_US
dc.relation.ispartofEntropyen_US
dc.titleA hierarchical gamma mixture model-based method for classification of high-dimensionals dataen_US
dc.typePeer Reviewed Journal Articleen_US
dc.identifier.doihttps://doi.org/10.3390/e21090906-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Applied Data Science - Publication
Show simple item record

Page view(s)

22
Last Week
0
Last month
checked on Dec 20, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.