Performs clustering according to the agglomerative algorithm
Source:R/sklearn-cluster.R
AgglomerativeClustering.RdRecursively merges pair of clusters of sample data; uses linkage distance. This is a wrapper around the Python class sklearn.cluster.AgglomerativeClustering.
Super classes
rgudhi::PythonClass -> rgudhi::SKLearnClass -> rgudhi::BaseClustering -> AgglomerativeClustering
Methods
Method new()
The AgglomerativeClustering class constructor.
Usage
AgglomerativeClustering$new(
n_clusters = 2L,
affinity = c("euclidean", "l1", "l2", "manhattan", "cosine", "precomputed"),
memory = NULL,
connectivity = NULL,
compute_full_tree = "auto",
linkage = c("ward", "complete", "average", "single"),
distance_threshold = NULL,
compute_distances = FALSE
)Arguments
n_clustersAn integer value specifying the number of clusters to find. It must be
NULLifdistance_thresholdis notNULL. Defaults to2L.affinityA string specifying the metric used to compute the linkage. Can be
"euclidean","l1","l2","manhattan","cosine"or"precomputed". Iflinkageis"ward", only"euclidean"is accepted. If"precomputed", a distance matrix (instead of a similarity matrix) is needed as input for the$fit()method. Defaults to"euclidean".memoryA string specifying the path to the caching directory. Defaults to
NULLin which case no caching is done.connectivityEither a numeric matrix or an object of class stats::dist or an object coercible into a function by
rlang::as_function()specifying for each sample the neighboring samples following a given structure of the data. This can be a connectivity matrix itself or a function that transforms the data into a connectivity matrix. Defaults toNULL, i.e., the hierarchical clustering algorithm is unstructured.compute_full_treeEither a boolean value or the
"auto"string specifying whether to prematurely stop the construction of the tree atn_clusters. This is useful to decrease computation time if the number of clusters is not small compared to the number of samples. 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 beTRUEifdistance_thresholdis notNULL. Defaults to"auto", which is equivalent toTRUEwhendistance_thresholdis notNULLor thatn_clustersis inferior to the maximum between100and0.02 * n_samples. Otherwise,"auto"is equivalent toFALSE.linkageA string specifying which linkage criterion to use. The linkage criterion determines which distance to use between sets of observation. The algorithm will merge the pairs of cluster that minimize this criterion.
ward: minimizes the variance of the clusters being merged;average: uses the average of the distances of each observation of the two sets;complete: uses the maximum of the distances between all observations of the two sets.single: uses the minimum of the distances between all observations of the two sets. Defaults to"ward".
distance_thresholdA numeric value specifying the linkage distance threshold above which clusters will not be merged. If not
NULL,n_clustersmust beNULLandcompute_full_treemust beTRUE. Defaults toNULL.compute_distancesA boolean value specifying whether to compute distances between clusters even if
distance_thresholdis not used. This can be used to make dendrogram visualization, but introduces a computational and memory overhead. Defaults toFALSE.