ClusteringResult holds information how leaves and clusters are joined and on what height they are joined.
The class also contains an index order how to sort the leaves to draw a dendrogram without crosssing.
(The clustering information is in a format similar to the clustering result from hclust function in S-PLUS.)
Inheritance Hierarchy
Spotfire.Dxp.Data.Computations.ClusteringHierarchicalClusteringResult
Namespace: Spotfire.Dxp.Data.Computations.Clustering
Assembly: Spotfire.Dxp.Data (in Spotfire.Dxp.Data.dll) Version: 25.11.10401.3615 (25.11.10401.3615)
Syntax
C#
[SerializableAttribute] [PersistenceVersionAttribute(6, 0)] [ImmutableAttribute] public sealed class HierarchicalClusteringResult : ISerializable, IDataCacheValueType
The HierarchicalClusteringResult type exposes the following members.
Methods
| Name | Description | |
|---|---|---|
 | Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) |
 | GetType | Gets the Type of the current instance. (Inherited from Object.) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
Properties
| Name | Description | |
|---|---|---|
 | Height | Gets the similarity/distance of the clusters joined in Merge1 and Merge2.
|
| Merge1 | Gets the first merge column.
Merge1[n] holds the index representing the first cluster/leaf to join at level n.
Merge1 and Merge2 hold information about which clusters are joined
and in what order they are joined.
Negative values refer to leaves (1-based indexing of the input),
positive values refer to clusters joined at lower level (1-based indexing of merge1 and merge2).
Observe that PageableList indexing is zero-base but the information in Merge1 and Merge2 is 1-based. |
| Merge2 | Gets the second merge column.
Merge2[n] holds the index representing the second cluster/leaf to join at level n.
Merge1 and Merge2 hold information about which clusters are joined
and in what order they are joined.
Negative values refer to leaves (1-based indexing of the input),
positive values refer to clusters joined at lower level (1-based indexing of merge1 and merge2).
Observe that PageableList indexing is zero-base but the information in Merge1 and Merge2 is 1-based. |
| Order |
Gets an index (1-based) ordering of the input so the dendrogram can be drawn without crossings.
Observe that PageableList indexing is zero-base but the information in order is 1-based. |
Version Information
See Also