UWW KMeans Clustering

This node performs k-means clustering algorithm on numerical data. It evaluates multiple values of k and provides WCSS (elbow) and silhouette scores to help determine the optimal number of clusters.

Options

Minimum k
The minimum number of clusters to evaluate.
Maximum k
The maximum number of clusters to evaluate.
Solution k
The number of clusters to use for the final output.

Input Ports

Icon
Table containing numerical data to cluster

Output Ports

Icon
Input data with cluster assignments
Icon
Within-cluster sum of squares for each k
Icon
Average silhouette scores for each k
Icon
Cluster centroids for each k value

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found

Views

This node has no views

Workflows

  • No workflows found

Links

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.