Categorical Data Clustering: A Bibliometric Analysis and Taxonomy

1Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Numerous real-world applications apply categorical data clustering to find hidden patterns in the data. The K-modes-based algorithm is a popular algorithm for solving common issues in categorical data, from outlier and noise sensitivity to local optima, utilizing metaheuristic methods. Many studies have focused on increasing clustering performance, with new methods now outperforming the traditional K-modes algorithm. It is important to investigate this evolution to help scholars understand how the existing algorithms overcome the common issues of categorical data. Using a research-area-based bibliometric analysis, this study retrieved articles from the Web of Science (WoS) Core Collection published between 2014 and 2023. This study presents a deep analysis of 64 articles to develop a new taxonomy of categorical data clustering algorithms. This study also discusses the potential challenges and opportunities in possible alternative solutions to categorical data clustering.

Cite

CITATION STYLE

APA

Cendana, M., & Kuo, R. J. (2024, June 1). Categorical Data Clustering: A Bibliometric Analysis and Taxonomy. Machine Learning and Knowledge Extraction. Multidisciplinary Digital Publishing Institute (MDPI). https://doi.org/10.3390/make6020047

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free