Distance Metric of Categorical Data Based on Graph Structure

Zheng Li-ping; Deng Xiu-qin; Zhang Yi-qun

doi:10.12052/gdutxb.220051

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

Distance Metric of Categorical Data Based on Graph Structure

更新时间：2026-05-27

- Distance Metric of Categorical Data Based on Graph Structure
- Vol. 40, Issue 4, Pages: 109-116(2023)
- 作者机构：
  
  1. 广东工业大学数学与统计学院,广东,广州,510520
  2. 广东工业大学计算机学院,广东,广州,510006
- 作者简介：
- 基金信息：
- DOI：10.12052/gdutxb.220051
  CLC： TP311.13
- Online First：25 July 2023，
  
  Published：2023
- 稿件说明：
移动端阅览
郑丽苹, 邓秀勤, 张逸群. 基于图结构的分类数据距离度量[J]. 广东工业大学学报, 2023, 40(4): 109-116.

Zheng Li-ping, Deng Xiu-qin, Zhang Yi-qun. Distance Metric of Categorical Data Based on Graph Structure[J]. 2023, 40(4): 109-116.
郑丽苹, 邓秀勤, 张逸群. 基于图结构的分类数据距离度量[J]. 广东工业大学学报, 2023, 40(4): 109-116. DOI： 10.12052/gdutxb.220051.

Zheng Li-ping, Deng Xiu-qin, Zhang Yi-qun. Distance Metric of Categorical Data Based on Graph Structure[J]. 2023, 40(4): 109-116. DOI： 10.12052/gdutxb.220051.

摘要

针对现有的大多数分类数据的度量方法效果不佳的问题，本文提出了一种基于有序属性和标称属性图结构的分类数据距离度量方法(New Distance Metric，NewDM) 。首先总结了分类数据距离定义的基本框架公式并分析度量该类型数据的挑战，然后利用不同属性的图结构定义了2个概率分布列距离，紧接着联立权重给出了分类数据的距离度量新方法，最后在6个公开数据集上进行实验，结果表明本文提出的NewDM度量性能优于其他度量方法。

Abstract

This paper proposes a new distance metric (NewDM) of categorical data based on the graph structure of ordinal and nominal attributes to address the poor effect of most existing measurement methods for categorical data. In NewDM

it first summarizes the basic framework formula of distance definition of categorical data and analyzes the challenges of measuring categorical data. Then

the graph structures of ordinal attributes and nominal ones are utilized to define the distance between two probability distribution columns. Finally

a new distance metric of categorical data is obtained through simultaneous weight. Experimental results on six public datasets show that the proposed NewDM is superior to the state-of-the-art approaches.

关键词

Keywords

references

SONG S, SUN Y, ZHANG A, et al . Enriching data imputation under similarity rule constraints [J ] . IEEE Transactions on Knowledge and Data Engineering, 2020, 32(2): 275-287.

ALABDULMOHSIN I, CISSE M, GAO X, et al . Large margin classification with indefinite similarities [J ] . Machine Learning, 2016, 103(2): 215-237.

ZHANG W, ZHANG Z B. Joint graph embedding and feature weighting for unsupervised feature selection [J]. Journal of Guangdong University of Technology, 2021, 38(5): 16-23.

ZENG S, WANG X, DUAN X, et al . Kernelized mahalanobis distance for fuzzy clustering [J ] . IEEE Transactions on Fuzzy Systems, 2021, 29(10): 3103-3117.

AGRESTI A. An introduction to categorical data analysis[M]. New York: John Wiley Sons, 2018.

HAMMING R W. Error detecting and error correcting codes [J]. Bell Labs Technical Journal, 2014, 29(2): 147-160.

AHMAD 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.

IENCO D, PENSA R G, MEO R. Context-based distance learning for categorical data clustering[C]//Advances in Intelligent Data Analysis VIII: 8th International Symposium on Intelligent Data Analysis. Lyon: Springer, 2009: 83-94.

IENCO D, PENSA R G, MEO R. From context to distance: learning dissimilarity for categorical data clustering [J]. ACM Transactions on Knowledge Discovery from Data, 2012, 6(1): 1-25.

JIA H, CHEUNG Y, LIU J. A new distance metric for unsupervised learning of categorical data [J]. IEEE Transactions on Neural Networks Learning Systems, 2015, 27(5): 1065-1079.

CHEN L, WANG S, WANG K, et al . Soft subspace clustering of categorical data with probabilistic distance [J ] . Pattern Recognition, 2016, 51(3): 322-332.

JIAN S, CAO L, LU K, et al . Unsupervised coupled metric similarity for non-iid categorical data [J ] . IEEE Transactions on Knowledge and Data Engineering, 2018, 30(9): 1810-1823.

AGRESTI A. Analysis of ordinal categorical data[M]. New York: John Wiley Sons, 2010.

ZHANG Y, CHEUNG Y. An ordinal data clustering algorithm with automated distance learning[C]//Proceedings of the AAAI Conference on Artificial Intelligence. New York: AAAI Press, 2020: 6869-6876.

LIN Q, TANG J S. Clustering algorithm for mixed categorical data [J]. Computer Engineering and Applications, 2019, 55(1): 168-173.

ZHANG Y, CHEUNG Y M, TAN K C. A unified entropy-based distance metric for ordinal-and-nominal-attribute data clustering [J]. IEEE Transactions on Neural Networks and Learning Systems, 2019, 31(1): 39-52.

ZHANG Y, CHEUNG Y M. A new distance metric exploiting heterogeneous interattribute relationship for ordinal-and-nominal-attribute data clustering [J]. IEEE Transactions on Cybernetics, 2022, 52(2): 758-771.

ZHANG Y, CHEUNG Y M, ZHANG Y, et al . Learnable weighting of intra-attribute distances for categorical data clustering with nominal and ordinal attributes [J ] . IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021, 44(7): 3560-3576.

WEST D B. Introduction to graph theory[M]. Upper Saddle River: Prentice hall, 2001.

CHAKRABORTY M, CHOWDHURY S, CHAKRABORTY J, et al . Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review [J ] . Complex Intelligent Systems, 2019, 5(3): 265-281.

DEVRIENDT K, VAN M P. The simplex geometry of graphs [J]. Journal of Complex Networks, 2019, 7(4): 469-490.

CAI D, ZHANG C, HE X. Unsupervised feature selection for multi-cluster data[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: Association for Computing Machinery, 2010: 333-342.

SANTOS J M, EMBRECHTS M. On the use of the adjusted rand index as a metric for evaluating supervised classification[C]//Artificial Neural Networks–ICANN 2009: 19th International Conference. Cyprus: Springer, 2009: 175-184.

ESTÉVEZ P A, TESMER M, PEREZ C A, et al . Normalized mutual information feature selection [J ] . IEEE Transactions on Neural Networks, 2009, 20(2): 189-201.

HUANG Z. 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.

JING L, NG M K, HUANG J Z. An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data [J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(8): 1026-1041.

JIA H, CHEUNG Y M. Subspace clustering of categorical and numerical data with an unknown number of clusters [J]. IEEE Transactions on Neural Networks and Learning Systems, 2017, 29(8): 3308-3325.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Multi-Scale Contrastive Embedding Enhanced Adaptive Intrusion Detection Model

A Resource Allocation Optimization Method for Multi-UAV Integrated Sensing, Computing, and Communication Towards Disaster Relief

Efficient Temporal Modeling for RGB-T Tracking

Research on Foreign Object Detection in Power Transmission Lines Based on the AAGV-YOLOX Model

Robust Design for Artificial Noise-assisted UAV Terahertz Secure Communication

Related Author

No data

Related Institution

No data

AI问答

⁰