Cart (Loading....) | Create Account
Close category search window
 

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
$31 $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)
Aranganayagi, S. ; J.K.K. Nataraja Coll. of Arts & Sci., Komarapalayam, India ; Thangavel, K. ; Sujatha, S.

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:

Advanced Computing, 2009. ICAC 2009. First International Conference on

Date of Conference:

13-15 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.