Agglomerate features.
Recursively merges pair of clusters of features.
Refer to Feature agglomeration vs. univariate selection for an example comparison of FeatureAgglomeration
strategy with a univariate feature selection strategy (based on ANOVA).
Read more in the User Guide.
The number of clusters to find. It must be None
if distance_threshold
is not None
.
Metric used to compute the linkage. Can be “euclidean”, “l1”, “l2”, “manhattan”, “cosine”, or “precomputed”. If linkage is “ward”, only “euclidean” is accepted. If “precomputed”, a distance matrix is needed as input for the fit method.
Added in version 1.2.
Used to cache the output of the computation of the tree. By default, no caching is done. If a string is given, it is the path to the caching directory.
Connectivity matrix. Defines for each feature the neighboring features following a given structure of the data. This can be a connectivity matrix itself or a callable that transforms the data into a connectivity matrix, such as derived from kneighbors_graph
. Default is None
, i.e, the hierarchical clustering algorithm is unstructured.
Stop early the construction of the tree at n_clusters
. This is useful to decrease computation time if the number of clusters is not small compared to the number of features. This option is useful only when specifying a connectivity matrix. Note also that when varying the number of clusters and using caching, it may be advantageous to compute the full tree. It must be True
if distance_threshold
is not None
. By default compute_full_tree
is “auto”, which is equivalent to True
when distance_threshold
is not None
or that n_clusters
is inferior to the maximum between 100 or 0.02 * n_samples
. Otherwise, “auto” is equivalent to False
.
Which linkage criterion to use. The linkage criterion determines which distance to use between sets of features. The algorithm will merge the pairs of cluster that minimize this criterion.
“ward” minimizes the variance of the clusters being merged.
“complete” or maximum linkage uses the maximum distances between all features of the two sets.
“average” uses the average of the distances of each feature of the two sets.
“single” uses the minimum of the distances between all features of the two sets.
This combines the values of agglomerated features into a single value, and should accept an array of shape [M, N] and the keyword argument axis=1
, and reduce it to an array of size [M].
The linkage distance threshold at or above which clusters will not be merged. If not None
, n_clusters
must be None
and compute_full_tree
must be True
.
Added in version 0.21.
Computes distances between clusters even if distance_threshold
is not used. This can be used to make dendrogram visualization, but introduces a computational and memory overhead.
Added in version 0.24.
The number of clusters found by the algorithm. If distance_threshold=None
, it will be equal to the given n_clusters
.
Cluster labels for each feature.
Number of leaves in the hierarchical tree.
The estimated number of connected components in the graph.
Added in version 0.21: n_connected_components_
was added to replace n_components_
.
Number of features seen during fit.
Added in version 0.24.
n_features_in_
,)
Names of features seen during fit. Defined only when X
has feature names that are all strings.
Added in version 1.0.
The children of each non-leaf node. Values less than n_features
correspond to leaves of the tree which are the original samples. A node i
greater than or equal to n_features
is a non-leaf node and has children children_[i - n_features]
. Alternatively at the i-th iteration, children[i][0] and children[i][1] are merged to form node n_features + i
.
Distances between nodes in the corresponding place in children_
. Only computed if distance_threshold
is used or compute_distances
is set to True
.
Examples
>>> import numpy as np >>> from sklearn import datasets, cluster >>> digits = datasets.load_digits() >>> images = digits.images >>> X = np.reshape(images, (len(images), -1)) >>> agglo = cluster.FeatureAgglomeration(n_clusters=32) >>> agglo.fit(X) FeatureAgglomeration(n_clusters=32) >>> X_reduced = agglo.transform(X) >>> X_reduced.shape (1797, 32)
Fit the hierarchical clustering on the data.
The data.
Not used, present here for API consistency by convention.
Returns the transformer.
Fit and return the result of each sample’s clustering assignment.
Fit to data, then transform it.
Fits transformer to X
and y
with optional parameters fit_params
and returns a transformed version of X
.
Input samples.
Target values (None for unsupervised transformations).
Additional fit parameters.
Transformed array.
Get output feature names for transformation.
The feature names out will prefixed by the lowercased class name. For example, if the transformer outputs 3 features, then the feature names out are: ["class_name0", "class_name1", "class_name2"]
.
Only used to validate feature names with the names seen in fit
.
Transformed feature names.
Get metadata routing of this object.
Please check User Guide on how the routing mechanism works.
A MetadataRequest
encapsulating routing information.
Get parameters for this estimator.
If True, will return the parameters for this estimator and contained subobjects that are estimators.
Parameter names mapped to their values.
Inverse the transformation and return a vector of size n_features
.
The values to be assigned to each cluster of samples.
A vector of size n_samples
with the values of X
assigned to each of the cluster of samples.
Set output container.
See Introducing the set_output API for an example on how to use the API.
Configure output of transform
and fit_transform
.
"default"
: Default output format of a transformer
"pandas"
: DataFrame output
"polars"
: Polars output
None
: Transform configuration is unchanged
Added in version 1.4: "polars"
option was added.
Estimator instance.
Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as Pipeline
). The latter have parameters of the form <component>__<parameter>
so that it’s possible to update each component of a nested object.
Estimator parameters.
Estimator instance.
Transform a new matrix using the built clustering.
A M by N array of M observations in N dimensions or a length M array of M one-dimensional observations.
The pooled values for each feature cluster.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4