A Global-Relationship Dissimilarity Measure for the k -Modes Clustering Algorithm

17Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The k-modes clustering algorithm has been widely used to cluster categorical data. In this paper, we firstly analyzed the k-modes algorithm and its dissimilarity measure. Based on this, we then proposed a novel dissimilarity measure, which is named as GRD. GRD considers not only the relationships between the object and all cluster modes but also the differences of different attributes. Finally the experiments were made on four real data sets from UCI. And the corresponding results show that GRD achieves better performance than two existing dissimilarity measures used in k-modes and Cao's algorithms.

Cite

CITATION STYLE

APA

Zhou, H., Zhang, Y., & Liu, Y. (2017). A Global-Relationship Dissimilarity Measure for the k -Modes Clustering Algorithm. Computational Intelligence and Neuroscience, 2017. https://doi.org/10.1155/2017/3691316

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