data matrix with rows as samples and columns as variables

number of clusters (k) requested; can specify a single integer or a range of integers to compute multiple k

number of subsamples

vector of clustering algorithms for performing consensus clustering. Must be any number of the following: "nmf", "hc", "diana", "km", "pam", "ap", "sc", "gmm", "som", "cmeans", "hdbscan". A custom clustering algorithm can be used.

determines the method to choose k when no reference class is given. When ref.cl is not NULL, k is the number of distinct classes of ref.cl. Otherwise the input from k.method chooses k. The default is to use the PAC to choose the best k(s). Specifying an integer as a user-desired k will override the best k chosen by PAC. Finally, specifying "all" will produce consensus results for all k. The "all" method is implicitly performed when there is only one k used.

specify NMF-based algorithms to run. By default the "brunet" and "lee" algorithms are called. See NMF::nmf() for details.

agglomeration method for hierarchical clustering. The the "average" method is used by default. Seestats::hclust() for details.

a vector of distance functions. Defaults to "euclidean". Other options are given in stats::dist(). A custom distance function can be used.

consensus functions to use. Current options are "kmodes" (k-modes), "majority" (majority voting), "CSPA" (Cluster-based Similarity Partitioning Algorithm), "LCE" (linkage clustering ensemble), "LCA" (latent class analysis)

similarity matrix; choices are "cts", "srs", "asrs".

Prepare the data on the "full" dataset, the "sampled" dataset, or "none" (default).

minimum variability measure threshold used to filter the feature space for only highly variable features. Only features with a minimum variability measure across all samples greater than min.var will be used. If type = "conventional", the standard deviation is the measure used, and if type = "robust", the MAD is the measure used.

random seed for knn imputation reproducibility

logical; if TRUE, algorithms that score low on internal indices will be trimmed out

logical; if TRUE, after trimming out poor performing algorithms, each algorithm is reweighed depending on its internal indices.

an integer specifying the top n algorithms to keep after trimming off the poor performing ones using Rank Aggregation. If the total number of algorithms is less than n no trimming is done.

logical; if TRUE (default), validity indices are returned. Internal validity indices are always computed. If ref.cl is not NULL, then external validity indices will also be computed.

logical; if TRUE, graph_all is called and a summary evaluation heatmap of ranked algorithms vs. internal validity indices is plotted as well.

reference class

logical; should a progress bar be displayed?

raw clustering ensemble object

clustering ensemble object with knn imputation used on E

flattened ensemble object with remaining missing entries imputed by majority voting

final clustering assignment from the diverse clustering ensemble method

if evaluate = TRUE, shows cluster evaluation indices; otherwise NULL