The DOI matches its Crossref record.
An efficient algorithm for a complete link method
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Second-generation PLINK: rising to the challenge of larger and richer datasets
Chang, C. C., Chow, C. C., Tellier, L. C., Vattikuti, S., Purcell, S. M., & Lee, J. J. (2015) · Gigascience · doi:10.1186/s13742-015-0047-8 · Cited by 12,709
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Algorithms for hierarchical clustering: an overview
Murtagh, F., & Contreras, P. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.53 · Cited by 1,874
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Efficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
Nielsen, F. (2016) · Undergraduate Topics in Computer Science · doi:10.1007/978-3-319-21903-5_8 · Cited by 494
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Wang, J., Jiang, C., Zhang, H., Ren, Y., Chen, K.-C., & Hanzo, L. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2965856 · Cited by 486
Accelerated Hierarchical Density Based Clustering
McInnes, L., & Healy, J. (2017) · 2017 IEEE International Conference on Data Mining Workshops (ICDMW) · doi:10.1109/icdmw.2017.12 · Cited by 434
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 404
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Aurenhammer, F., & Klein, R. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50006-1 · Cited by 392
The Application of Deep Learning in Cancer Prognosis Prediction
Zhu, W., Xie, L., Han, J., & Guo, X. (2020) · Cancers · doi:10.3390/cancers12030603 · Cited by 380
A Review of Hierarchical Classification
Gordon, A. D. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981629 · Cited by 380
Clustering Methodologies in Exploratory Data Analysis
Dubes, R., & Jain, A. K. (1980) · Advances in Computers · doi:10.1016/s0065-2458(08)60034-0 · Cited by 286
Algorithms for hierarchical clustering: an overview,II
Murtagh, F., & Contreras, P. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1219 · Cited by 285
Hennrich, M. L., Romanov, N., Horn, P., Jaeger, S., Eckstein, V., Steeples, V., Ye, F., Ding, X., Poisa-Beiro, L., Lai, M. C., et al. (2018) · Nature Communications · doi:10.1038/s41467-018-06353-4 · Cited by 101
Li, S., Laima, S., & Li, H. (2017) · Engineering Structures · doi:10.1016/j.engstruct.2017.02.024 · Cited by 96
GTalign: spatial index-driven protein structure alignment, superposition, and search
(2024) · doi:10.1038/s41467-024-51669-z · Cited by 23
Metadata
- Authors
- Defays, D.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1977-04-01
- Volume
- 20
- Issue
- 4
- Pages
- 364-366
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2107946060
- Cited by
- 752
- References
- 0
- FWCI
- 1.45
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.