EDMD: An Entropy based Dissimilarity measure to cluster Mixed-categorical Data

被引:0
|
作者
Kar, Amit Kumar [1 ]
Akhter, Mohammad Maksood [1 ]
Mishra, Amaresh Chandra [2 ]
Mohanty, Sraban Kumar [1 ]
机构
[1] PDPM Indian Inst Informat Technol Design & Mfg, Comp Sci & Engn, Jabalpur 482005, India
[2] PDPM Indian Inst Informat Technol Design & Mfg, Nat Sci, Jabalpur 482005, India
关键词
Proximity measure; Mixed categorical data; Ordinal attributes; Nominal attributes; Entropy; Dissimilarity measure; ALGORITHM; ATTRIBUTE; DISTANCE;
D O I
10.1016/j.patcog.2024.110674
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The effectiveness of clustering techniques is significantly influenced by proximity measures irrespective of type of data and categorical data is no exception. Most of the existing proximity measures for categorical data assume that all attributes contribute equally to the distance measurement which is not true. Usually, frequency or probability-based approaches are better equipped in principle to counter this issue by appropriately weighting the attributes based on the intra-attribute statistical information. However, owing to the qualitative nature of categorical features, the intra-attribute disorder is not captured effectively by the popularly used continuum form of entropy known as Shannon or information entropy. If the categorical data contains ordinal features, then the problem multiplies because the existing measures treat all attributes as nominal. To address these issues, we propose a new Entropy-based Dissimilarity measure for Mixed categorical Data (EDMD) composed of both nominal and ordinal attributes. EDMD treats both nominal and ordinal attributes separately to capture the intrinsic information from the values of two different attribute types. We apply Boltzmann's definition of entropy, which is based on the principle of counting microstates, to exploit the intra-attribute statistical information of nominal attributes while preserving the order relationships among ordinal values in distance formulation. Additionally, the statistical significance of different attributes of the data towards dissimilarity computation is taken care of through attribute weighting. The proposed measure is free from any user-defined or domain-specific parameters and there is no prior assumption about the distribution of the data sets. Experimental results demonstrate the efficacy of EDMD in terms of cluster quality, accuracy, cluster discrimination ability, and execution time to handle mixed categorical data sets of different characteristics.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] An efficient entropy based dissimilarity measure to cluster categorical data
    Kar, Amit Kumar
    Mishra, Amaresh Chandra
    Mohanty, Sraban Kumar
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 119
  • [2] An association-based dissimilarity measure for categorical data
    Le, SQ
    Ho, TB
    [J]. PATTERN RECOGNITION LETTERS, 2005, 26 (16) : 2549 - 2557
  • [3] Context-Based Geodesic Dissimilarity Measure for Clustering Categorical Data
    Lee, Changki
    Jung, Uk
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (18):
  • [4] An effective dissimilarity measure for clustering of high-dimensional categorical data
    Lee, Jeonghoon
    Lee, Yoon-Joon
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2014, 38 (03) : 743 - 757
  • [5] An effective dissimilarity measure for clustering of high-dimensional categorical data
    Jeonghoon Lee
    Yoon-Joon Lee
    [J]. Knowledge and Information Systems, 2014, 38 : 743 - 757
  • [6] Entropy based clustering of data streams with mixed numeric and categorical values
    Wang, Shuyun
    Fan, Yingjie
    Zhang, Chenghong
    Xu, HeXiang
    Hao, Xiulan
    Hu, Yunfa
    [J]. 7TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE IN CONJUNCTION WITH 2ND IEEE/ACIS INTERNATIONAL WORKSHOP ON E-ACTIVITY, PROCEEDINGS, 2008, : 140 - +
  • [7] Learning-Based Dissimilarity for Clustering Categorical Data
    Rivera Rios, Edgar Jacob
    Angel Medina-Perez, Miguel
    Lazo-Cortes, Manuel S.
    Monroy, Raul
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (08):
  • [8] Graph Enhanced Fuzzy Clustering for Categorical Data Using a Bayesian Dissimilarity Measure
    Zhang, Chuanbin
    Chen, Long
    Zhao, Yin-Ping
    Wang, Yingxu
    Chen, C. L. Philip
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2023, 31 (03) : 810 - 824
  • [9] Data Labeling method based on Cluster Purity using Relative Rough Entropy for Categorical Data Clustering
    Reddy, H. Venkateswara
    Raju, S. Viswanadha
    Agrawal, Pratibha
    [J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2013, : 500 - 506
  • [10] A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
    Thu-Hien Thi Nguyen
    Van-Nam Huynh
    [J]. FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS (FOIKS 2016), 2016, 9616 : 115 - 130