Premium
SPANNING TREES AND ASPECTS OF CLUSTERING
Author(s) -
Hubert Lawrence
Publication year - 1974
Publication title -
british journal of mathematical and statistical psychology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.157
H-Index - 51
eISSN - 2044-8317
pISSN - 0007-1102
DOI - 10.1111/j.2044-8317.1974.tb00524.x
Subject(s) - spanning tree , cluster analysis , minimum spanning tree , computer science , mathematics , graph , hierarchical clustering , link (geometry) , tree (set theory) , set (abstract data type) , data mining , theoretical computer science , artificial intelligence , algorithm , combinatorics , programming language
The concept of a spanning tree for a weighted graph is used to characterize several methods of clustering a set of objects. In particular, most of the paper is devoted to stating relationships between spanning trees, single‐link and complete‐link hierarchical clustering, network flow and two divisive clustering procedures. Several related topics using the notion of a spanning tree are also mentioned.