activity
20242026
collaborators

5 papers

cs.LG2026

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

Claudia Plant, Lena G. M. Bauer, Christian Böhm

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 superf…

cs.CV2025

Bootstrap Deep Spectral Clustering with Optimal Transport

Wengang Guo, Wei Ye, Chunchun Chen +4

Spectral clustering is a leading clustering method. Two of its major shortcomings are the disjoint optimization process and the limited representation capacity. To address these is…

cs.LG2025

An Introductory Survey to Autoencoder-based Deep Clustering -- Sandboxes for Combining Clustering with Deep Learning

Collin Leiber, Lukas Miklautz, Claudia Plant +1

Autoencoders offer a general way of learning low-dimensional, non-linear representations from data without labels. This is achieved without making any particular assumptions about…

cs.LG2025

Extension of the Dip-test Repertoire -- Efficient and Differentiable p-value Calculation for Clustering

Lena G. M. Bauer, Collin Leiber, Christian Böhm +1

Over the last decade, the Dip-test of unimodality has gained increasing interest in the data mining community as it is a parameter-free statistical test that reliably rates the mod…

cs.LG2024

SHADE: Deep Density-based Clustering

Anna Beer, Pascal Weber, Lukas Miklautz +4

Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analys…