Home | Trees | Indices | Help |
|
---|
|
Mini-Batch K-Means clustering
This node has been automatically generated by wrapping the sklearn.cluster.k_means_.MiniBatchKMeans class from the sklearn library. The wrapped instance can be accessed through the scikits_alg attribute.
Parameters
Control early stopping based on the consecutive number of mini batches that does not yield an improvement on the smoothed inertia.
To disable convergence detection based on inertia, set max_no_improvement to None.
Control early stopping based on the relative center changes as measured by a smoothed, variance-normalized of the mean center squared position changes. This early stopping heuristics is closer to the one used for the batch variant of the algorithms but induces a slight computational and memory overhead over the inertia heuristic.
To disable convergence detection based on normalized center change, set tol to 0.0 (default).
Method for initialization, defaults to 'k-means++':
'k-means++' : selects initial cluster centers for k-mean clustering in a smart way to speed up convergence. See section Notes in k_init for more details.
'random': choose k observations (rows) at random from data for the initial centroids.
If an ndarray is passed, it should be of shape (n_clusters, n_features) and gives the initial centers.
Attributes
labels_ :
- Labels of each point (if compute_labels is set to True).
Notes
See http://www.eecs.tufts.edu/~dsculley/papers/fastkmeans.pdf
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|||
Inherited from Cumulator | |||
---|---|---|---|
|
|||
|
|||
Inherited from Node | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
|
|||
|
|
|||
Inherited from |
|||
Inherited from Node | |||
---|---|---|---|
_train_seq List of tuples: |
|||
dtype dtype |
|||
input_dim Input dimensions |
|||
output_dim Output dimensions |
|||
supported_dtypes Supported dtypes |
|
Mini-Batch K-Means clustering This node has been automatically generated by wrapping the sklearn.cluster.k_means_.MiniBatchKMeans class from the sklearn library. The wrapped instance can be accessed through the scikits_alg attribute. Parameters
Attributes
labels_ :
Notes See http://www.eecs.tufts.edu/~dsculley/papers/fastkmeans.pdf
|
|
|
|
Transform X to a cluster-distance space. This node has been automatically generated by wrapping the sklearn.cluster.k_means_.MiniBatchKMeans class from the sklearn library. The wrapped instance can be accessed through the scikits_alg attribute. In the new space, each dimension is the distance to the cluster
centers. Note that even if X is sparse, the array returned by
Parameters
Returns
|
|
|
Compute the centroids on X by chunking it into mini-batches. This node has been automatically generated by wrapping the sklearn.cluster.k_means_.MiniBatchKMeans class from the sklearn library. The wrapped instance can be accessed through the scikits_alg attribute. Parameters
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Mar 8 12:39:48 2016 | http://epydoc.sourceforge.net |