Skip to main content

Cluster Validity by Concurrent Chaining

  • Chapter
Numerical Taxonomy

Part of the book series: NATO ASI Series ((ASIG,volume 1))

Abstract

A cluster is a maximal collection of suitably similar objects drawn from a larger collection of objects. Many cluster analysis procedures seek to determine a partition of objects into clusters, or more generally, to determine a hierarchy of such cluster partitions. Single-, complete-, and average-linkage are several of the most frequently cited methods that identify such a hierarchy of clusters. These simply applied linkage based procedures yield only rudimentary and often misleading information regarding the “validity” of each cluster identified. By the validity of a particular cluster we refer to the substantive significance that should be afforded that collection of objects as representing a single cluster.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Jardine, N. and Sibson, R. 1971, Mathematical Taxonomy, Wiley, London. Ling, R. F. 1972. On the theory and construction of k-clusters. Computer J. 15: 326–332.

    Google Scholar 

  • Matula, D. W. 1977. Graph theoretic techniques for cluster analysis algorithms, in Classification and Clustering. J. Van Ryzin (ed.) Academic Press, New York, 95–129.

    Google Scholar 

  • Matula, D. W. 1982. Maximum concurrent flow and saturated k-partite cuts. Southern Methodist University Dept. Comp. Sci. and Eng. Tech Rep. 82-CSE-10.

    Google Scholar 

  • Matula, D. W. 1983. Graph theoretic cluster analysis. In Encyclopedia of Statistical Sciences, S. Kotz and N.L. Johnson (ed.) Wiley, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Matula, D.W. (1983). Cluster Validity by Concurrent Chaining. In: Felsenstein, J. (eds) Numerical Taxonomy. NATO ASI Series, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69024-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69024-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-69026-6

  • Online ISBN: 978-3-642-69024-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics