IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v1y1984i1p7-24.html
   My bibliography  Save this article

Efficient algorithms for agglomerative hierarchical clustering methods

Author

Listed:
  • William Day
  • Herbert Edelsbrunner

Abstract

No abstract is available for this item.

Suggested Citation

  • William Day & Herbert Edelsbrunner, 1984. "Efficient algorithms for agglomerative hierarchical clustering methods," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 7-24, December.
    • Handle: RePEc:spr:jclass:v:1:y:1984:i:1:p:7-24
    DOI: 10.1007/BF01890115
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01890115
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01890115?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. C. Gower & G. J. S. Ross, 1969. "Minimum Spanning Trees and Single Linkage Cluster Analysis," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 18(1), pages 54-64, March.
    2. Vladimir Batagelj, 1981. "Note on ultrametric hierarchical clustering algorithms," Psychometrika, Springer;The Psychometric Society, vol. 46(3), pages 351-352, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Beibei Zhang & Rong Chen, 2018. "Nonlinear Time Series Clustering Based on Kolmogorov-Smirnov 2D Statistic," Journal of Classification, Springer;The Classification Society, vol. 35(3), pages 394-421, October.
    2. Sung-Soo Kim & W. Krzanowski, 2007. "Detecting multiple outliers in linear regression using a cluster method combined with graphical visualization," Computational Statistics, Springer, vol. 22(1), pages 109-119, April.
    3. Kirschstein, Thomas & Liebscher, Steffen & Becker, Claudia, 2013. "Robust estimation of location and scatter by pruning the minimum spanning tree," Journal of Multivariate Analysis, Elsevier, vol. 120(C), pages 173-184.
    4. William Day & Herbert Edelsbrunner, 1985. "Investigation of proportional link linkage clustering methods," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 239-254, December.
    5. Anuška Ferligoj & Vladimir Batagelj, 1982. "Clustering with relational constraint," Psychometrika, Springer;The Psychometric Society, vol. 47(4), pages 413-426, December.
    6. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
    7. Sergio Scippacercola, 2011. "The Factorial Minimum Spanning Tree as a Reference for a Synthetic Index of Complex Phenomena," Journal of Classification, Springer;The Classification Society, vol. 28(1), pages 21-37, April.
    8. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    9. Górecki, Jan & Hofert, Marius & Okhrin, Ostap, 2021. "Outer power transformations of hierarchical Archimedean copulas: Construction, sampling and estimation," Computational Statistics & Data Analysis, Elsevier, vol. 155(C).
    10. Bruno Leclerc, 1995. "Minimum spanning trees for tree metrics: abridgements and adjustments," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 207-241, September.
    11. Zhimei Lei & Kuo-Jui Wu & Li Cui & Ming K Lim, 2018. "A Hybrid Approach to Explore the Risk Dependency Structure among Agribusiness Firms," Sustainability, MDPI, vol. 10(2), pages 1-17, February.
    12. Raymond, Ben & Hosie, Graham, 2009. "Network-based exploration and visualisation of ecological data," Ecological Modelling, Elsevier, vol. 220(5), pages 673-683.
    13. Unknown, 1996. "Proceedings of a workshop held at Northern Territory University, 6-7 June 1996: Trochus: Status, Hatchery Practice and Nutrition," ACIAR Proceedings Series 135188, Australian Centre for International Agricultural Research.
    14. Eden, Colin, 2004. "Analyzing cognitive maps to help structure issues or problems," European Journal of Operational Research, Elsevier, vol. 159(3), pages 673-686, December.
    15. Werner Vach & Paul Degens, 1991. "A new approach to isotonic agglomerative hierarchical clustering," Journal of Classification, Springer;The Classification Society, vol. 8(2), pages 217-237, December.
    16. Massimiliano Fessina & Giambattista Albora & Andrea Tacchella & Andrea Zaccaria, 2022. "Which products activate a product? An explainable machine learning approach," Papers 2212.03094, arXiv.org.
    17. Andrea Di Iura, 2022. "Comparison of empirical and shrinkage correlation algorithm for clustering methods in the futures market," SN Business & Economics, Springer, vol. 2(8), pages 1-17, August.
    18. Ahuja, Ravindra K., 1956-, 1992. "Applications of network optimization," Working papers 3458-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. Tokuda, Eric K. & Comin, Cesar H. & Costa, Luciano da F., 2022. "Revisiting agglomerative clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    20. Modarres, Reza, 2014. "On the interpoint distances of Bernoulli vectors," Statistics & Probability Letters, Elsevier, vol. 84(C), pages 215-222.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:1:y:1984:i:1:p:7-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.