cut_dyf_tree_to_labels
cut_dyf_tree_to_labels(tree, n_points, n_clusters, embeddings)Cut DYF tree into flat cluster labels using agglomerative merge.
Collects leaf nodes, computes their cosine centroids, then merges leaves to n_clusters using agglomerative clustering with cosine distance and average linkage.
Parameters
| Name | Type | Description | Default |
|---|---|---|---|
| tree | DYF tree dict from build_dyf_tree(). | required | |
| n_points | Total number of points. | required | |
| n_clusters | Desired number of clusters. | required | |
| embeddings | (n, d) array used for centroid computation. | required |
Returns
| Name | Type | Description |
|---|---|---|
| np.ndarray of shape (n_points,) with cluster labels. |