Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T01:30:39.819Z Has data issue: false hasContentIssue false

Some Applications of Graph Theory to Clustering

Published online by Cambridge University Press:  01 January 2025

Lawrence J. Hubert*
Affiliation:
University of Wisconsin

Abstract

This paper attempts to review and expand upon the relationship between graph theory and the clustering of a set of objects. Several graphtheoretic criteria are proposed for use within a general clustering paradigm as a means of developing procedures “in between” the extremes of complete-link and single-link hierarchical partitioning; these same ideas are then extended to include the more general problem of constructing subsets of objects with overlap. Finally, a number of related topics are surveyed within the general context of reinterpreting and justifying methods of clustering either through standard concepts in graph theory or their simple extensions.

Information

Type
Original Paper
Copyright
Copyright © 1974 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable