This wrapper runs ClusterR::KMeans_rcpp()
and adds column names to the
centroids
field. And reorders the clusters.
.k_means_fit_ClusterR(
data,
clusters,
num_init = 1,
max_iters = 100,
initializer = "kmeans++",
fuzzy = FALSE,
verbose = FALSE,
CENTROIDS = NULL,
tol = 1e-04,
tol_optimal_init = 0.3,
seed = 1
)
a list with the following attributes: clusters, fuzzy_clusters (if fuzzy = TRUE), centroids, total_SSE, best_initialization, WCSS_per_cluster, obs_per_cluster, between.SS_DIV_total.SS
matrix or data frame
the number of clusters
number of times the algorithm will be run with different centroid seeds
the maximum number of clustering iterations
the method of initialization. One of, optimal_init, quantile_init, kmeans++ and random. See details for more information
either TRUE or FALSE. If TRUE, then prediction probabilities will be calculated using the distance between observations and centroids
either TRUE or FALSE, indicating whether progress is printed during clustering.
a matrix of initial cluster centroids. The rows of the CENTROIDS matrix should be equal to the number of clusters and the columns should be equal to the columns of the data.
a float number. If, in case of an iteration (iteration > 1 and iteration < max_iters) 'tol' is greater than the squared norm of the centroids, then kmeans has converged
tolerance value for the 'optimal_init' initializer. The higher this value is, the far appart from each other the centroids are.
integer value for random number generator (RNG)