Clustering High-dimensional Data: Balancing Abstraction and Representation Tutorial at AAAI 2026

• URL: http://arxiv.org/abs/2601.11160v1
• Date: Fri, 16 Jan 2026 10:22:25 GMT
• Title: Clustering High-dimensional Data: Balancing Abstraction and Representation Tutorial at AAAI 2026
• Authors: Claudia Plant, Lena G. M. Bauer, Christian Böhm,
• Abstract summary: Clustering requires a balance between abstraction and representation.<n>We will see how approaches to subspace and deep clustering support high-dimensional and complex data.<n>We will see how current deep clustering methods define and enforce abstraction through centroid-based and density-based clustering losses.
• Score: 9.517609965245818
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: How to find a natural grouping of a large real data set? Clustering requires a balance between abstraction and representation. To identify clusters, we need to abstract from superfluous details of individual objects. But we also need a rich representation that emphasizes the key features shared by groups of objects that distinguish them from other groups of objects. Each clustering algorithm implements a different trade-off between abstraction and representation. Classical K-means implements a high level of abstraction - details are simply averaged out - combined with a very simple representation - all clusters are Gaussians in the original data space. We will see how approaches to subspace and deep clustering support high-dimensional and complex data by allowing richer representations. However, with increasing representational expressiveness comes the need to explicitly enforce abstraction in the objective function to ensure that the resulting method performs clustering and not just representation learning. We will see how current deep clustering methods define and enforce abstraction through centroid-based and density-based clustering losses. Balancing the conflicting goals of abstraction and representation is challenging. Ideas from subspace clustering help by learning one latent space for the information that is relevant to clustering and another latent space to capture all other information in the data. The tutorial ends with an outlook on future research in clustering. Future methods will more adaptively balance abstraction and representation to improve performance, energy efficiency and interpretability. By automatically finding the sweet spot between abstraction and representation, the human brain is very good at clustering and other related tasks such as single-shot learning. So, there is still much room for improvement.

Related papers

• Cluster Specific Representation Learning [1.6727186769396276]
  Despite its widespread application, there is no established definition of a good'' representation.<n>We propose a downstream-agnostic formulation: when inherent clusters exist in the data, the representations should be specific to each cluster.<n>Under this idea, we develop a meta-algorithm that jointly learns cluster-specific representations and cluster assignments.
  arXiv  Detail & Related papers  (2024-12-04T16:59:37Z)
• Categorical Data Clustering via Value Order Estimated Distance Metric Learning [53.28598689867732]
  This paper introduces a novel order distance metric learning approach to intuitively represent categorical attribute values.<n>A new joint learning paradigm is developed to alternatively perform clustering and order distance metric learning.<n>The proposed method achieves superior clustering accuracy on categorical and mixed datasets.
  arXiv  Detail & Related papers  (2024-11-19T08:23:25Z)
• Deep Structure and Attention Aware Subspace Clustering [29.967881186297582]
  We propose a novel Deep Structure and Attention aware Subspace Clustering (DSASC) We use a vision transformer to extract features, and the extracted features are divided into two parts, structure features, and content features. Our method significantly outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-12-25T01:19:47Z)
• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Clustering Plotted Data by Image Segmentation [12.443102864446223]
  Clustering algorithms are one of the main analytical methods to detect patterns in unlabeled data. In this paper, we present a wholly different way of clustering points in 2-dimensional space, inspired by how humans cluster data. Our approach, Visual Clustering, has several advantages over traditional clustering algorithms.
  arXiv  Detail & Related papers  (2021-10-06T06:19:30Z)
• Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
  We propose a novel framework for image clustering that incorporates joint representation learning and clustering. Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
  arXiv  Detail & Related papers  (2021-07-24T15:36:49Z)
• Deep Visual Attention-Based Transfer Clustering [2.248500763940652]
  Clustering can be considered as the most important unsupervised learning problem. Image clustering is a crucial but challenging task in the domain machine learning and computer vision. This paper is the improvement of the existing deep transfer clustering for less variant data distribution.
  arXiv  Detail & Related papers  (2021-07-06T06:26:15Z)
• Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering [16.60975509085194]
  We propose a graph filtering approach by which a smooth representation is achieved. Experiments on image and document clustering datasets demonstrate that our method improves upon state-of-the-art subspace clustering techniques. An ablation study shows that graph filtering can remove noise, preserve structure in the image, and increase the separability of classes.
  arXiv  Detail & Related papers  (2021-06-18T02:21:36Z)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.