Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Learning Order Forest for Qualitative-Attribute Data Clustering

About

Clustering is a fundamental approach to understanding data patterns, wherein the intuitive Euclidean distance space is commonly adopted. However, this is not the case for implicit cluster distributions reflected by qualitative attribute values, e.g., the nominal values of attributes like symptoms, marital status, etc. This paper, therefore, discovered a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values. That is, treating a value as the vertex of the tree allows to capture rich order relationships among the vertex value and the others. To obtain the trees in a clustering-friendly form, a joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters. It turns out that the latent distance space of the whole dataset can be well-represented by a forest consisting of the learned trees. Extensive experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results. Comparisons of 10 counterparts on 12 real benchmark datasets with significance tests verify the superiority of the proposed method.

Mingjie Zhao, Sen Feng, Yiqun Zhang, Mengke Li, Yang Lu, Yiu-ming Cheung• 2026

Related benchmarks

TaskDatasetResultRank
ClusteringAC
ARI0.4462
27
ClusteringSB
ARI0.9562
23
ClusteringDS
ARI29.01
23
ClusteringAC
Cluster Accuracy (CA)83.07
23
ClusteringSB
Clustering Accuracy97.23
23
ClusteringHR
ARI0.0429
23
ClusteringHR
CA45.3
23
ClusteringDS
Clustering Accuracy (CA)76.17
23
ClusteringHF
ARI0.0717
23
ClusteringHF
Clustering Accuracy (CA)62.84
23
Showing 10 of 42 rows

Other info

Follow for update