Skip to main content
Log in

Space-conserving agglomerative algorithms

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

This paper evaluates a general, infinite family of clustering algorithms, called the Lance and Williams algorithms, with respect to the space-conserving criterion. An admissible clustering criterion is defined using the space conserving idea. Necessary and sufficient conditions for Lance and Williams clustering algorithms to satisfy space-conserving admissibility are provided. Space-dilating, space-contracting, and well-structured clustering algorithms are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • CHEN, Z., and VAN NESS, J. (1994a), “Metric Admissibility and Agglomerative Clustering,”Communications in Statistics: Simulation and Computation, 23, 3.

    Google Scholar 

  • CHEN, Z., and VAN NESS, J. (1994b), “Space-Contracting, Space-Dilating, and Positive Admissible Clustering,”Pattern Recognition, 27, 6.

    Google Scholar 

  • DUBIEN, J. L., and WARDE, W. D. (1979), “A Mathematical Comparison of the Members of an Infinite Family of Agglomerative Clustering Algorithms,”Canadian Journal of Statistics, 7, 27–33.

    Google Scholar 

  • FISHER, L., and VAN NESS, J. W. (1971), “Admissible Clustering Procedures”Biometrika, 58, 91–104.

    Google Scholar 

  • GORDON, A. D. (1987), “A Review of Hierarchical Clustering,”Journal of the Royal Statistical Society, Series A 150, 119–137.

    Google Scholar 

  • HARTIGAN, J. (1981), “Consistency of Single Linkage for High Density Clusters,”Journal of the American Statistical Association, 76, 388–394.

    Google Scholar 

  • JARDINE, N., & SIBSON, R. (1968), “The Construction of Hierarchic and Non-hierarchic Classifications,”Computer Journal, 11, 177–84.

    Google Scholar 

  • JOHNSON, S. C. (1967), “Hierarchical Clustering Schemes,”Psychometrika, 32, 241–45.

    PubMed  Google Scholar 

  • LANCE, G. N., and WILLIAMS, W. T. (1967), “A General Theory of Classificatory Sorting Strategies. 1. Hierarchical Systems,”Computer Journal, 9, 373–380.

    Google Scholar 

  • NAKAMURA, N., and OHSUMI, N. (1990), “Space-Distorting Properties in Agglomerative Hierarchical Clustering Algorithms,” Research Memorandum # 387, The Institute of Statistical Mathematics, Tokyo.

    Google Scholar 

  • PECK, R., FISHER, L., and VAN NESS, J. (1989) “Approximate Confidence Intervals for the Number of Clusters,”Journal of the American Statistical Association, 84, 184–191.

    Google Scholar 

  • ROBIN, J. (1967), “Optimal Classification into Groups: an Approach for Solving the Taxonomy Problem,”Journal of Theoretical Biology, 15, 103–44.

    Google Scholar 

  • VAN NESS, J. W. (1973), “Admissible Clustering Procedures II,”Biometrika, 60, 422–424.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work of J. Van Ness was supported by NSF Grant #DMS 9201075.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Z., Van Ness, J.W. Space-conserving agglomerative algorithms. Journal of Classification 13, 157–168 (1996). https://doi.org/10.1007/BF01202586

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01202586

Keywords

Navigation