mlsanityData to 7 Oct 2026

Deep Descriptive Clustering

arXiv 2105.11549 ↗First posted 24 May 2021cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Recent work on explainable clustering allows describing clusters when the features are interpretable. However, much modern machine learning focuses on complex data such as images, text, and graphs where deep learning is used but the raw features of data are not interpretable. This paper explores a novel setting for performing clustering on complex data while simultaneously generating explanations using interpretable tags. We propose deep descriptive clustering that performs sub-symbolic representation learning on complex data while generating explanations based on symbolic data. We form good clusters by maximizing the mutual information between empirical distribution on the inputs and the induced clustering labels for clustering objectives. We generate explanations by solving an integer linear programming that generates concise and orthogonal descriptions for each cluster. Finally, we allow the explanation to inform better clustering by proposing a novel pairwise loss with self-generated constraints to maximize the clustering and explanation module's consistency. Experimental results on public data demonstrate that our model outperforms competitive baselines in clustering performance while offering high-quality cluster-level explanations.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 10 of its 30 references that are in the map. First posted on arXiv 24 May 2021.

Builds on

10 of 30 references.

References · 10

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  4. 2013A Survey on Multi-view Learningcited by 152
  5. 2020Explainable k-Means and k-Medians Clusteringcited by 67
  6. 2019Doubly Aligned Incomplete Multi-view Clusteringcited by 40
  7. 2017Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorizationcited by 24
  8. 2019A Framework for Deep Constrained Clustering -- Algorithms and Advancescited by 24
  9. 2018Clustering-driven Deep Embedding with Pairwise Constraintscited by 10
  10. 2020Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainabilitycited by 7

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 0; 2024: 3.

5 papers.