Class: BisectingKMeansModel

eclairjs/mllib/clustering.BisectingKMeansModel

new BisectingKMeansModel(root)

Clustering model produced by BisectingKMeans. The prediction is done level-by-level from the root node to a leaf node, and at each node among its children the closest to the input point is selected.
Parameters:
Name Type Description
root the root node of the clustering tree
Source:

Methods

clusterCenters() → {Promise.<Array.<Vector>>}

Leaf cluster centers.
Source:
Returns:
Type
Promise.<Array.<Vector>>

computeCost(point) → {Promise.<number>}

Computes the sum of squared distances between the input points and their corresponding cluster centers.
Parameters:
Name Type Description
point Vector | RDD
Source:
Returns:
Type
Promise.<number>

predict(point) → {Promise.<number>}

Predicts the index of the cluster that the input point belongs to.
Parameters:
Name Type Description
point Vector | RDD
Source:
Returns:
Type
Promise.<number>