### This file contains major functions for EM iterations.
### E-step.
e.step.dmat <- function(PARAM, update.logL = TRUE){
for(i.k in 1:PARAM$K){
logdmvnorm.dmat(PARAM, i.k)
}
update.expectation.dmat(PARAM, update.logL = update.logL)
invisible()
} # End of e.step.dmat().
### z_nk / sum_k z_n might have numerical problems if z_nk all underflowed.
update.expectation.dmat <- function(PARAM, update.logL = TRUE){
if(exists("X.dmat", envir = .pmclustEnv)){
X.dmat <- get("X.dmat", envir = .pmclustEnv)
}
N <- PARAM$N
K <- PARAM$K
### WCC: original
# .pmclustEnv$U.dmat <- sweep(.pmclustEnv$W.dmat, 2, PARAM$log.ETA, FUN = "+")
### WCC: temp dmat
# tmp.1 <- sweep(.pmclustEnv$W.dmat, 2, PARAM$log.ETA, FUN = "+")
# .pmclustEnv$U.dmat <- tmp.1
### WCC: temp spmd
tmp.1 <- as.matrix(.pmclustEnv$W.dmat)
tmp.2 <- sweep(tmp.1, 2, PARAM$log.ETA, FUN = "+")
.pmclustEnv$U.dmat <- pbdDMAT::as.ddmatrix(tmp.2)
### WCC: original
# .pmclustEnv$Z.dmat <- exp(.pmclustEnv$U.dmat)
### WCC: temp dmat
# tmp.1 <- exp(.pmclustEnv$U.dmat)
# .pmclustEnv$Z.dmat <- tmp.1
### WCC: temp spmd
tmp.1 <- as.matrix(.pmclustEnv$U.dmat)
tmp.2 <- exp(tmp.1)
.pmclustEnv$Z.dmat <- pbdDMAT::as.ddmatrix(tmp.2)
### WCC: original
# tmp.id <- rowSums(.pmclustEnv$U.dmat < .pmclustEnv$CONTROL$exp.min) == K |
# rowSums(.pmclustEnv$U.dmat > .pmclustEnv$CONTROL$exp.max) > 0
# tmp.id <- as.logical(as.vector(tmp.id))
### WCC: temp dmat
tmp.1 <- .pmclustEnv$U.dmat < .pmclustEnv$CONTROL$exp.min
tmp.1 <- as.matrix(tmp.1)
tmp.2 <- rowSums(tmp.1)
tmp.3 <- tmp.2 == K
tmp.4 <- .pmclustEnv$U.dmat > .pmclustEnv$CONTROL$exp.max
tmp.4 <- as.matrix(tmp.4)
tmp.5 <- rowSums(tmp.4)
tmp.6 <- tmp.5 > 0
tmp.7 <- tmp.3 | tmp.6
tmp.8 <- as.vector(tmp.7)
tmp.id <- tmp.8
tmp.id <- as.logical(tmp.id)
tmp.flag <- sum(tmp.id)
if(tmp.flag > 0){
### WCC: original
# tmp.dmat <- .pmclustEnv$U.dmat[tmp.id,]
### WCC: temp spmd
tmp.1 <- as.matrix(.pmclustEnv$U.dmat)
tmp.2 <- tmp.1[tmp.id,]
if(tmp.flag == 1){
tmp.2 <- matrix(tmp.2, nrow = 1)
}
tmp.dmat <- pbdDMAT::as.ddmatrix(tmp.2)
if(tmp.flag == 1){
### WCC: original
# tmp.scale <- max(tmp.dmat) - .pmclustEnv$CONTROL$exp.max / K
# tmp.scale <- as.vector(tmp.scale)
### WCC: temp dmat
# tmp.1 <- max(tmp.dmat)
# tmp.2 <- tmp.1 - .pmclustEnv$CONTROL$exp.max / K
# tmp.3 <- as.vector(tmp.2)
# tmp.scale <- tmp.3
### WCC: temp spmd
tmp.1 <- as.vector(tmp.dmat)
tmp.scale <- max(tmp.1) - .pmclustEnv$CONTROL$exp.max / K
} else{
### WCC: original
# tmp.scale <- apply(tmp.dmat, 1, max) - .pmclustEnv$CONTROL$exp.max / K
# tmp.scale <- as.vector(tmp.scale)
### WCC: temp dmat
# tmp.1 <- apply(tmp.dmat, 1, max)
# tmp.2 <- tmp.1 - .pmclustEnv$CONTROL$exp.max / K
# tmp.3 <- as.vector(tmp.2)
# tmp.scale <- tmp.3
### WCC: temp spmd
tmp.1 <- as.matrix(tmp.dmat)
tmp.scale <- unlist(apply(tmp.1, 1, max)) -
.pmclustEnv$CONTROL$exp.max / K
}
### WCC: original
# .pmclustEnv$Z.dmat[tmp.id,] <- exp(tmp.dmat - tmp.scale)
### WCC: temp dmat
# tmp.1 <- exp(tmp.dmat - tmp.scale)
# .pmclustEnv$Z.dmat[tmp.id,] <- tmp.1
### WCC: temp spmd
tmp.1 <- as.matrix(tmp.dmat)
tmp.1 <- exp(tmp.1 - tmp.scale)
tmp.id <- which(tmp.id)
tmp.2 <- as.matrix(.pmclustEnv$Z.dmat)
tmp.2[tmp.id,] <- tmp.1
.pmclustEnv$Z.dmat <- pbdDMAT::as.ddmatrix(tmp.2)
}
### WCC: original
.pmclustEnv$W.rowSums <- as.vector(rowSums(.pmclustEnv$Z.dmat))
### WCC: temp dmat
# tmp.1 <- rowSums(.pmclustEnv$Z.dmat)
# tmp.2 <- as.vector(tmp.1)
# .pmclustEnv$W.rowSums <- tmp.2
### WCC: temp spmd
# tmp.1 <- as.matrix(.pmclustEnv$Z.dmat)
# .pmclustEnv$W.rowSums <- rowSums(tmp.1)
### WCC: original
# .pmclustEnv$Z.dmat <- .pmclustEnv$Z.dmat / .pmclustEnv$W.rowSums
### WCC: temp spmd
tmp.1 <- as.matrix(.pmclustEnv$Z.dmat)
tmp.2 <- tmp.1 / .pmclustEnv$W.rowSums
.pmclustEnv$Z.dmat <- pbdDMAT::as.ddmatrix(tmp.2)
### For semi-supervised clustering.
# if(SS.clustering){
# .pmclustEnv$Z.spmd[SS.id.spmd,] <- SS..pmclustEnv$Z.spmd
# }
### WCC: original
# .pmclustEnv$Z.colSums <- as.vector(colSums(.pmclustEnv$Z.dmat))
### WCC: temp dmat
# tmp.1 <- colSums(.pmclustEnv$Z.dmat)
# tmp.2 <- as.vector(tmp.1)
# .pmclustEnv$Z.colSums <- tmp.2
### WCC: temp spmd
tmp.1 <- as.matrix(.pmclustEnv$Z.dmat)
.pmclustEnv$Z.colSums <- colSums(tmp.1)
if(update.logL){
.pmclustEnv$W.rowSums <- log(.pmclustEnv$W.rowSums)
if(tmp.flag > 0){
.pmclustEnv$W.rowSums[tmp.id] <-
.pmclustEnv$W.rowSums[tmp.id] + tmp.scale
}
}
invisible()
} # End of update.expectation.dmat().
### M-step.
m.step.dmat <- function(PARAM){
if(exists("X.dmat", envir = .pmclustEnv)){
X.dmat <- get("X.dmat", envir = .pmclustEnv)
}
### MLE For ETA
PARAM$ETA <- .pmclustEnv$Z.colSums / sum(.pmclustEnv$Z.colSums)
PARAM$log.ETA <- log(PARAM$ETA)
p <- PARAM$p
p.2 <- p * p
for(i.k in 1:PARAM$K){
### MLE for MU
### WCC: original
# B <- colSums(X.dmat * as.vector(.pmclustEnv$Z.dmat[, i.k])) /
# .pmclustEnv$Z.colSums[i.k]
# PARAM$MU[, i.k] <- as.vector(B)
### WCC: temp dmat
# tmp.1 <- as.vector(.pmclustEnv$Z.dmat[, i.k])
# tmp.2 <- X.dmat * tmp.1
# tmp.3 <- colSums(tmp.2)
# tmp.4 <- tmp.3 / .pmclustEnv$Z.colSums[i.k]
# tmp.5 <- as.vector(tmp.4)
# PARAM$MU[, i.k] <- tmp.5
### WCC: temp spmd
tmp.1 <- as.matrix(X.dmat)
tmp.2 <- as.matrix(.pmclustEnv$Z.dmat)
B <- colSums(tmp.1 * tmp.2[, i.k]) / .pmclustEnv$Z.colSums[i.k]
PARAM$MU[, i.k] <- as.vector(B)
### MLE for SIGMA
if(PARAM$U.check[[i.k]]){
### WCC: original
# B <- sweep(X.dmat, 2, PARAM$MU[, i.k]) *
# as.vector(sqrt(.pmclustEnv$Z.dmat[, i.k] /
# .pmclustEnv$Z.colSums[i.k]))
### WCC: temp dmat
# tmp.1 <- sweep(X.dmat, 2, PARAM$MU[, i.k])
# tmp.2 <- .pmclustEnv$Z.dmat[, i.k]
# tmp.3 <- tmp.2 / .pmclustEnv$Z.colSums[i.k]
# tmp.4 <- sqrt(tmp.3)
# tmp.5 <- as.vector(tmp.4)
# tmp.6 <- tmp.1 * tmp.5
# B <- tmp.6
### WCC: temp spmd
tmp.1 <- as.matrix(X.dmat)
tmp.2 <- as.matrix(.pmclustEnv$Z.dmat)
B <- sweep(tmp.1, 2, PARAM$MU[, i.k]) *
sqrt(tmp.2[, i.k] / .pmclustEnv$Z.colSums[i.k])
### WCC: original
# tmp.SIGMA <- as.matrix(crossprod(B))
# dim(tmp.SIGMA) <- c(p, p)
### WCC: temp dmat
tmp.1 <- crossprod(B)
tmp.2 <- as.matrix(tmp.1)
tmp.SIGMA <- tmp.2
if(!any(is.nan(tmp.SIGMA))){
dim(tmp.SIGMA) <- c(p, p)
tmp.U <- decompsigma(tmp.SIGMA)
PARAM$U.check[[i.k]] <- tmp.U$check
if(tmp.U$check){
PARAM$U[[i.k]] <- tmp.U$value
PARAM$SIGMA[[i.k]] <- tmp.SIGMA
}
} else{
PARAM$U.check[[i.k]] <- FALSE
if(.pmclustEnv$CONTROL$debug > 2){
comm.cat(" SIGMA[[", i.k, "]] has NaN. Updating is skipped.\n", sep = "", quiet = TRUE)
}
.pmclustEnv$FAIL.i.k <- i.k # i.k is failed to update.
if(.pmclustEnv$CONTROL$stop.at.fail){
stop(paste("NaN occurs at i.k=", i.k, sep = ""))
}
}
} else{
if(.pmclustEnv$CONTROL$debug > 2){
comm.cat(" SIGMA[[", i.k, "]] is fixed. Updating is skipped.\n", sep = "", quiet = TRUE)
}
}
}
PARAM
} # End of m.step.dmat().
### log likelihood.
logL.step.dmat <- function(){
tmp.logL <- sum(.pmclustEnv$W.rowSums)
tmp.logL
} # End of logL.step.dmat().
### EM-step.
em.step.dmat <- function(PARAM.org){
.pmclustEnv$CHECK <- list(algorithm = "em", i.iter = 0, abs.err = Inf,
rel.err = Inf, convergence = 0)
i.iter <- 1
PARAM.org$logL <- -.Machine$double.xmax
### For debugging.
if((!is.null(.pmclustEnv$CONTROL$save.log)) && .pmclustEnv$CONTROL$save.log){
if(! exists("SAVE.iter", envir = .pmclustEnv)){
.pmclustEnv$SAVE.param <- NULL
.pmclustEnv$SAVE.iter <- NULL
.pmclustEnv$CLASS.iter.org <- unlist(apply(.pmclustEnv$Z.dmat, 1,
which.max))
}
}
repeat{
### For debugging.
if((!is.null(.pmclustEnv$CONTROL$save.log)) &&
.pmclustEnv$CONTROL$save.log){
time.start <- proc.time()
}
### This is used to record which i.k may be failed to update.
.pmclustEnv$FAIL.i.k <- 0
### Start EM next in DMAT format.
### WCC: original
PARAM.new <- try(em.onestep.dmat(PARAM.org))
### WCC: temp
# PARAM.new <- em.onestep.dmat(PARAM.org)
if(class(PARAM.new) == "try-error" || is.nan(PARAM.new$logL)){
comm.cat("Results of previous iterations are returned.\n", quiet = TRUE)
.pmclustEnv$CHECK$convergence <- 99
PARAM.new <- PARAM.org
break
}
.pmclustEnv$CHECK <- check.em.convergence(PARAM.org, PARAM.new, i.iter)
if(.pmclustEnv$CHECK$convergence > 0){
break
}
### For debugging.
if((!is.null(.pmclustEnv$CONTROL$save.log)) &&
.pmclustEnv$CONTROL$save.log){
tmp.time <- proc.time() - time.start
.pmclustEnv$SAVE.param <- c(.pmclustEnv$SAVE.param, PARAM.new)
CLASS.iter.new <- unlist(apply(.pmclustEnv$Z.dmat, 1, which.max))
tmp <- as.double(sum(CLASS.iter.new != .pmclustEnv$CLASS.iter.org))
tmp.all <- c(tmp / PARAM.new$N, PARAM.new$logL,
PARAM.new$logL - PARAM.org$logL,
(PARAM.new$logL - PARAM.org$logL) / PARAM.org$logL)
.pmclustEnv$SAVE.iter <- rbind(.pmclustEnv$SAVE.iter,
c(tmp, tmp.all, tmp.time))
.pmclustEnv$CLASS.iter.org <- CLASS.iter.new
}
PARAM.org <- PARAM.new
i.iter <- i.iter + 1
}
PARAM.new
} # End of em.step.dmat().
em.onestep.dmat <- function(PARAM){
# if(.pmclustEnv$COMM.RANK == 0){
# Rprof(filename = "em.Rprof", append = TRUE)
# }
PARAM <- m.step.dmat(PARAM)
e.step.dmat(PARAM)
# if(.pmclustEnv$COMM.RANK == 0){
# Rprof(NULL)
# }
PARAM$logL <- logL.step.dmat()
if(.pmclustEnv$CONTROL$debug > 0){
comm.cat(">>em.onestep: ", format(Sys.time(), "%H:%M:%S"),
", iter: ", .pmclustEnv$CHECK$iter, ", logL: ",
sprintf("%-30.15f", PARAM$logL), "\n",
sep = "", quiet = TRUE)
if(.pmclustEnv$CONTROL$debug > 4){
logL <- indep.logL.dmat(PARAM)
comm.cat(" >>indep.logL: ", sprintf("%-30.15f", logL), "\n",
sep = "", quiet = TRUE)
}
if(.pmclustEnv$CONTROL$debug > 20){
mb.print(PARAM, .pmclustEnv$CHECK)
}
}
PARAM
} # End of em.onestep.dmat().
### Obtain classifications.
em.update.class.dmat <- function(){
### WCC: original
# .pmclustEnv$CLASS.dmat <- apply(.pmclustEnv$Z.dmat, 1, which.max)
### WCC: temp dmat
tmp.1 <- as.matrix(.pmclustEnv$Z.dmat)
tmp.2 <- unlist(apply(tmp.1, 1, which.max))
.pmclustEnv$CLASS <- tmp.2 # This is not a ddmatrix
### WCC: temp spmd
# tmp.1 <- as.matrix(.pmclustEnv$Z.dmat)
# tmp.2 <- matrix(apply(tmp.1, 1, which.max), ncol = 1)
# tmp.3 <- pbdDMAT::as.ddmatrix(tmp.2)
# .pmclustEnv$CLASS.dmat <- tmp.3
invisible()
} # End of em.update.class.dmat().
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.