projects
/
morpheus.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Package v.1.0 ready to be sent to CRAN
[morpheus.git]
/
pkg
/
R
/
utils.R
diff --git
a/pkg/R/utils.R
b/pkg/R/utils.R
index
ff988a0
..
9d026da
100644
(file)
--- a/
pkg/R/utils.R
+++ b/
pkg/R/utils.R
@@
-2,16
+2,20
@@
#'
#' Normalize a vector or a matrix (by columns), using euclidian norm
#'
#'
#' Normalize a vector or a matrix (by columns), using euclidian norm
#'
-#' @param
X
Vector or matrix to be normalized
+#' @param
x
Vector or matrix to be normalized
#'
#'
-#' @return The normalized matrix (1 column if
X
is a vector)
+#' @return The normalized matrix (1 column if
x
is a vector)
#'
#'
+#' @examples
+#' x <- matrix(c(1,2,-1,3), ncol=2)
+#' normalize(x) #column 1 is 1/sqrt(5) (1 2),
+#' #and column 2 is 1/sqrt(10) (-1, 3)
#' @export
#' @export
-normalize = function(
X
)
+normalize = function(
x
)
{
{
-
X = as.matrix(X
)
- norm2 = sqrt( colSums(
X
^2) )
- sweep(
X
, 2, norm2, '/')
+
x = as.matrix(x
)
+ norm2 = sqrt( colSums(
x
^2) )
+ sweep(
x
, 2, norm2, '/')
}
# Computes a tensor-vector product
}
# Computes a tensor-vector product
@@
-70,14
+74,19
@@
normalize = function(X)
#'
#' @return A list L where L[[i]] is the i-th cross-moment
#'
#'
#' @return A list L where L[[i]] is the i-th cross-moment
#'
+#' @examples
+#' X <- matrix(rnorm(100), ncol=2)
+#' Y <- rbinom(100, 1, .5)
+#' M <- computeMoments(X, Y)
+#'
#' @export
computeMoments = function(X, Y)
list( colMeans(Y * X), .Moments_M2(X,Y), .Moments_M3(X,Y) )
# Find the optimal assignment (permutation) between two sets (minimize cost)
#
#' @export
computeMoments = function(X, Y)
list( colMeans(Y * X), .Moments_M2(X,Y), .Moments_M3(X,Y) )
# Find the optimal assignment (permutation) between two sets (minimize cost)
#
-# @param distances The distances matrix, in columns
(distances[i,j] is distance between i
-# and j)
+# @param distances The distances matrix, in columns
+#
(distances[i,j] is distance between i
and j)
#
# @return A permutation minimizing cost
#
#
# @return A permutation minimizing cost
#
@@
-93,7
+102,7
@@
computeMoments = function(X, Y)
#' Align a set of parameters matrices, with potential permutations.
#'
#' @param Ms A list of matrices, all of same size DxK
#' Align a set of parameters matrices, with potential permutations.
#'
#' @param Ms A list of matrices, all of same size DxK
-#' @param ref
Either a reference matrix or "mean" to align on empirical mean
+#' @param ref
A reference matrix to align other matrices with
#' @param ls_mode How to compute the labels assignment: "exact" for exact algorithm
#' (default, but might be time-consuming, complexity is O(K^3) ), or "approx1", or
#' "approx2" to apply a greedy matching algorithm (heuristic) which for each column in
#' @param ls_mode How to compute the labels assignment: "exact" for exact algorithm
#' (default, but might be time-consuming, complexity is O(K^3) ), or "approx1", or
#' "approx2" to apply a greedy matching algorithm (heuristic) which for each column in
@@
-102,30
+111,34
@@
computeMoments = function(X, Y)
#'
#' @return The aligned list (of matrices), of same size as Ms
#'
#'
#' @return The aligned list (of matrices), of same size as Ms
#'
+#' @examples
+#' m1 <- matrix(c(1,1,0,0),ncol=2)
+#' m2 <- matrix(c(0,0,1,1),ncol=2)
+#' ref <- m1
+#' Ms <- list(m1, m2, m1, m2)
+#' a <- alignMatrices(Ms, ref, "exact")
+#' # a[[i]] is expected to contain m1 for all i
+#'
#' @export
#' @export
-alignMatrices = function(Ms, ref, ls_mode)
+alignMatrices = function(Ms, ref, ls_mode
=c("exact","approx1","approx2")
)
{
{
- if (!is.matrix(ref) && ref != "mean")
- stop("ref: matrix or 'mean'")
- if (!ls_mode %in% c("exact","approx1","approx2"))
- stop("ls_mode in {'exact','approx1','approx2'}")
+ if (!is.matrix(ref) || any(is.na(ref)))
+ stop("ref: matrix, no NAs")
+ ls_mode <- match.arg(ls_mode)
K <- ncol(Ms[[1]])
K <- ncol(Ms[[1]])
- if (is.character(ref)) #ref=="mean"
- m_sum = Ms[[1]]
L <- length(Ms)
L <- length(Ms)
- for (i in
ifelse(is.character(ref),2,1)
:L)
+ for (i in
1
:L)
{
{
- m_ref = if (is.character(ref)) m_sum / (i-1) else ref
m = Ms[[i]] #shorthand
if (ls_mode == "exact")
{
#distances[i,j] = distance between m column i and ref column j
m = Ms[[i]] #shorthand
if (ls_mode == "exact")
{
#distances[i,j] = distance between m column i and ref column j
- distances = apply(
m_
ref, 2, function(col) ( sqrt(colSums((m-col)^2)) ) )
+ distances = apply( ref, 2, function(col) ( sqrt(colSums((m-col)^2)) ) )
assignment = .hungarianAlgorithm(distances)
col <- m[,assignment]
assignment = .hungarianAlgorithm(distances)
col <- m[,assignment]
-
if (is.list(Ms)) Ms[[i]] <- col else Ms[,,i
] <- col
+
Ms[[i]
] <- col
}
else
{
}
else
{
@@
-139,31
+152,27
@@
alignMatrices = function(Ms, ref, ls_mode)
if (ls_mode == "approx1")
{
apply(as.matrix(m[,available_indices]), 2,
if (ls_mode == "approx1")
{
apply(as.matrix(m[,available_indices]), 2,
- function(col) ( sqrt(sum((col -
m_
ref[,j])^2)) ) )
+ function(col) ( sqrt(sum((col - ref[,j])^2)) ) )
}
else #approx2
{
}
else #approx2
{
- apply(as.matrix(
m_
ref[,available_indices]), 2,
+ apply(as.matrix(ref[,available_indices]), 2,
function(col) ( sqrt(sum((col - m[,j])^2)) ) )
}
indMin = which.min(distances)
if (ls_mode == "approx1")
{
col <- m[ , available_indices[indMin] ]
function(col) ( sqrt(sum((col - m[,j])^2)) ) )
}
indMin = which.min(distances)
if (ls_mode == "approx1")
{
col <- m[ , available_indices[indMin] ]
-
if (is.list(Ms)) Ms[[i]][,j] <- col else Ms[,j,i
] <- col
+
Ms[[i]][,j
] <- col
}
else #approx2
{
col <- available_indices[indMin]
}
else #approx2
{
col <- available_indices[indMin]
-
if (is.list(Ms)) Ms[[i]][,col] <- m[,j] else Ms[,col,i
] <- m[,j]
+
Ms[[i]][,col
] <- m[,j]
}
available_indices = available_indices[-indMin]
}
}
}
available_indices = available_indices[-indMin]
}
}
-
- # Update current sum with "label-switched" li[[i]]
- if (is.character(ref)) #ref=="mean"
- m_sum = m_sum + Ms[[i]]
}
Ms
}
}
Ms
}