Gauging-: A Non-Parametric Hierarchical Clustering Algorithm
The development of a nonparametric and versatile clustering algorithm has been a longstanding challenge in unsupervised learning due to the exploratory nature of the clustering problem. This study presents a novel algorithm, named Gauging-, which can handle diverse cluster shapes and operate in a no...
Uloženo v:
| Vydáno v: | IEEE transactions on pattern analysis and machine intelligence Ročník 47; číslo 6; s. 4897 - 4907 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.06.2025
|
| ISSN: | 0162-8828, 1939-3539, 2160-9292, 1939-3539 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The development of a nonparametric and versatile clustering algorithm has been a longstanding challenge in unsupervised learning due to the exploratory nature of the clustering problem. This study presents a novel algorithm, named Gauging-, which can handle diverse cluster shapes and operate in a nonparametric manner. The algorithm employs a hierarchical merging process that starts from individual data points until no further clusters can be merged. The central component of Gauging- is the adaptive mergeability function, which progressively determines if two clusters are mergeable considering the perceptual statistics of the clusters and their environment. Empirical evaluations on 105 synthetic datasets demonstrate the superiority of the proposed algorithm, particularly in accurately handling well-separated clusters. Experiments on real-world datasets highlight the impact of selecting appropriate data features and distance metrics on clustering results. The source code is available at https://github.com/design-zeng/Gauging-delta.The development of a nonparametric and versatile clustering algorithm has been a longstanding challenge in unsupervised learning due to the exploratory nature of the clustering problem. This study presents a novel algorithm, named Gauging-, which can handle diverse cluster shapes and operate in a nonparametric manner. The algorithm employs a hierarchical merging process that starts from individual data points until no further clusters can be merged. The central component of Gauging- is the adaptive mergeability function, which progressively determines if two clusters are mergeable considering the perceptual statistics of the clusters and their environment. Empirical evaluations on 105 synthetic datasets demonstrate the superiority of the proposed algorithm, particularly in accurately handling well-separated clusters. Experiments on real-world datasets highlight the impact of selecting appropriate data features and distance metrics on clustering results. The source code is available at https://github.com/design-zeng/Gauging-delta. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0162-8828 1939-3539 2160-9292 1939-3539 |
| DOI: | 10.1109/TPAMI.2025.3545573 |