The empty clusters will be set to all zeros and the corresponding elements in has_members will be False. The upper level function should decide how to deal with them.
The observation matrix. Each row is an observation. Its dtype must be float32 or float64.
The label of each observation. Must be an 1d array.
The number of centroids.
The new code book.
A boolean array indicating which clusters have members.
The update-step of K-means. Calculate the mean of observations in each cluster.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them
