Hostname: page-component-69cd664f8f-84qt4 Total loading time: 0 Render date: 2025-03-13T00:10:13.524Z Has data issue: false hasContentIssue false
  • English
  • Français

“Minimax Length Links” of a Dissimilarity Matrix and Minimum Spanning Trees

Published online by Cambridge University Press:  01 January 2025

J. Douglas Carroll
J. Douglas Carroll*
Affiliation:
Rutgers University
*
Requests for reprints should be sent to J. Douglas Carroll, Faculty of Management, Rutgers University, 181 New Street, Newark, NJ 07102-1895.
Get access Rights & Permissions [Opens in a new window]

Abstract

A theorem is proved stating that the set of all “minimax links”, defined as links minimizing, over paths, the maximum length of links in any path connecting a pair of objects comprising nodes in an undirected weighted graph, comprise the union of all minimum spanning trees of that graph. This theorem is related to methods of fitting network models to dissimilarity data, particularly a method called “Pathfinder” due to Schvaneveldt and his colleagues, as well as to single linkage clustering, and results concerning the relationship between minimum spanning trees and single linkage hierarchical trees.

Keywords

minimum spanning treeshierarchical clusteringsingle linkagenetwork modelsproximity dataundirected weighted graphs
Type
Original Paper
Information
Psychometrika , Volume 60 , Issue 3 , September 1995 , pp. 371 - 374
Copyright
Copyright © 1995 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.)

Footnotes

Acknowledgments: The author thanks Phipps Arabie, Lawrence J. Hubert, and K. Christoph Klauer for a number of helpful suggestions and comments on various aspects of this paper.

References

Dearholt, D. W., Schvaneveldt, R. W. (1990). Properties of Pathfinder networks. In Schvaneveldt, R. W. (Eds.), Pathfinder associative networks: Studies in knowledge organization (pp. 1–30). Norwood, NJ: Ablex.Google Scholar
Gower, J. C., Ross, G. J. S. (1969). Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18, 54–64.CrossRefGoogle Scholar
Hartigan, J. A. (1975). Clustering algorithms, New York: John Wiley & Sons.Google Scholar
Hutchinson, J. W. (1981). Network representations of psychological relations. Unpublished doctoral dissertation, Stanford University.Google Scholar
Hutchinson, J. W. (1989). NETSCAL: A network scaling algorithm for non-symmetric proximity data. Psychometrika, 54, 25–52.CrossRefGoogle Scholar
Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32, 241–254.CrossRefGoogle ScholarPubMed
Klauer, K. C. (1989). Ordinal representation: Representing proximities by graphs. Psychometrika, 54, 737–750.CrossRefGoogle Scholar
Klauer, K. C., Carroll, J. D. (1989). A mathematical programming approach to fitting general graphs. Journal of Classification, 6, 247–270.CrossRefGoogle Scholar
Klauer, K. C., Carroll, J. D. (1991). A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures. Journal of Classification, 8, 251–268.CrossRefGoogle Scholar
Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48–50.CrossRefGoogle Scholar
Prim, R. C. (1957). Shortest connection networks and some generalizations. The Bell System Technical Journal, XXXVI, 1389–1401.CrossRefGoogle Scholar
Schvaneveldt, R. W., Dearholt, D. W., Durso, F. T. (1988). Graph theoretic foundations of Pathfinder networks. Comput. Math. Applic., 15, 337–345.CrossRefGoogle Scholar