Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.20954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915813994266624 |
|---|---|
| author | Owsiński, Jan W. |
| author_facet | Owsiński, Jan W. |
| contents | The paper outlines the principles of construction of a broad class of hierarchical aggregation algorithms of cluster analysis, essentially based on minimum distance mergers, which are derived from the general bi-partial objective function. It is shown how the algorithms arise from the bi-partial objective function, their affinity with the classical hierarchical aggregation algorithms is demonstrated, and the examples of such algorithms for the concrete forms of the bi-partial objective function are provided. This amounts to the first explicit and, at the same time, quite general, connection between optimization in clustering and the hierarchical aggregation algorithms. Thereby, the respective hierarchical algorithms gain a deeper justification, the means for evaluating the quality of clustering is provided, along with the criterion of stopping the cluster mergers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_20954 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Hierarchical Aggregation Clustering Algorithms Derived from the Bi-partial Objective Function Owsiński, Jan W. Other Statistics 62H30 E.1; G.3; I.5 The paper outlines the principles of construction of a broad class of hierarchical aggregation algorithms of cluster analysis, essentially based on minimum distance mergers, which are derived from the general bi-partial objective function. It is shown how the algorithms arise from the bi-partial objective function, their affinity with the classical hierarchical aggregation algorithms is demonstrated, and the examples of such algorithms for the concrete forms of the bi-partial objective function are provided. This amounts to the first explicit and, at the same time, quite general, connection between optimization in clustering and the hierarchical aggregation algorithms. Thereby, the respective hierarchical algorithms gain a deeper justification, the means for evaluating the quality of clustering is provided, along with the criterion of stopping the cluster mergers. |
| title | Hierarchical Aggregation Clustering Algorithms Derived from the Bi-partial Objective Function |
| topic | Other Statistics 62H30 E.1; G.3; I.5 |
| url | https://arxiv.org/abs/2602.20954 |