Cluster {Microsoft.VisualBasic.DataMining.HierarchicalClustering}

.NET clr documentation

Cluster

Description

Represents a node (cluster) in the hierarchical clustering tree (dendrogram). Each cluster can be a leaf node (containing a single data point) or an internal node (containing child clusters formed by merging). Implements the tree node data structure required for hierarchical clustering and provides named identification via INamedValue .

Declare

            
# namespace Microsoft.VisualBasic.DataMining.HierarchicalClustering
export class Cluster {
   # Gets the read-only collection of child clusters directly under this node. An empty collection indicates that this node is a leaf cluster. Implements ITreeNodeData`1.ChildNodes .
   Children: IReadOnlyCollection`1;
   # Gets or sets the Cluster.Distance  object associated with this cluster, representing the distance at which this cluster was formed (for internal nodes) or the initial distance for leaf nodes.
   Distance: Distance;
   # Gets the distance value of this cluster from the underlying Cluster.Distance  object. For internal nodes, this represents the cophenetic distance at which child clusters were merged. For leaf nodes, this is typically zero or the initial distance.
   DistanceValue: double;
   # Gets a value indicating whether this cluster is a leaf node. A cluster is a leaf if it has no children. Implements ITreeNodeData`1.IsLeaf .
   isLeaf: boolean;
   # Gets a value indicating whether this cluster is the root node of the dendrogram. A cluster is considered the root if it has no parent or if its parent is itself. Implements ITreeNodeData`1.IsRoot .
   IsRoot: boolean;
   # Gets the list of leaf names contained within this cluster's subtree. For leaf clusters, this list contains the cluster's own name. For internal clusters, it accumulates the names of all descendant leaf nodes.
   LeafNames: iterates(String);
   # Gets the total number of leaf nodes in the subtree rooted at this cluster. Recursively counts all descendant leaf nodes, including direct children and their children.
   Leafs: integer;
   # Gets or sets the unique name identifier for this cluster. The name should be unique among all leaf clusters to ensure correct equality comparisons. Implements IKeyedEntity`1.Key  and ITreeNodeData`1.FullyQualifiedName .
   Name: string;
   # Gets or sets the parent cluster of this node in the dendrogram. A Nothing value indicates this cluster is the root of the tree. Implements ITreeNodeData`1.Parent .
   Parent: Cluster;
   # Gets the total distance value accumulated along the left-most path from this node to its deepest descendant. This is the sum of distances from this node down through the first child at each level.
   TotalDistance: double;
   # Gets the weight of this cluster from the underlying Cluster.Distance  object. The weight is used in weighted linkage strategies such as WPGMA.
   WeightValue: double;
}

        

.NET clr type reference tree

1. use by property member Children: IReadOnlyCollection`1
2. use by property member Distance: Distance
3. use by property member LeafNames: iterates(String)
4. use by property member Parent: Cluster

---