You are working with the text-only light edition of "H.Lohninger: Teach/Me Data Analysis, Springer-Verlag, Berlin-New York-Tokyo, 1999. ISBN 3-540-14743-8". Click here for further information. |
Table of Contents Multivariate Data Modeling Classification and Discrimination Cluster Analysis Minimal Spanning Tree | |
See also: agglomerative clustering |
A minimal spanning tree is a graph which meets the following requirements:
There is a simple algorithm described by Prim how to determine the
minimal spanning tree. The resulting minimal spanning tree is equal to
the results of a single linkage cluster analysis:
1. select an arbitrary object as the starting vertex of a partial graph M
2. for all objects which are not yet part of the graph M, find the nearest neighbor to any vertex of graph M
3. join this nearest neighbor to M
4. repeat with step 2 until all vertices are part of graph M
Last Update: 2006-Jän-17