Extension of K-Modes Algorithm for Generating Clusters Automatically

  • Chadha A
  • Kumar S
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

—K-Modes is an eminent algorithm for clustering data set with categorical attributes. This algorithm is famous for its simplicity and speed. The K-Modes is an extension of the K-Means algorithm for categorical data. Since K-Modes is used for categorical data so 'Simple Matching Dissimilarity' measure is used instead of Euclidean distance and the 'Modes' of clusters are used instead of 'Means'. However, one major limitation of this algorithm is dependency on prior input of number of clusters K, and sometimes it becomes practically impossible to correctly estimate the optimum number of clusters in advance. In this paper we have proposed an algorithm which will overcome this limitation while maintaining the simplicity of K-Modes algorithm.

Cite

CITATION STYLE

APA

Chadha, A., & Kumar, S. (2016). Extension of K-Modes Algorithm for Generating Clusters Automatically. International Journal of Information Technology and Computer Science, 8(3), 51–57. https://doi.org/10.5815/ijitcs.2016.03.06

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