jackstraw_pam: Non-Parametric Jackstraw for Partitioning Around Medoids (PAM)
Description
Test the cluster membership for Partitioning Around Medoids (PAM)
Usage
jackstraw_pam(dat, pam.dat, s = NULL, B = NULL, covariate = NULL,
verbose = FALSE, pool = TRUE, seed = NULL, ...)
Arguments
dat
a matrix with m rows as variables and n columns as observations.
pam.dat
an output from applying cluster::pam() on dat.
s
a number of ``synthetic'' null variables. Out of m variables, s variables are independently permuted.
B
a number of resampling iterations.
covariate
a model matrix of covariates with n observations. Must include an intercept in the first column.
verbose
a logical specifying to print the computational progress. By default, FALSE.
pool
a logical specifying to pool the null statistics across all clusters. By default, TRUE.
seed
a seed for the random number generator.
...
optional arguments to control the k-means clustering algorithm (refers to kmeans).
Value
jackstraw_pam returns a list consisting of
F.obs
m observed F statistics between variables and cluster medoids.
F.null
F null statistics between null variables and cluster medoids, from the jackstraw method.
p.F
m p-values of membership.
Details
PAM assigns m rows into K clusters. This function enable statistical
evaluation if the cluster membership is correctly assigned. Each of m p-values refers to
the statistical test of that row with regard to its assigned cluster.
Its resampling strategy accounts for the over-fitting characteristics due to direct computation of clusters from the observed data
and protects against an anti-conservative bias.
For a large dataset, PAM could be too slow. Consider using cluster::clara and jackstraw::jackstraw_clara.