Ward hierarchical clustering: constructs a tree and cuts it.
Recursively merges the pair of clusters that minimally increases within-cluster variance.
| Parameters: | n_clusters : int or ndarray
connectivity : sparse matrix (optional)
memory : Instance of joblib.Memory or string (optional)
n_components : int (optional)
compute_full_tree : bool or ‘auto’ (optional)
|
|---|
See also
Attributes
| labels_ | (list of arrays, each of shape [sequence_length, ]) The label of each point is an integer in [0, n_clusters). |
| n_leaves_ | (int) Number of leaves in the hierarchical tree. |
| n_components_ | (int) The estimated number of connected components in the graph. |
| children_ | (array-like, shape = [n_nodes, 2]) The children of each non-leaf node. Values less than n_samples refer to leaves of the tree. A greater value i indicates a node with children children_[i - n_samples]. |
Methods
| fit(sequences[, y]) | Fit the clustering on the data |
| fit_predict(sequences[, y]) | Performs clustering on X and returns cluster labels. |
| fit_transform(sequences[, y]) | Alias for fit_predict |
| get_params([deep]) | Get parameters for this estimator. |
| partial_predict(X[, y]) | Predict the closest cluster each sample in X belongs to. |
| partial_transform(X) | Alias for partial_predict |
| predict(sequences[, y]) | Predict the closest cluster each sample in each sequence in sequences belongs to. |
| set_params(**params) | Set the parameters of this estimator. |
| summarize() | Return some diagnostic summary statistics about this Markov model |
| transform(sequences) | Alias for predict |
Methods
| __init__([n_clusters, memory, connectivity, ...]) | |
| fit(sequences[, y]) | Fit the clustering on the data |
| fit_predict(sequences[, y]) | Performs clustering on X and returns cluster labels. |
| fit_transform(sequences[, y]) | Alias for fit_predict |
| get_params([deep]) | Get parameters for this estimator. |
| partial_predict(X[, y]) | Predict the closest cluster each sample in X belongs to. |
| partial_transform(X) | Alias for partial_predict |
| predict(sequences[, y]) | Predict the closest cluster each sample in each sequence in sequences belongs to. |
| set_params(**params) | Set the parameters of this estimator. |
| summarize() | Return some diagnostic summary statistics about this Markov model |
| transform(sequences) | Alias for predict |
Attributes
| linkage |
Fit the clustering on the data
| Parameters: | sequences : list of array-like, each of shape [sequence_length, n_features]
|
|---|---|
| Returns: | self |
Performs clustering on X and returns cluster labels.
| Parameters: | sequences : list of array-like, each of shape [sequence_length, n_features]
|
|---|---|
| Returns: | Y : list of ndarray, each of shape [sequence_length, ]
|
Alias for fit_predict
Get parameters for this estimator.
| Parameters: | deep: boolean, optional
|
|---|---|
| Returns: | params : mapping of string to any
|
Predict the closest cluster each sample in X belongs to.
In the vector quantization literature, cluster_centers_ is called the code book and each value returned by predict is the index of the closest code in the code book.
| Parameters: | X : array-like shape=(n_samples, n_features)
|
|---|---|
| Returns: | Y : array, shape=(n_samples,)
|
Alias for partial_predict
Predict the closest cluster each sample in each sequence in sequences belongs to.
In the vector quantization literature, cluster_centers_ is called the code book and each value returned by predict is the index of the closest code in the code book.
| Parameters: | sequences : list of array-like, each of shape [sequence_length, n_features]
|
|---|---|
| Returns: | Y : list of arrays, each of shape [sequence_length,]
|
Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as pipelines). The former have parameters of the form <component>__<parameter> so that it’s possible to update each component of a nested object.
| Returns: | self |
|---|
Return some diagnostic summary statistics about this Markov model
Alias for predict