The DOI matches its Crossref record.
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
Open accessAbstract
In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance andWilliams’ formula which enables the implementation of the algorithm in a recursive way.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
van Dijk, A. I. J. M., Beck, H. E., Crosbie, R. S., de Jeu, R. A. M., Liu, Y. Y., Podger, G. M., Timbal, B., & Viney, N. R. (2013) · Water Resources Research · doi:10.1002/wrcr.20123 · Cited by 1,357
Studer, M. (2013) · Archive ouverte UNIGE (University of Geneva) · doi:10.12682/lives.2296-1658.2013.24 · Cited by 314
Guanine holes are prominent targets for mutation in cancer and inherited disease
Bacolla, A., Temiz, N. A., Yi, M., Ivanic, J., Cer, R. Z., Donohue, D. E., Ball, E. V., Mudunuri, U. S., Wang, G., Jain, A., et al. (2013) · PLoS Genetics · doi:10.1371/journal.pgen.1003816 · Cited by 40
Metadata
- Authors
- Fernández, A., & Gómez, S.
- Venue
- Journal of Classification
- Published
- 2008-06
- Volume
- 25
- Issue
- 1
- Pages
- 43-65
- ISSN
- 0176-4268 (ISSN-L)
- 1432-1343
- OpenAlex
- W2051779798
- Cited by
- 162
- References
- 0
- FWCI
- 6.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms. https://app.cochat.ai/papers/10.1007/s00357-008-9004-x
- The paper
- Fernández, A., & Gómez, S. (2008). Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms. Journal of Classification. https://doi.org/10.1007/s00357-008-9004-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.