Collin Leiber

Collin Leiber

Auto-generated profile, based on publicly available information

Collin Leiber

Database Systems and Data Mining LMU Munich Munich Germany

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 October 2025 in Energy and Buildings
Verified
Journal Article
Open access
Hatef HajianHatef Hajian
Hatef Hajian
CLCollin Leiber
Collin Leiber
KHKalevi Härkönen
Kalevi Härkönen
HMHeikki Mannila
Heikki Mannila
Andrea FerrantelliAndrea Ferrantelli
Andrea Ferrantelli

8 October 2024 in arXiv
Verified
Preprint
Open access
PDF file
ABAnna Beer
Anna Beer
PWPascal Weber
Pascal Weber
LMLukas Miklautz
Lukas Miklautz
CLCollin Leiber
Collin Leiber
WDWalid Durani
Walid Durani
Claudia PlantClaudia Plant
Claudia Plant
Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analysis with Density-based Exploration), the first deep clustering algorithm that incorporates density-connectivity into its loss function. Similar to existing deep clustering algorithms, SHADE supports high-dimensional and large data sets with the expressive power of a deep autoencoder. In contrast to most existing deep clustering methods that rely on a centroid-based clustering objective, SHADE incorporates a novel loss function that captures density-connectivity. SHADE thereby learns a representation that enhances the separation of density-connected clusters. SHADE detects a stable clustering and noise points fully automatically without any user input. It outperforms existing methods in clustering quality, especially on data that contain non-Gaussian clusters, such as video data. Moreover, the embedded space of SHADE is suitable for visualization and interpretation of the clustering results as the individual shapes of the clusters are preserved.

21 October 2023
Verified
Conference Paper
Open access
CLCollin Leiber
Collin Leiber
LMLukas Miklautz
Lukas Miklautz
Claudia PlantClaudia Plant
Claudia Plant
CBChristian Böhm
Christian Böhm
Deep clustering algorithms have gained popularity for clustering complex, large-scale data sets, but getting started is difficult because of numerous decisions regarding architecture, optimizer, and other hyperparameters. Theoretical foundations must be known to obtain meaningful results. At the same time, ease of use is necessary to get used by a broader audience. Therefore, we require a unified framework that allows for easy execution in diverse settings. While this applies to established clustering methods like k-Means and DBSCAN, deep clustering algorithms lack a standard structure, resulting in significant programming overhead. This complicates empirical evaluations, which are essential in both scientific and practical applications. We present a solution to this problem by providing a theoretical background on deep clustering as well as practical implementation techniques and a unified structure with predefined neural networks. For the latter, we use the Python package ClustPy. The aim is to share best practices and facilitate community participation in deep clustering research.