“Minimax Length Links” of a Dissimilarity Matrix and Minimum Spanning Trees
Copyright policy )“Minimax Length Links” of a Dissimilarity Matrix and Minimum Spanning Trees
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.
- Rutgers, The State University of New Jersey United States
Clustering in the social and behavioral sciences, Pathfinder, maximum length of links, network models, Applications of graph theory, single linkage clustering, single linkage hierarchical trees, minimax links, minimum spanning trees, undirected weighted graph, Paths and cycles, hierarchical clustering, proximity data, dissimilarity data
Clustering in the social and behavioral sciences, Pathfinder, maximum length of links, network models, Applications of graph theory, single linkage clustering, single linkage hierarchical trees, minimax links, minimum spanning trees, undirected weighted graph, Paths and cycles, hierarchical clustering, proximity data, dissimilarity data
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!