A modified Fuzzy k-Partition based on indiscernibility relation for categorical data clustering

被引:17
作者
Yanto, Iwan Tri Riyadi [1 ]
Ismail, Maizatul Akmar [2 ]
Herawan, Tutut [2 ]
机构
[1] Univ Ahmad Dahlan, Dept Informat Syst, Yogyakarta, Indonesia
[2] Univ Malaya, Dept Informat Syst, Kuala Lumpur 50603, Malaysia
关键词
Clustering; Categorical data; Fuzzy k-Partition; Indescernibility relation; ALGORITHM; MODEL;
D O I
10.1016/j.engappai.2016.01.026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Categorical data clustering has been adopted by many scientific communities to classify objects from large databases. In order to classify the objects, Fuzzy k-Partition approach has been proposed for categorical data clustering. However, existing Fuzzy k-Partition approaches suffer from high computational time and low clustering accuracy. Moreover, the parameter maximize of the classification likelihood function in Fuzzy k-Partition approach will always have the same categories, hence producing the same results. To overcome these issues, we propose a modified Fuzzy k-Partition based on indiscernibility relation. The indiscernibility relation induces an approximation space which is constructed by equivalence classes of indiscernible objects, thus it can be applied to classify categorical data. The novelty of the proposed approach is that unlike previous approach that use the likelihood function of multivariate multinomial distributions, the proposed approach is based on indescernibility relation. We performed an extensive theoretical analysis of the proposed approach to show its effectiveness in achieving lower computational complexity. Further, we compared the proposed approach with Fuzzy Centroid and Fuzzy k-Partition approaches in terms of response time and clustering accuracy on several UCI benchmark and real world datasets. The results show that the proposed approach achieves lower response time and higher clustering accuracy as compared to other Fuzzy k-based approaches. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:41 / 52
页数:12
相关论文
共 50 条
[21]   k-ANMI:: A mutual information based clustering algorithm for categorical data [J].
He, Zengyou ;
Xu, Xiaofei ;
Deng, Shengchun .
INFORMATION FUSION, 2008, 9 (02) :223-233
[22]   K-Means Extensions for Clustering Categorical Data [J].
Alwersh, Mohammed ;
Kovacs, Laszlo .
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2023, 14 (09) :492-507
[23]   A k-populations algorithm for clustering categorical data [J].
Kim, DW ;
Lee, K ;
Lee, D ;
Lee, KH .
PATTERN RECOGNITION, 2005, 38 (07) :1131-1134
[24]   Improved Fuzzy Clustering Techniques for Categorical Data [J].
Saha, Indrajit ;
Maulik, Ujjwal .
IAENG TRANSACTIONS ON ENGINEERING TECHNOLOGIES VOL 1, 2009, 1089 :82-+
[25]   Clustering Categorical Data Using a Swarm-based Method [J].
Izakian, Hesam ;
Abraham, Ajith ;
Snasel, Vaclav .
2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009), 2009, :1719-+
[26]   Clustering categorical data based on distance vectors [J].
Zhang, P ;
Wang, XG ;
Song, PXK .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2006, 101 (473) :355-367
[27]   An LSH-based k-representatives clustering method for large categorical data [J].
Mau, Toan Nguyen ;
Huynh, Van-Nam .
NEUROCOMPUTING, 2021, 463 :29-44
[28]   Automated Attribute Weighting Fuzzy k-Centers Algorithm for Categorical Data Clustering [J].
Mau, Toan Nguyen ;
Huynh, Van-Nam .
MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE (MDAI 2021), 2021, 12898 :205-217
[29]   A method for k-means-like clustering of categorical data [J].
Nguyen T.-H.T. ;
Dinh D.-T. ;
Sriboonchitta S. ;
Huynh V.-N. .
Journal of Ambient Intelligence and Humanized Computing, 2023, 14 (11) :15011-15021
[30]   A Global K-modes Algorithm for Clustering Categorical Data [J].
Bai Tian ;
Kulikowski, C. A. ;
Gong Leiguang ;
Yang Bin ;
Huang Lan ;
Zhou Chunguang .
CHINESE JOURNAL OF ELECTRONICS, 2012, 21 (03) :460-465