By Topic

New distance measure based on the domain for categorical data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Aranganayagi ; J.K.K.Nataraja College of Arts & Science, Komarapalayam- 638 183, Tamil Nadu, India ; K. Thangavel ; S. Sujatha

Clustering the process of grouping homogeneous objects is an important data mining process. Few algorithms exist to cluster categorical data. K-modes is the scalable and efficient algorithm to cluster the categorical data. In this paper we propose a new distance measure for K-modes based on the cardinality of domain of attribute. The proposed method is experimented with data sets obtained from UCI data repository. Results prove that the proposed measure generates better clusters than the K-modes algorithm.

Published in:

2009 First International Conference on Advanced Computing

Date of Conference:

13-15 Dec. 2009