General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Cecilia Xie
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • APC: 800 USD
    • E-mail: editor@ijcte.org
    • Journal Metrics:
    • SCImago Journal & Country Rank
Article Metrics in Dimensions

IJCTE 2010 Vol.2(3): 431-435 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2010.V2.181

Extended K-Modes with Probability Measure

Aranganayagi S. and Thangavel K.

Abstract—Clustering Categorical data is more complicated process than numerical clustering. In this paper the traditional K-Modes algorithm is extended with the weighted measure based on the probability of respective matching attribute value in the data set. The proposed method is experimented with the data sets obtained from UCI data repository. Results prove that the proposed weighted measure is superior to K-Modes.

Index Terms—Clustering, Categorical Data, K-Modes, Probability, Weighted measure

Aranganayagi S. is with the J. K. K. Nataraja College of Arts & Science, Komarapalayam, Tamilnadu, India and doing research in the Department of Computer Science and Applications, Gandhigram Rural University, Gandhigram Tamilnadu India. Member of IAENG, IACSIT: Corresponding author, phone: 0424-2230855, 9842723085; e-mail: arangbas@gmail.com.
Dr. K. Thangavel is with the Periyar University, Salem, Tamilnadu, Indiaas Professor in Computer Science. (drktvelu@yahoo.com).

[PDF]

Cite: Aranganayagi S. and Thangavel K., "Extended K-Modes with Probability Measure," International Journal of Computer Theory and Engineering vol. 2, no. 3, pp. 431-435, 2010.


Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.