Proefschrift

Exploring graph-based clustering and outlier detection algorithms

In the era of big data, extracting insights from complex datasets is a key challenge. This thesis demonstrates the superiority of graph-based methods over traditional clustering (e.g., k-means, DBSCAN) and outlier detection for analyzing high-dimensional and noisy data.

Auteur

J. Li

Datum

12 november 2025

Links

Thesis in Leiden Repository

We show that Minimum Spanning Tree (MST) and spectral techniques excel at identifying irregularly shaped clusters and hierarchical structures missed by other approaches.

For outlier detection, we introduce novel methods like Spectral Analysis Outlier Detection (SAOD) and Adaptive Mini-MST Outlier Detection (MMOD). These leverage graph structures and local density scaling to effectively identify contextual anomalies without prior assumptions, proving highly effective in domains like healthcare and cybersecurity. Collectively, this research establishes graph-based analysis as a flexible and powerful framework, bridging theoretical innovation with practical application for modern data challenges.

• cluster-based outlier detection
• graph-based clustering