Description Usage Arguments Details Value Author(s) Examples
Smoothed sparse Kmeans
1 2 |
x |
a data matrix of dimension n * p, where n is number of samples to be clustered, p is number of features. |
K |
pre-specified number of clusters |
lambda1 |
tuning parameter for l1 norm lasso penalty. Large lambda1 will induce more feature weights to be 0. |
E |
network structure. E should be a m by 2 matrix, where m is total number of connections (edges) in the graph. For example, if feature 2 and feature 3 are connected in the graph, E[j,] <- c(2, 3). j = 1, ..., m. |
nstart |
number of initialization for Kmeans. |
silent |
if print out progress. |
maxiter |
max number of iterations. |
lambda1 |
tuning parameter for the smoothness of feature selection. Large lambda will induce feature weights to be similar. |
Perform sparse Kmeans to perform sample clustering and feature selection. In feature selection, we also want to incorporate spatio information such that adjacent voxels have similar coefficient.
a list. The following items are included in the list.
ws |
weight for each feature. Zero weight means the feature is not selected. |
Cs |
Cluster Assignment |
wcss |
within cluster sum of square |
crit |
objective value |
E |
network structure |
Caleb
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.