Abstract
Hierarchical clustering techniques can reveal nested structures within data by representing patterns in a tree-like form. However, when dealing with complex data, many traditional hierarchical methods produce cluttered and hard-to-interpret trees. To address this, we propose a novel hierarchical clustering method called Discovery of Multi-Density Hierarchical Cluster structures (DMDHC), which introduces a new type of cluster tree to represent hierarchical information more effectively. Our approach automatically generates hierarchical local cuts along the tree structure. In contrast to state-of-the-art methods like PEARCH, which typically apply only a single cut across the hierarchy, DMDHC takes advantage of density-based insights to perform multiple cuts at different levels. This results in a more compact and comprehensible representation of intricate hierarchical structures. Extensive experiments on real-world datasets demonstrate that DMDHC, along with its newly introduced tree structure, outperforms existing methods.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2025 SIAM International Conference on Data Mining (SDM) |
| Editors | Vagelis Papalexakis, Matteo Riondato, Elena Zheleva, Tim Weninger, Wei Ding |
| Publisher | Society for Industrial and Applied Mathematics |
| Pages | 261-269 |
| Number of pages | 9 |
| ISBN (Electronic) | 978-1-61197-852-0 |
| DOIs | |
| Publication status | Published - 2025 |
Austrian Fields of Science 2012
- 102033 Data mining
Fingerprint
Dive into the research topics of 'DMDHC: Discovery of Multi-Density Hierarchical Cluster Structures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver