Gets the complete hierarchical linkage tree, computed from Distances
using the current linkage delegate.
Namespace:
CenterSpace.NMath.StatsAssembly: NMathStats (in NMathStats.dll) Version: 3.4.0.0
Syntax
| C# |
|---|
public DoubleMatrix Linkages { get; } |
| Visual Basic (Declaration) |
|---|
Public ReadOnly Property Linkages As DoubleMatrix |
| Visual C++ |
|---|
public: property DoubleMatrix^ Linkages { DoubleMatrix^ get (); } |
Remarks
Returns an (n-1) x 3 matrix containing the complete hierarchical
linkage tree. At each level in the tree, Columns 1 and 2 contain the
indices of the clusters linked to form the next cluster. Column 3 contains
the distances between the clusters.
Clusters 0 to n-1 are the objects in the original dataset. Each newly formed cluster is assigned the next available index. For example, if there are five objects in the original data set, they are assigned to singleton clusters 0 to through 4. The first new cluster formed by the linkage function is assigned index 5. If cluster 5 appears later in the tree, it is being combined again into a still larger cluster.
Clusters 0 to n-1 are the objects in the original dataset. Each newly formed cluster is assigned the next available index. For example, if there are five objects in the original data set, they are assigned to singleton clusters 0 to through 4. The first new cluster formed by the linkage function is assigned index 5. If cluster 5 appears later in the tree, it is being combined again into a still larger cluster.
