KMeansPlusPlusSeed (S-Space Package 2.0.1 API)

All Implemented Interfaces:

KMeansSeed
```
public class KMeansPlusPlusSeed
extends Object
implements KMeansSeed
```
This KMeansSeed implementation attempts to select centroids from the set of data points that are well scattered. This is done first selecting a data point at random as the first centroid and then selected data points to be the next centroid with a probability proportional to the distance between the data point and the nearest centroid. It is based on the following paper:
David Arthur, Sergei Vassilvitskii, "k-means++: the advantages of careful seeding," in Symposium on Discrete Algorithms and Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, 2007

Constructors
Constructor and Description
`KMeansPlusPlusSeed()`

Methods
Modifier and Type	Method and Description
`DoubleVector[]`	`chooseSeeds(int numCentroids, Matrix dataPoints)` Selects the best scattered `numCentroids` data points from `dataPoints`.

Class KMeansPlusPlusSeed