ISSN:
1860-0980
Keywords:
minimum spanning trees
;
hierarchical clustering
;
single linkage
;
network models
;
proximity data
;
undirected weighted graphs
Source:
Springer Online Journal Archives 1860-2000
Topics:
Psychology
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02294381
Permalink
