The DOI matches its Crossref record.
Minimum Spanning Trees and Single Linkage Cluster Analysis
Open accessAbstract
Minimum spanning trees (MST) and single linkage cluster analysis (SLCA) are explained and it is shown that all the information required for the SLCA of a set of points is contained in their MST.Known algorithms for finding the MST are discussed.They are efficient even when there are very many points; this makes a SLCA practicable when other methods of cluster analysis are not.The relevant computing procedures are published in the Algorithm section of the same issue of Applied Statistics.The use of the MST in the interpretation of vector diagrams arising in multivariate analysis is illustrated by an example.
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
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
Rammal, R., Toulouse, G., & Virasoro, M. A. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.765 · Cited by 756
Nielsen, F. (2016) · Undergraduate Topics in Computer Science · doi:10.1007/978-3-319-21903-5_8 · Cited by 494
Disparity as an evolutionary index: a comparison of Cambrian and Recent arthropods
Wills, M. A., Briggs, D. E. G., & Fortey, R. A. (1994) · Paleobiology · doi:10.1017/s009483730001263x · Cited by 349
Towards Automated Log Parsing for Large-Scale Log Data Analysis
He, P., Zhu, J., He, S., Li, J., & Lyu, M. R. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2762673 · Cited by 230
Metadata
- Authors
- Gower, J. C., & Ross, G. J. S.
- Venue
- Applied Statistics
- Publisher
- JSTOR
- Published
- 1969
- Volume
- 18
- Issue
- 1
- Pages
- 54
- ISSN
- 0035-9254 (ISSN-L)
- OpenAlex
- W108464071
- Cited by
- 1,223
- References
- 0
- FWCI
- 16.52
- 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: Minimum Spanning Trees and Single Linkage Cluster Analysis. https://app.cochat.ai/papers/10.2307/2346439
- The paper
- Gower, J. C., & Ross, G. J. S. (1969). Minimum Spanning Trees and Single Linkage Cluster Analysis. Applied Statistics. https://doi.org/10.2307/2346439
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.
