Skip to main content Skip to complementary content

KMeansCentroidND - chart function

KMeansCentroidND() evaluates the rows of the chart by applying k-means clustering, and for each chart row displays the desired coordinate of the cluster this data point has been assigned to. The columns that are used by the clustering algorithm are determined by the parameters coordinate_1, coordinate_2, etc., up to n columns. These are all aggregations. The number of clusters that are created is determined by the num_clusters parameter.

KMeansCentroidND returns one value per row. The returned value is a dual and is one of the coordinates of the position corresponding to the cluster center the data point has been assigned to.



KMeansCentroidND((num_clusters, num_iter, coordinate_no, coordinate_1, coordinate_2 [,coordinate_3 [, ...]])

Return data type: dual


Argument Description
num_clusters Integer that specifies the number of clusters.
num_iter The number of iterations of clustering with reinitialized cluster centers.
coordinate_no The desired coordinate number of the centroids (corresponding, for example, to the x, y, or z axis).
coordinate_1 The aggregation that calculates the first coordinate, usually the x-axis (of a scatter chart that can be made from the chart). The additional parameters calculate the second, third, and fourth coordinates, etc.


KMeans functions support auto-clustering using a method called depth difference (DeD). When a user sets 0 for the number of clusters, an optimal number of clusters for that dataset is determined. Note that while an integer for the number of clusters (k) is not explicitly returned, it is calculated within the KMeans algorithm. For example, if 0 is specified in the function for the value of KmeansPetalClusters or set through a variable input box, cluster assignments are automatically calculated for the dataset based on an optimal number of clusters.

Did this page help you?

If you find any issues with this page or its content – a typo, a missing step, or a technical error – let us know how we can improve!