K-Modes clustering algorithm based on a new distance measure

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 47, Issue 10, 2010, Pages 1749-1755

  Liang, Jiye ^a   Bai, Liang ^a   Cao, Fuyuan ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Categorical data; Clustering algorithm; Distance measure; Rough membership degree; Rough set

Indexed keywords

CATEGORICAL ATTRIBUTES; CATEGORICAL DATA; CLUSTERING METHODS; COMPUTATIONALLY EFFICIENT; DISCERNIBILITY; DISSIMILARITY MEASURES; DISTANCE MEASURE; K-MODES; K-MODES ALGORITHM; LARGE DATASETS; NUMBER OF DATUM; PARTITIONAL CLUSTERING; REAL WORLD DATA; ROUGH MEMBERSHIP; ROUGH SET; TIME COMPLEXITY;

ROUGH SET THEORY;

CLUSTERING ALGORITHMS;

EID: 78449234917     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. Han Jiawei, Kamber M. Data Mining Concepts and Techniques[M]. San Francisco: Morgan Kaufmann, 2001.
2. Brendan J F, Delbert D. Clustering by passing messages between data points[J]. Science, 2007, 315(16): 972-976.
3. Zhang Jiangshe, Liang Yi, Xu Zongben. Clustering methods by simulating visual systems[J]. Chinese Journal of Computers, 2001, 24(5): 496-501 (in Chinese).
4. Zhang Jiangshe, Liang Yiuwing. Improved possibilistic c-means clustering algorithms[J]. IEEE Trans on Fuzzy Systems, 2004, 12(2): 209-217.
5. Yu Jian. On the fuzziness index of the FCM algorithms[J]. Chinese Journal of Computers, 2003, 26(8): 968-973 (in Chinese).
6. Chen Zonghai, Wen Feng, Nie Jianbin, et al. A reinforcement learning method based on node-growing K-means clustering algorithm[J]. Journal of Computer Research and Development, 2006, 43(4): 661-666.
7. Mac Q J. Some methods for classification and analysis of multivariate observation[C]//Proc of the 5th Berkley Symp on Mathematical Statistics and Probability. Berkley, California: University of California Press, 1967: 281-297.
8. Huang Zhexue. Clustering large data sets with mixed numeric and categorical values[C]//Proc of PAKDD'97. Singapore: World Scientific, 1997: 21-35.
9. Huang Zhexue. Extensions to the K-means algorithm for clustering large data sets with categorical values[J]. Data Mining and Knowledge Discovery, 1998, 2(3): 283-304.
10. Ng M K, Li Junjie, Huang Zhexue, et al. On the impact of dissimilarity measure in K-modes clustering algorithm[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2007, 29(3): 503-507.
11. San O M, Huynh V N, Nakamori Y. An alternative extension of the K-means algorithm for clustering categorical data[J]. Int Journal Application Mathematic and Computer Science, 2004, 14(2): 241-247.
12. Li Cen, Biswas G. Unsupervised learning with mixed numeric and nominal data[J]. IEEE Trans on Knowledge and Data Engineering, 2002, 14(4): 673-690.
13. Hsu Chungchian, Chen Chinlong, Su Yuwei. Hierarchical clustering of mixed data based on distance hierarchy[J]. Information Sciences, 2007, 177(20): 4474-4492.
14. Hsu Chungchian. Generalizing self-organizing map for categorical data[J]. IEEE Trans on Neural Network, 2006, 17(2): 294-304.
15. Ganti V, Gehrke J, Ramakrishnan R. CACTUS, clustering categorical data using summaries[C]//Proc of the 5th Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 1999: 73-83.
16. Ahamad A, Dey L. A K-mean clustering algorithm for mixed numeric and categorical data[J]. Data and Knowledge Engineering, 2007, 63(2): 503-527.
17. Ahamad A, Dey L. A method to compute distance between two categorical values of same attribute in unsupervised learning for categorical data set[J]. Pattern Recognition Letters, 2007, 28(1): 110-118.
18. Pawlak Z. Rough Sets-Theoretical Aspects of Reasoning About Data[M]. London: Kluwer Academic Publishers, 1991.
19. Zhang Wenxiu, Wu Weizhi, Liang Jiye, et al. Rough Set Theory and Approach[M]. Beijing: Science Press, 2001 (in Chinese).
20. Liang Jiye, Li Deyu. Uncertainty and Knowledge Acquisition in Information Systems[M]. Beijing: Science Press, 2005 (in Chinese).
21. Liang Jiye, Shi Zhongzhi, Li Deyu, et al. Information entropy, rough entropy and knowledge granulation in incomplete information systems[J]. Int Journal of General Systems, 2006, 35(6): 641-654.
22. Qian Yuhua, Liang Jiye, Li Deyu, et al. Measures for evaluating the decision performance of a decision table in rough set theory[J]. Information Sciences, 2008, 178(1): 181-202.
23. Parmar D, Wu T, Blackhurst J. MMR: An algorithm for clustering categorical data using rough set theory[J]. Data and Knowledge Engineering, 2007, 63(3): 879-893.
24. Chen Chunbao, Wang Liya. Rough set-based clustering with refinement using Shannon's entropy theory[J]. Computer and Mathematics with Application, 2006, 52(10/11): 1563-1576.
25. Kumar P, Krishna P R, Bapi R S, et al. Rough clustering of sequential data[J]. Data and Knowledge Engineering, 2007, 63(2): 183-199.
26. Jiang Feng, Sui Yuefei, Cao Cungen. A rough set approach to outlier detection[J]. Int Journal of General Systems, 2008, 37(5): 519-536.
27. An Qiusheng, Shen Junyi, Wang Guoyin. A clustering method based on information granularity and rough sets[J]. Pattern Recognition and Artificial Intelligence, 2003, 16(4): 412-417 (in Chinese).
28. Yang Yiming. An evaluation of statistical approaches to text categorization[J]. Journal of Information Retrieval, 1999, 1(1/2): 67-88.