Nothing
SF.IDX <- function(x, kmax, kmin=2,
method = 'kmeans',
nstart = 100){
if(missing(x))
stop("Missing input argument. A numeric data frame or matrix is required")
if(missing(kmax))
stop("Missing input argument. A maximum number of clusters is required")
if(!is.numeric(kmax))
stop("Argument 'kmax' must be numeric")
if(kmax > nrow(x))
stop("The maximum number of clusters for consideration should be less than or equal to the number of data points in dataset.")
if(!is.numeric(kmin))
stop("Argument 'kmin' must be numeric")
if(kmin <=1)
warning("The minimum number of clusters for consideration should be more than 1",immediate. = TRUE)
if(!any(method == c("kmeans","hclust_complete","hclust_average","hclust_single")))
stop("Argument 'method' should be one of 'kmeans', 'hclust_complete', 'hclust_average', 'hclust_single'")
if(method == "kmeans"){
if(!is.numeric(nstart))
stop("Argument 'nstart' must be numeric")
}
if(startsWith(method,"hclust_")){
H.model = hclust(dist(x),method = sub("hclust_", "", method))
}
sf = vector() #vector defined
for(k in kmin:kmax){
centroid = matrix(0,k,dim(x)[2])
if(method == "kmeans"){
K.model = kmeans(x,k,nstart =nstart)
cluss = K.model$cluster
centroid = K.model$centers
} else if(startsWith(method,"hclust_")){
cluss = cutree(H.model,k)
for (j in 1:k){
if (is.null(nrow(x[cluss==j,])) | sum(nrow(x[cluss==j,]))==1){
centroid[j,] = as.numeric(x[cluss==j,])
} else {
centroid[j,] = colMeans(x[cluss==j,])
}
}
} # End check algorithm
if(!all(seq(k) %in% unique(cluss)))
warning("Some clusters are empty.")
sizecluss = as.vector(table(cluss))
wcdd = vector()
for (i in 1:k){
wcdd[i] = sum(dist(rbind(centroid[i,],x[cluss==i,]))[1:sizecluss[i]])/sizecluss[i]
}
# SF index
bcd = sum(dist(rbind(colMeans(x),centroid))[1:k]*sizecluss)/(dim(x)[1]*k)
wcd = sum(wcdd)
sf[k-kmin+1] = 1-1/exp(bcd+wcd)
}
SF.data = data.frame(cbind("k"=kmin:kmax,"SF"=sf))
return(SF.data)
}
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.