Learning Order Forest for Qualitative-Attribute Data Clustering
Mingjie Zhao, Sen Feng, Yiqun Zhang, Mengke Li, Yang Lu, Yiu-ming Cheung

TL;DR
This paper introduces a novel clustering method for qualitative data using a learned forest of trees to model local order relationships, improving clustering accuracy on benchmark datasets.
Contribution
It proposes a joint learning mechanism to iteratively learn tree structures and clusters, effectively capturing qualitative attribute relationships.
Findings
Outperforms 10 baseline methods on 12 datasets
Accurately models local order relationships among qualitative values
Demonstrates statistical significance in improvements
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Data Mining Algorithms and Applications · Face and Expression Recognition
