REVIEW 2 cited by
Interpretable Deep Clustering for Tabular Data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Clustering is a fundamental learning task widely used as a first step in data analysis. For example, biologists use cluster assignments to analyze genome sequences, medical records, or images. Since downstream analysis is typically performed at the cluster level, practitioners seek reliable and interpretable clustering models. We propose a new deep-learning framework for general domain tabular data that predicts interpretable cluster assignments at the instance and cluster levels. First, we present a self-supervised procedure to identify the subset of the most informative features from each data point. Then, we design a model that predicts cluster assignments and a gate matrix that provides cluster-level feature selection. Overall, our model provides cluster assignments with an indication of the driving feature for each sample and each cluster. We show that the proposed method can reliably predict cluster assignments in biological, text, image, and physics tabular datasets. Furthermore, using previously proposed metrics, we verify that our model leads to interpretable results at a sample and cluster level. Our code is available at https://github.com/jsvir/idc.
Forward citations
Cited by 2 Pith papers
-
Ensemble of Unsupervised Deep Learning for Clustering Imbalanced Tabular Data
Ensemble variants of deep clustering methods (embedding-averaging and majority voting) achieve the best average ACC, NMI, and ARI on 16 imbalanced binary tabular datasets.
-
Interpretable Clustering Ensemble
ICE builds an interpretable decision tree for clustering ensemble by splitting on original features to maximize summed chi-squared agreement with base k-means partitions.
Discussion (0). Continue with ORCID to comment.