4.7 Article

A categorical data clustering framework on graph representation

期刊

PATTERN RECOGNITION
卷 128, 期 -, 页码 -

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2022.108694

关键词

Cluster analysis; Categorical data clustering; Data representation; Graph embedding

资金

  1. National Key Research and Development Program of China [2020AAA0106100]
  2. National Natural Science Foun-dation of China [62022052]
  3. Technology Research Develop-ment Projects of Shanxi [201901D211192]

向作者/读者索取更多资源

This paper introduces a graph-based framework for clustering categorical data. The proposed method learns the representation of categorical values from their similar graph to provide similar representations for similar categorical values. Experimental results demonstrate the effectiveness of the framework compared to other methods.
Clustering categorical data is an important task of machine learning, since the type of data widely exists in real world. However, the lack of an inherent order on the domains of categorical features prevents most of classical clustering algorithms from being directly applied for the type of data. Therefore, it is very key issue to learn an appropriate representation of categorical data for the clustering task. In order to address this issue, we develop a categorical data clustering framework based on graph representation. In this framework, a graph-based representation method for categorical data is proposed, which learns the representation of categorical values from their similar graph to provide similar representations for similar categorical values. We compared the proposed framework with other representation methods for categorical data clustering on benchmark data sets. The experiment results illustrate the proposed frame-work is very effective, compared to other methods. (c) 2022 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据