From: Benjamin Auder Date: Mon, 13 Mar 2017 16:45:20 +0000 (+0100) Subject: drop enercast submodule; drop Rcpp requirement; fix doc, complete code, fix fix fix X-Git-Url: https://git.auder.net/variants/%24%7Bvname%7D/doc/rpsls.js?a=commitdiff_plain;h=282342bafdc9ff65c5df98c6e2304d63b33b9fb2;p=epclust.git drop enercast submodule; drop Rcpp requirement; fix doc, complete code, fix fix fix --- diff --git a/.enercast b/.enercast deleted file mode 160000 index 35da9ea..0000000 --- a/.enercast +++ /dev/null @@ -1 +0,0 @@ -Subproject commit 35da9ea4a4caaac6124c0807fb8fcbd8d5e1c7ca diff --git a/.gitmodules b/.gitmodules index 2b8ef9a..16826ed 100644 --- a/.gitmodules +++ b/.gitmodules @@ -4,6 +4,3 @@ [submodule ".nbstripout"] path = .nbstripout url = https://github.com/kynan/nbstripout.git -[submodule ".enercast"] - path = .enercast - url = https://github.com/cugliari/enercast.git diff --git a/biblio/ours/clust-publie.pdf b/biblio/ours/clust-publie.pdf deleted file mode 100644 index 5801a64..0000000 --- a/biblio/ours/clust-publie.pdf +++ /dev/null @@ -1 +0,0 @@ -#$# git-fat 7571c6c3b737bf2f57eab62fea99eb24a756eded 895937 diff --git a/epclust/DESCRIPTION b/epclust/DESCRIPTION index 7fd3410..8e4a51b 100644 --- a/epclust/DESCRIPTION +++ b/epclust/DESCRIPTION @@ -1,10 +1,11 @@ Package: epclust Title: Clustering individual electricity power curves Description: EPCLUST: Electric Power curves CLUSTering, through their wavelets - decomposition. The main method 'epclust' takes (usually long) time-series + decomposition. The main function 'claws' takes (usually long) time-series in input, and return as many clusters centers as requested, along with their - identifiers (if aplicable). Several parameters can be tuned: please refer to the - package vignette. + ranks and synchrones (sum of all curves in one group). + For the method, see ?claws and https://arxiv.org/abs/1101.4744. + For usage examples, see ?claws and package vignette. Version: 0.1-0 Author: Benjamin Auder [aut,cre], Jairo Cugliari [aut], @@ -17,20 +18,15 @@ Imports: methods, parallel, cluster, - wavelets, bigmemory, - Rwave, - Rcpp -LinkingTo: - Rcpp, - BH, - bigmemory + wavelets, + Rwave Suggests: synchronicity, devtools, testthat, + roxygen2, MASS, - clue, wmtsa, DBI, digest @@ -41,5 +37,7 @@ Collate: 'clustering.R' 'de_serialize.R' 'A_NAMESPACE.R' - 'RcppExports.R' + 'computeSynchrones.R' + 'computeWerDists.R' 'plot.R' + 'utils.R' diff --git a/epclust/R/clustering.R b/epclust/R/clustering.R index b91d512..a8f1d3e 100644 --- a/epclust/R/clustering.R +++ b/epclust/R/clustering.R @@ -22,19 +22,20 @@ NULL #' @rdname clustering #' @export -clusteringTask1 = function(indices, getContribs, K1, algoClust1, nb_items_clust, +clusteringTask1 <- function(indices, getContribs, K1, algoClust1, nb_items_clust, ncores_clust=1, verbose=FALSE, parll=TRUE) { if (parll) { - cl = parallel::makeCluster(ncores_clust, outfile = "") + # outfile=="" to see stderr/stdout on terminal + cl <- parallel::makeCluster(ncores_clust, outfile = "") parallel::clusterExport(cl, c("getContribs","K1","verbose"), envir=environment()) } # Iterate clustering algorithm 1 until K1 medoids are found while (length(indices) > K1) { # Balance tasks by splitting the indices set - as evenly as possible - indices_workers = .splitIndices(indices, nb_items_clust, min_size=K1+1) + indices_workers <- .splitIndices(indices, nb_items_clust, min_size=K1+1) if (verbose) cat(paste("*** [iterated] Clustering task 1 on ",length(indices)," series\n", sep="")) indices <- @@ -60,8 +61,8 @@ clusteringTask1 = function(indices, getContribs, K1, algoClust1, nb_items_clust, #' @rdname clustering #' @export -clusteringTask2 = function(indices, getSeries, K2, algoClust2, nb_series_per_chunk, - nvoice, nbytes, endian, ncores_clust=1, verbose=FALSE, parll=TRUE) +clusteringTask2 <- function(indices, getSeries, K2, algoClust2, nb_series_per_chunk, + smooth_lvl, nvoice, nbytes, endian, ncores_clust=1, verbose=FALSE, parll=TRUE) { if (verbose) cat(paste("*** Clustering task 2 on ",length(indices)," medoids\n", sep="")) @@ -70,8 +71,8 @@ clusteringTask2 = function(indices, getSeries, K2, algoClust2, nb_series_per_chu return (indices) # A) Compute the WER distances (Wavelets Extended coefficient of deteRmination) - distances = computeWerDists(indices, getSeries, nb_series_per_chunk, - nvoice, nbytes, endian, ncores_clust, verbose, parll) + distances <- computeWerDists(indices, getSeries, nb_series_per_chunk, + smooth_lvl, nvoice, nbytes, endian, ncores_clust, verbose, parll) # B) Apply clustering algorithm 2 on the WER distances matrix if (verbose) diff --git a/epclust/R/computeSynchrones.R b/epclust/R/computeSynchrones.R index 09ff3a0..16bf0b4 100644 --- a/epclust/R/computeSynchrones.R +++ b/epclust/R/computeSynchrones.R @@ -11,11 +11,11 @@ #' @return A matrix of K synchrones in columns (same length as the series) #' #' @export -computeSynchrones = function(medoids, getSeries, nb_curves, +computeSynchrones <- function(medoids, getSeries, nb_curves, nb_series_per_chunk, ncores_clust=1,verbose=FALSE,parll=TRUE) { # Synchrones computation is embarassingly parallel: compute it by chunks of series - computeSynchronesChunk = function(indices) + computeSynchronesChunk <- function(indices) { if (parll) { @@ -29,12 +29,11 @@ computeSynchrones = function(medoids, getSeries, nb_curves, } # Obtain a chunk of reference series - series_chunk = getSeries(indices) - nb_series_chunk = ncol(series_chunk) + series_chunk <- getSeries(indices) + nb_series_chunk <- ncol(series_chunk) # Get medoids indices for this chunk of series - for (i in seq_len(nb_series_chunk)) - mi[i] <- which.min( colSums( sweep(medoids, 1, series_chunk[,i], '-')^2 ) ) + mi <- assignMedoids(series_chunk, medoids[,]) # Update synchrones using mi above, grouping it by values of mi (in 1...K) # to avoid too many lock/unlock @@ -43,19 +42,19 @@ computeSynchrones = function(medoids, getSeries, nb_curves, # lock / unlock required because several writes at the same time if (parll) synchronicity::lock(m) - synchrones[,i] = synchrones[,i] + rowSums(series_chunk[,mi==i]) + synchrones[,i] <- synchrones[,i] + rowSums(as.matrix(series_chunk[,mi==i])) if (parll) synchronicity::unlock(m) } NULL } - K = ncol(medoids) - L = nrow(medoids) + K <- ncol(medoids) + L <- nrow(medoids) # Use bigmemory (shared==TRUE by default) + synchronicity to fill synchrones in // - synchrones = bigmemory::big.matrix(nrow=L, ncol=K, type="double", init=0.) + synchrones <- bigmemory::big.matrix(nrow=L, ncol=K, type="double", init=0.) # NOTE: synchronicity is only for Linux & MacOS; on Windows: run sequentially - parll = (parll && requireNamespace("synchronicity",quietly=TRUE) + parll <- (parll && requireNamespace("synchronicity",quietly=TRUE) && Sys.info()['sysname'] != "Windows") if (parll) { @@ -63,10 +62,11 @@ computeSynchrones = function(medoids, getSeries, nb_curves, # mutex and big.matrix objects cannot be passed directly: # they will be accessed from their description m_desc <- synchronicity::describe(m) - synchrones_desc = bigmemory::describe(synchrones) + synchrones_desc <- bigmemory::describe(synchrones) medoids <- bigmemory::as.big.matrix(medoids) medoids_desc <- bigmemory::describe(medoids) - cl = parallel::makeCluster(ncores_clust) + # outfile=="" to see stderr/stdout on terminal + cl <- parallel::makeCluster(ncores_clust, outfile="") parallel::clusterExport(cl, envir=environment(), varlist=c("synchrones_desc","m_desc","medoids_desc","getSeries")) } @@ -75,7 +75,7 @@ computeSynchrones = function(medoids, getSeries, nb_curves, cat(paste("--- Compute ",K," synchrones with ",nb_curves," series\n", sep="")) # Balance tasks by splitting 1:nb_curves into groups of size <= nb_series_per_chunk - indices_workers = .splitIndices(seq_len(nb_curves), nb_series_per_chunk) + indices_workers <- .splitIndices(seq_len(nb_curves), nb_series_per_chunk) ignored <- if (parll) parallel::parLapply(cl, indices_workers, computeSynchronesChunk) diff --git a/epclust/R/computeWerDists.R b/epclust/R/computeWerDists.R index a813b8f..061c360 100644 --- a/epclust/R/computeWerDists.R +++ b/epclust/R/computeWerDists.R @@ -10,31 +10,22 @@ #' @return A distances matrix of size K x K where K == length(indices) #' #' @export -computeWerDists = function(indices, getSeries, nb_series_per_chunk, nvoice, nbytes, endian, - ncores_clust=1, verbose=FALSE, parll=TRUE) +computeWerDists <- function(indices, getSeries, nb_series_per_chunk, smooth_lvl, nvoice, + nbytes, endian, ncores_clust=1, verbose=FALSE, parll=TRUE) { n <- length(indices) - L <- length(getSeries(1)) #TODO: not very nice way to get L - noctave = ceiling(log2(L)) #min power of 2 to cover serie range + L <- length(getSeries(1)) #TODO: not very neat way to get L + noctave <- ceiling(log2(L)) #min power of 2 to cover serie range # Since a CWT contains noctave*nvoice complex series, we deduce the number of CWT to # retrieve/put in one chunk. - nb_cwt_per_chunk = max(1, floor(nb_series_per_chunk / (nvoice*noctave*2))) + nb_cwt_per_chunk <- max(1, floor(nb_series_per_chunk / (nvoice*noctave*2))) # Initialize result as a square big.matrix of size 'number of medoids' Xwer_dist <- bigmemory::big.matrix(nrow=n, ncol=n, type="double") - # Generate n(n-1)/2 pairs for WER distances computations - pairs = list() - V = seq_len(n) - for (i in 1:n) - { - V = V[-1] - pairs = c(pairs, lapply(V, function(v) c(i,v))) - } - - cwt_file = ".cwt.bin" + cwt_file <- tempfile(pattern="epclust_cwt.bin_") # Compute the getSeries(indices) CWT, and store the results in the binary file - computeSaveCWT = function(indices) + computeSaveCWT <- function(indices) { if (parll) { @@ -54,42 +45,18 @@ computeWerDists = function(indices, getSeries, nb_series_per_chunk, nvoice, nbyt binarize(ts_cwt, cwt_file, nb_cwt_per_chunk, ",", nbytes, endian) } - if (parll) - { - cl = parallel::makeCluster(ncores_clust) - Xwer_dist_desc <- bigmemory::describe(Xwer_dist) - parallel::clusterExport(cl, varlist=c("parll","nb_cwt_per_chunk","L", - "Xwer_dist_desc","noctave","nvoice","getCWT"), envir=environment()) - } - - if (verbose) - cat(paste("--- Precompute and serialize synchrones CWT\n", sep="")) - - ignored <- - if (parll) - parallel::parLapply(cl, 1:n, computeSaveCWT) - else - lapply(1:n, computeSaveCWT) - # Function to retrieve a synchrone CWT from (binary) file - getCWT = function(index, L) + getCWT <- function(index, L) { flat_cwt <- getDataInFile(index, cwt_file, nbytes, endian) - cwt_length = length(flat_cwt) / 2 - re_part = as.matrix(flat_cwt[1:cwt_length], nrow=L) - im_part = as.matrix(flat_cwt[(cwt_length+1):(2*cwt_length)], nrow=L) + cwt_length <- length(flat_cwt) / 2 + re_part <- as.matrix(flat_cwt[1:cwt_length], nrow=L) + im_part <- as.matrix(flat_cwt[(cwt_length+1):(2*cwt_length)], nrow=L) re_part + 1i * im_part } - - - -#TODO: better repartition here, - - - - # Compute distance between columns i and j in synchrones - computeDistanceIJ = function(pair) + # Compute distance between columns i and j for j>i + computeDistances <- function(i) { if (parll) { @@ -99,40 +66,63 @@ computeWerDists = function(indices, getSeries, nb_series_per_chunk, nvoice, nbyt Xwer_dist <- bigmemory::attach.big.matrix(Xwer_dist_desc) } - i = pair[1] ; j = pair[2] - if (verbose && j==i+1 && !parll) - cat(paste(" Distances (",i,",",j,"), (",i,",",j+1,") ...\n", sep="")) + if (verbose && !parll) + cat(paste(" Distances from ",i," to ",i+1,"...",n,"\n", sep="")) - # Compute CWT of columns i and j in synchrones + # Get CWT of column i, and run computations for columns j>i cwt_i <- getCWT(i, L) - cwt_j <- getCWT(j, L) + WX <- filterMA(Mod(cwt_i * Conj(cwt_i)), smooth_lvl) + + for (j in (i+1):n) + { + cwt_j <- getCWT(j, L) - # Compute the ratio of integrals formula 5.6 for WER^2 - # in https://arxiv.org/abs/1101.4744v2 §5.3 - num <- filterMA(Mod(cwt_i * Conj(cwt_j))) - WX <- filterMA(Mod(cwt_i * Conj(cwt_i))) - WY <- filterMA(Mod(cwt_j * Conj(cwt_j))) - wer2 <- sum(colSums(num)^2) / sum(colSums(WX) * colSums(WY)) + # Compute the ratio of integrals formula 5.6 for WER^2 + # in https://arxiv.org/abs/1101.4744v2 §5.3 + num <- filterMA(Mod(cwt_i * Conj(cwt_j)), smooth_lvl) + WY <- filterMA(Mod(cwt_j * Conj(cwt_j)), smooth_lvl) + wer2 <- sum(colSums(num)^2) / sum(colSums(WX) * colSums(WY)) - Xwer_dist[i,j] <- sqrt(L * ncol(cwt_i) * (1 - wer2)) - Xwer_dist[j,i] <- Xwer_dist[i,j] + Xwer_dist[i,j] <- sqrt(L * ncol(cwt_i) * (1 - wer2)) + Xwer_dist[j,i] <- Xwer_dist[i,j] + } Xwer_dist[i,i] <- 0. } + if (parll) + { + # outfile=="" to see stderr/stdout on terminal + cl <- parallel::makeCluster(ncores_clust, outfile="") + Xwer_dist_desc <- bigmemory::describe(Xwer_dist) + parallel::clusterExport(cl, varlist=c("parll","nb_cwt_per_chunk","n","L", + "Xwer_dist_desc","noctave","nvoice","getCWT"), envir=environment()) + } + + if (verbose) + cat(paste("--- Precompute and serialize synchrones CWT\n", sep="")) + + # Split indices by packets of length at most nb_cwt_per_chunk + indices_cwt <- .splitIndices(seq_len(n), nb_cwt_per_chunk) + ignored <- + if (parll) + parallel::parLapply(cl, indices_cwt, computeSaveCWT) + else + lapply(indices_cwt, computeSaveCWT) + if (verbose) cat(paste("--- Compute WER distances\n", sep="")) ignored <- if (parll) - parallel::parLapply(cl, pairs, computeDistanceIJ) + parallel::parLapply(cl, seq_len(n-1), computeDistances) else - lapply(pairs, computeDistanceIJ) + lapply(seq_len(n-1), computeDistances) + Xwer_dist[n,n] <- 0. if (parll) parallel::stopCluster(cl) - unlink(cwt_file) + unlink(cwt_file) #remove binary file - Xwer_dist[n,n] = 0. Xwer_dist[,] #~small matrix K1 x K1 } diff --git a/epclust/R/de_serialize.R b/epclust/R/de_serialize.R index f28038b..eba6772 100644 --- a/epclust/R/de_serialize.R +++ b/epclust/R/de_serialize.R @@ -27,35 +27,35 @@ NULL #' @rdname de_serialize #' @export -binarize = function(data_ascii, data_bin_file, nb_per_chunk, +binarize <- function(data_ascii, data_bin_file, nb_per_chunk, sep=",", nbytes=4, endian=.Platform$endian) { # data_ascii can be of two types: [big.]matrix, or connection if (is.character(data_ascii)) - data_ascii = file(data_ascii, open="r") + data_ascii <- file(data_ascii, open="r") else if (methods::is(data_ascii,"connection") && !isOpen(data_ascii)) open(data_ascii) - is_matrix = !methods::is(data_ascii,"connection") + is_matrix <- !methods::is(data_ascii,"connection") # At first call, the length of a stored row is written. So it's important to determine # if the serialization process already started. - first_write = (!file.exists(data_bin_file) || file.info(data_bin_file)$size == 0) + first_write <- (!file.exists(data_bin_file) || file.info(data_bin_file)$size == 0) # Open the binary file for writing (or 'append' if already exists) - data_bin = file(data_bin_file, open=ifelse(first_write,"wb","ab")) + data_bin <- file(data_bin_file, open=ifelse(first_write,"wb","ab")) if (first_write) { # Write data length on first call: number of items always on 8 bytes writeBin(0L, data_bin, size=8, endian=endian) if (is_matrix) - data_length = nrow(data_ascii) + data_length <- nrow(data_ascii) else #connection { # Read the first line to know data length, and write it then - data_line = scan(data_ascii, double(), sep=sep, nlines=1, quiet=TRUE) + data_line <- scan(data_ascii, double(), sep=sep, nlines=1, quiet=TRUE) writeBin(data_line, data_bin, size=nbytes, endian=endian) - data_length = length(data_line) + data_length <- length(data_line) } } @@ -63,21 +63,21 @@ binarize = function(data_ascii, data_bin_file, nb_per_chunk, { # Data is processed by chunks; although this may not be so useful for (normal) matrix # input, it could for a file-backed big.matrix. It's easier to follow a unified pattern. - index = 1 + index <- 1 } repeat { if (is_matrix) { - data_chunk = + data_chunk <- if (index <= ncol(data_ascii)) as.double(data_ascii[,index:min(ncol(data_ascii),index+nb_per_chunk-1)]) else double(0) - index = index + nb_per_chunk + index <- index + nb_per_chunk } else #connection - data_chunk = scan(data_ascii, double(), sep=sep, nlines=nb_per_chunk, quiet=TRUE) + data_chunk <- scan(data_ascii, double(), sep=sep, nlines=nb_per_chunk, quiet=TRUE) # Data size is unknown in the case of a connection if (length(data_chunk)==0) @@ -89,8 +89,8 @@ binarize = function(data_ascii, data_bin_file, nb_per_chunk, if (first_write) { - # Write data_length, = (file_size-1) / (nbytes*nbWritten) at offset 0 in data_bin - ignored = seek(data_bin, 0) + # Write data_length, == (file_size-1) / (nbytes*nbWritten) at offset 0 in data_bin + ignored <- seek(data_bin, 0) writeBin(data_length, data_bin, size=8, endian=endian) } close(data_bin) @@ -101,47 +101,47 @@ binarize = function(data_ascii, data_bin_file, nb_per_chunk, #' @rdname de_serialize #' @export -binarizeTransform = function(getData, transform, data_bin_file, nb_per_chunk, +binarizeTransform <- function(getData, transform, data_bin_file, nb_per_chunk, nbytes=4, endian=.Platform$endian) { - nb_items = 0 #side-effect: store the number of transformed items - index = 1 + nb_items <- 0 #side-effect: store the number of transformed items + index <- 1 repeat { # Retrieve a chunk of data in a binary file (generally obtained by binarize()) - data_chunk = getData((index-1)+seq_len(nb_per_chunk)) + data_chunk <- getData((index-1)+seq_len(nb_per_chunk)) if (is.null(data_chunk)) break # Apply transformation on the current chunk (by columns) - transformed_chunk = transform(data_chunk) + transformed_chunk <- transform(data_chunk) # Save the result in binary format binarize(transformed_chunk, data_bin_file, nb_per_chunk, ",", nbytes, endian) - index = index + nb_per_chunk - nb_items = nb_items + ncol(data_chunk) + index <- index + nb_per_chunk + nb_items <- nb_items + ncol(data_chunk) } nb_items #number of transformed items } #' @rdname de_serialize #' @export -getDataInFile = function(indices, data_bin_file, nbytes=4, endian=.Platform$endian) +getDataInFile <- function(indices, data_bin_file, nbytes=4, endian=.Platform$endian) { - data_bin = file(data_bin_file, "rb") #source binary file + data_bin <- file(data_bin_file, "rb") #source binary file - data_size = file.info(data_bin_file)$size #number of bytes in the file + data_size <- file.info(data_bin_file)$size #number of bytes in the file # data_length: length of a vector in the binary file (first element, 8 bytes) - data_length = readBin(data_bin, "integer", n=1, size=8, endian=endian) + data_length <- readBin(data_bin, "integer", n=1, size=8, endian=endian) # Seek all 'indices' columns in the binary file, using data_length and nbytes # to compute the offset ( index i at 8 + i*data_length*nbytes ) - data_ascii = do.call( cbind, lapply( indices, function(i) { - offset = 8+(i-1)*data_length*nbytes + data_ascii <- do.call( cbind, lapply( indices, function(i) { + offset <- 8+(i-1)*data_length*nbytes if (offset >= data_size) return (NULL) - ignored = seek(data_bin, offset) #position cursor at computed offset + ignored <- seek(data_bin, offset) #position cursor at computed offset readBin(data_bin, "double", n=data_length, size=nbytes, endian=endian) } ) ) close(data_bin) diff --git a/epclust/R/main.R b/epclust/R/main.R index ce650ff..00d2a88 100644 --- a/epclust/R/main.R +++ b/epclust/R/main.R @@ -59,6 +59,7 @@ #' @param contrib_type Type of contribution: "relative", "logit" or "absolute" (any prefix) #' @param WER "end" to apply stage 2 after stage 1 has fully iterated, or "mix" to apply #' stage 2 at the end of each task +#' @param smooth_lvl Smoothing level: odd integer, 1 == no smoothing. 3 seems good #' @param nvoice Number of voices within each octave for CWT computations #' @param random TRUE (default) for random chunks repartition #' @param ntasks Number of tasks (parallel iterations to obtain K1 [if WER=="end"] @@ -89,19 +90,19 @@ #' # WER distances computations are too long for CRAN (for now) #' #' # Random series around cos(x,2x,3x)/sin(x,2x,3x) -#' x = seq(0,500,0.05) -#' L = length(x) #10001 -#' ref_series = matrix( c(cos(x),cos(2*x),cos(3*x),sin(x),sin(2*x),sin(3*x)), ncol=6 ) +#' x <- seq(0,500,0.05) +#' L <- length(x) #10001 +#' ref_series <- matrix( c(cos(x),cos(2*x),cos(3*x),sin(x),sin(2*x),sin(3*x)), ncol=6 ) #' library(wmtsa) -#' series = do.call( cbind, lapply( 1:6, function(i) +#' series <- do.call( cbind, lapply( 1:6, function(i) #' do.call(cbind, wmtsa::wavBootstrap(ref_series[,i], n.realization=400)) ) ) #' #dim(series) #c(2400,10001) -#' res_ascii = claws(series, K1=60, K2=6, 200, verbose=TRUE) +#' res_ascii <- claws(series, K1=60, K2=6, 200, verbose=TRUE) #' #' # Same example, from CSV file -#' csv_file = "/tmp/epclust_series.csv" +#' csv_file <- "/tmp/epclust_series.csv" #' write.table(series, csv_file, sep=",", row.names=FALSE, col.names=FALSE) -#' res_csv = claws(csv_file, K1=60, K2=6, 200) +#' res_csv <- claws(csv_file, K1=60, K2=6, 200) #' #' # Same example, from binary file #' bin_file <- "/tmp/epclust_series.bin" @@ -119,9 +120,9 @@ #' # Prepare data.frame in DB-format #' n <- nrow(series) #' time_values <- data.frame( -#' id = rep(1:n,each=L), -#' time = rep( as.POSIXct(1800*(0:n),"GMT",origin="2001-01-01"), L ), -#' value = as.double(t(series)) ) +#' id <- rep(1:n,each=L), +#' time <- rep( as.POSIXct(1800*(0:n),"GMT",origin="2001-01-01"), L ), +#' value <- as.double(t(series)) ) #' dbWriteTable(series_db, "times_values", times_values) #' # Fill associative array, map index to identifier #' indexToID_inDB <- as.character( @@ -139,7 +140,7 @@ #' else #' NULL #' } -#' res_db = claws(getSeries, K1=60, K2=6, 200)) +#' res_db <- claws(getSeries, K1=60, K2=6, 200)) #' dbDisconnect(series_db) #' #' # All results should be the same: @@ -153,8 +154,8 @@ claws <- function(series, K1, K2, nb_series_per_chunk, nb_items_clust=7*K1, algoClust1=function(data,K) cluster::pam(t(data),K,diss=FALSE,pamonce=1)$id.med, algoClust2=function(dists,K) cluster::pam(dists,K,diss=TRUE,pamonce=1)$id.med, - wav_filt="d8", contrib_type="absolute", WER="end", nvoice=4, random=TRUE, - ntasks=1, ncores_tasks=1, ncores_clust=4, sep=",", nbytes=4, + wav_filt="d8", contrib_type="absolute", WER="end", smooth_lvl=3, nvoice=4, + random=TRUE, ntasks=1, ncores_tasks=1, ncores_clust=3, sep=",", nbytes=4, endian=.Platform$endian, verbose=FALSE, parll=TRUE) { # Check/transform arguments @@ -169,10 +170,10 @@ claws <- function(series, K1, K2, nb_series_per_chunk, nb_items_clust=7*K1, nb_series_per_chunk <- .toInteger(nb_series_per_chunk, function(x) x>=1) nb_items_clust <- .toInteger(nb_items_clust, function(x) x>K1) random <- .toLogical(random) - tryCatch( {ignored <- wavelets::wt.filter(wav_filt)}, - error = function(e) stop("Invalid wavelet filter; see ?wavelets::wt.filter") ) - ctypes = c("relative","absolute","logit") - contrib_type = ctypes[ pmatch(contrib_type,ctypes) ] + tryCatch({ignored <- wavelets::wt.filter(wav_filt)}, + error=function(e) stop("Invalid wavelet filter; see ?wavelets::wt.filter") ) + ctypes <- c("relative","absolute","logit") + contrib_type <- ctypes[ pmatch(contrib_type,ctypes) ] if (is.na(contrib_type)) stop("'contrib_type' in {'relative','absolute','logit'}") if (WER!="end" && WER!="mix") @@ -194,48 +195,48 @@ claws <- function(series, K1, K2, nb_series_per_chunk, nb_items_clust=7*K1, { if (verbose) cat("...Serialize time-series (or retrieve past binary file)\n") - series_file = ".series.epclust.bin" + series_file <- ".series.epclust.bin" if (!file.exists(series_file)) binarize(series, series_file, nb_series_per_chunk, sep, nbytes, endian) - getSeries = function(inds) getDataInFile(inds, series_file, nbytes, endian) + getSeries <- function(inds) getDataInFile(inds, series_file, nbytes, endian) } else - getSeries = series + getSeries <- series # Serialize all computed wavelets contributions into a file - contribs_file = ".contribs.epclust.bin" - index = 1 - nb_curves = 0 + contribs_file <- ".contribs.epclust.bin" + index <- 1 + nb_curves <- 0 if (verbose) cat("...Compute contributions and serialize them (or retrieve past binary file)\n") if (!file.exists(contribs_file)) { - nb_curves = binarizeTransform(getSeries, + nb_curves <- binarizeTransform(getSeries, function(curves) curvesToContribs(curves, wav_filt, contrib_type), contribs_file, nb_series_per_chunk, nbytes, endian) } else { # TODO: duplicate from getDataInFile() in de_serialize.R - contribs_size = file.info(contribs_file)$size #number of bytes in the file - contrib_length = readBin(contribs_file, "integer", n=1, size=8, endian=endian) - nb_curves = (contribs_size-8) / (nbytes*contrib_length) + contribs_size <- file.info(contribs_file)$size #number of bytes in the file + contrib_length <- readBin(contribs_file, "integer", n=1, size=8, endian=endian) + nb_curves <- (contribs_size-8) / (nbytes*contrib_length) } - getContribs = function(indices) getDataInFile(indices, contribs_file, nbytes, endian) + getContribs <- function(indices) getDataInFile(indices, contribs_file, nbytes, endian) # A few sanity checks: do not continue if too few data available. if (nb_curves < K2) stop("Not enough data: less series than final number of clusters") - nb_series_per_task = round(nb_curves / ntasks) + nb_series_per_task <- round(nb_curves / ntasks) if (nb_series_per_task < K2) stop("Too many tasks: less series in one task than final number of clusters") # Generate a random permutation of 1:N (if random==TRUE); # otherwise just use arrival (storage) order. - indices_all = if (random) sample(nb_curves) else seq_len(nb_curves) + indices_all <- if (random) sample(nb_curves) else seq_len(nb_curves) # Split (all) indices into ntasks groups of ~same size - indices_tasks = lapply(seq_len(ntasks), function(i) { - upper_bound = ifelse( i clusteringTask1(...) --> K1 medoids (indices) # stage 2: K1 indices --> K1xK1 WER distances --> clusteringTask2(...) --> K2 medoids, - # where n = N / ntasks, N being the total number of curves. - runTwoStepClustering = function(inds) + # where n == N / ntasks, N being the total number of curves. + runTwoStepClustering <- function(inds) { # When running in parallel, the environment is blank: we need to load the required # packages, and pass useful variables. if (parll && ntasks>1) require("epclust", quietly=TRUE) - indices_medoids = clusteringTask1(inds, getContribs, K1, algoClust1, + indices_medoids <- clusteringTask1(inds, getContribs, K1, algoClust1, nb_items_clust, ncores_clust, verbose, parll) if (WER=="mix") { - indices_medoids = clusteringTask2(indices_medoids, getSeries, K2, algoClust2, - nb_series_per_chunk, nvoice, nbytes, endian, ncores_clust, verbose, parll) + indices_medoids <- clusteringTask2(indices_medoids, getSeries, K2, algoClust2, + nb_series_per_chunk,smooth_lvl,nvoice,nbytes,endian,ncores_clust,verbose,parll) } indices_medoids } if (verbose) { - message = paste("...Run ",ntasks," x stage 1", sep="") + message <- paste("...Run ",ntasks," x stage 1", sep="") if (WER=="mix") - message = paste(message," + stage 2", sep="") + message <- paste(message," + stage 2", sep="") cat(paste(message,"\n", sep="")) } @@ -304,15 +305,15 @@ claws <- function(series, K1, K2, nb_series_per_chunk, nb_items_clust=7*K1, # Run last clustering tasks to obtain only K2 medoids indices if (verbose) cat("...Run final // stage 1 + stage 2\n") - indices_medoids = clusteringTask1(indices_medoids_all, getContribs, K1, algoClust1, + indices_medoids <- clusteringTask1(indices_medoids_all, getContribs, K1, algoClust1, nb_items_clust, ncores_tasks*ncores_clust, verbose, parll) - indices_medoids = clusteringTask2(indices_medoids, getContribs, K2, algoClust2, - nb_series_per_chunk, nvoice, nbytes, endian, ncores_last_stage, verbose, parll) + indices_medoids <- clusteringTask2(indices_medoids, getContribs, K2, algoClust2, + nb_series_per_chunk,smooth_lvl,nvoice,nbytes,endian,ncores_last_stage,verbose,parll) # Compute synchrones, that is to say the cumulated power consumptions for each of the K2 # final groups. - medoids = getSeries(indices_medoids) - synchrones = computeSynchrones(medoids, getSeries, nb_curves, nb_series_per_chunk, + medoids <- getSeries(indices_medoids) + synchrones <- computeSynchrones(medoids, getSeries, nb_curves, nb_series_per_chunk, ncores_last_stage, verbose, parll) # NOTE: no need to use big.matrix here, since there are only K2 << K1 << N remaining curves diff --git a/epclust/R/utils.R b/epclust/R/utils.R index e79c009..1e4ea30 100644 --- a/epclust/R/utils.R +++ b/epclust/R/utils.R @@ -4,8 +4,8 @@ errWarn <- function(ignored) paste("Cannot convert argument' ",substitute(x),"' to integer", sep="") if (!is.integer(x)) - tryCatch({x = as.integer(x)[1]; if (is.na(x)) stop()}, - warning = errWarn, error = errWarn) + tryCatch({x <- as.integer(x)[1]; if (is.na(x)) stop()}, + warning=errWarn, error=errWarn) if (!condition(x)) { stop(paste("Argument '",substitute(x), @@ -20,8 +20,8 @@ errWarn <- function(ignored) paste("Cannot convert argument' ",substitute(x),"' to logical", sep="") if (!is.logical(x)) - tryCatch({x = as.logical(x)[1]; if (is.na(x)) stop()}, - warning = errWarn, error = errWarn) + tryCatch({x <- as.logical(x)[1]; if (is.na(x)) stop()}, + warning=errWarn, error=errWarn) x } @@ -36,42 +36,43 @@ #' @return A matrix of size log(L) x n containing contributions in columns #' #' @export -curvesToContribs = function(series, wav_filt, contrib_type) +curvesToContribs <- function(series, wav_filt, contrib_type) { - L = nrow(series) - D = ceiling( log2(L) ) + series <- as.matrix(series) + L <- nrow(series) + D <- ceiling( log2(L) ) # Series are interpolated to all have length 2^D - nb_sample_points = 2^D + nb_sample_points <- 2^D apply(series, 2, function(x) { - interpolated_curve = spline(1:L, x, n=nb_sample_points)$y - W = wavelets::dwt(interpolated_curve, filter=wav_filt, D)@W + interpolated_curve <- spline(1:L, x, n=nb_sample_points)$y + W <- wavelets::dwt(interpolated_curve, filter=wav_filt, D)@W # Compute the sum of squared discrete wavelet coefficients, for each scale - nrj = rev( sapply( W, function(v) ( sqrt( sum(v^2) ) ) ) ) + nrj <- rev( sapply( W, function(v) ( sqrt( sum(v^2) ) ) ) ) if (contrib_type!="absolute") - nrj = nrj / sum(nrj) + nrj <- nrj / sum(nrj) if (contrib_type=="logit") - nrj = - log(1 - nrj) - nrj + nrj <- - log(1 - nrj) + unname( nrj ) }) } # Helper function to divide indices into balanced sets. # Ensure that all indices sets have at least min_size elements. -.splitIndices = function(indices, nb_per_set, min_size=1) +.splitIndices <- function(indices, nb_per_set, min_size=1) { - L = length(indices) - nb_workers = floor( L / nb_per_set ) - rem = L %% nb_per_set + L <- length(indices) + nb_workers <- floor( L / nb_per_set ) + rem <- L %% nb_per_set if (nb_workers == 0 || (nb_workers==1 && rem==0)) { # L <= nb_per_set, simple case return (list(indices)) } - indices_workers = lapply( seq_len(nb_workers), function(i) + indices_workers <- lapply( seq_len(nb_workers), function(i) indices[(nb_per_set*(i-1)+1):(nb_per_set*i)] ) - rem = L %% nb_per_set #number of remaining unassigned items + rem <- L %% nb_per_set #number of remaining unassigned items if (rem == 0) return (indices_workers) @@ -81,18 +82,36 @@ curvesToContribs = function(series, wav_filt, contrib_type) # get lower min_size (failure). while (length(rem) < min_size) { - index = length(rem) %% nb_workers + 1 + index <- length(rem) %% nb_workers + 1 if (length(indices_workers[[index]]) <= min_size) { stop("Impossible to split indices properly for clustering. Try increasing nb_items_clust or decreasing K1") } - rem = c(rem, tail(indices_workers[[index]],1)) - indices_workers[[index]] = head( indices_workers[[index]], -1) + rem <- c(rem, tail(indices_workers[[index]],1)) + indices_workers[[index]] <- head( indices_workers[[index]], -1) } return ( c(indices_workers, list(rem) ) ) } +#' assignMedoids +#' +#' Find the closest medoid for each curve in input (by-columns matrix) +#' +#' @param curves (Chunk) of series whose medoids indices must be found +#' @param medoids Matrix of medoids (in columns) +#' +#' @return The vector of integer assignments +#' @export +assignMedoids <- function(curves, medoids) +{ + nb_series <- ncol(curves) + mi <- rep(NA,nb_series) + for (i in seq_len(nb_series)) + mi[i] <- which.min( colSums( sweep(medoids, 1, curves[,i], '-')^2 ) ) + mi +} + #' filterMA #' #' Filter [time-]series by replacing all values by the moving average of values @@ -103,7 +122,7 @@ curvesToContribs = function(series, wav_filt, contrib_type) #' #' @return The filtered matrix (in columns), of same size as the input #' @export -filterMA = function(M_, w_) +filterMA <- function(M_, w_) .Call("filterMA", M_, w_, PACKAGE="epclust") #' cleanBin @@ -114,7 +133,7 @@ filterMA = function(M_, w_) #' @export cleanBin <- function() { - bin_files = list.files(pattern = "*.epclust.bin", all.files=TRUE) + bin_files <- list.files(pattern="*.epclust.bin", all.files=TRUE) for (file in bin_files) unlink(file) } diff --git a/epclust/man/epclust-package.Rd b/epclust/man/epclust-package.Rd index c6bfac0..f991746 100644 --- a/epclust/man/epclust-package.Rd +++ b/epclust/man/epclust-package.Rd @@ -12,11 +12,25 @@ } \details{ - The package devtools should be useful in development stage, since we rely on testthat for - unit tests, and roxygen2 for documentation. knitr is used to generate the package vignette. - Concerning the other suggested packages, 'parallel' can speed up (...TODO...) - - The main function is located in R/main.R: it runs the clustering task (TODO: explain more). + Non-R-base dependencies: + \itemize{ + \item cluster: for PAM algorithm + \item bigmemory: to share (big) matrices between processes + \item wavelets: to compute curves contributions using DWT + \item Rwave: to compute the CWT + } + + Suggested packages: + \itemize{ + \item synchronicity: to compute synchrones in // (concurrent writes) + \item devtools,testthat,roxygen2: development environment (doc, reload, test...) + \item MASS: generate multivariate gaussian samples in tests + \item wmtsa: generate sample curves for \code{claws} examples + \item DBI: for the example with series in an SQLite DB + \item digest: to compare \code{claws} examples results + } + + The package vignette was generated with Jupyter, outside R packaging flow. } \author{ @@ -24,11 +38,3 @@ Maintainer: \packageMaintainer{epclust} } - -%\references{ -% TODO: Literature or other references for background information -%} - -%\examples{ -% TODO: simple examples of the most important functions -%} diff --git a/epclust/src/filter.c b/epclust/src/filter.c index 97dbef2..8ece9c3 100644 --- a/epclust/src/filter.c +++ b/epclust/src/filter.c @@ -12,59 +12,59 @@ // @return The filtered matrix, of same size as the input SEXP filterMA(SEXP M_, SEXP w_) { - int L = INTEGER(getAttrib(cwt_, R_DimSymbol))[0], - D = INTEGER(getAttrib(cwt_, R_DimSymbol))[1], + int L = INTEGER(getAttrib(M_, R_DimSymbol))[0], + D = INTEGER(getAttrib(M_, R_DimSymbol))[1], w = INTEGER_VALUE(w_), half_w = (w-1)/2, i, nt; //number of terms in the current sum (max: w) - double *cwt = REAL(cwt_), + double *M = REAL(M_), cs, //current sum (max: w terms) left; //leftward term in the current moving sum - SEXP fcwt_; //the filtered result - PROTECT(fcwt_ = allocMatrix(REALSXP, L, D)); - double* fcwt = REAL(fcwt_); //pointer to the encapsulated vector + SEXP fM_; //the filtered result + PROTECT(fM_ = allocMatrix(REALSXP, L, D)); + double* fM = REAL(fM_); //pointer to the encapsulated vector // NOTE: unused loop parameter: shifting at the end of the loop is more efficient for (int col=D-1; col>=0; col--) { // Initialization nt = half_w + 1; - left = cwt[0]; + left = M[0]; cs = 0.; for (i=half_w; i>=0; i--) - cs += cwt[i]; + cs += M[i]; // Left border for (i=0; i0) as.matrix(series[,indices]) else NULL } - wf = "haar" - ctype = "absolute" - getContribs = function(indices) curvesToContribs(as.matrix(series[,indices]),wf,ctype) + wf <- "haar" + ctype <- "absolute" + getContribs <- function(indices) curvesToContribs(as.matrix(series[,indices]),wf,ctype) require("cluster", quietly=TRUE) - algoClust1 = function(contribs,K) cluster::pam(t(contribs),K,diss=FALSE)$id.med - indices1 = clusteringTask1(1:n, getContribs, K1, algoClust1, 75, verbose=TRUE, parll=FALSE) - medoids_K1 = getSeries(indices1) + algoClust1 <- function(contribs,K) cluster::pam(t(contribs),K,diss=FALSE)$id.med + indices1 <- clusteringTask1(1:n, getContribs, K1, algoClust1, 140, verbose=TRUE, parll=FALSE) + medoids_K1 <- getSeries(indices1) expect_equal(dim(medoids_K1), c(L,K1)) # Not easy to evaluate result: at least we expect it to be better than random selection of # medoids within initial series - distor_good = computeDistortion(series, medoids_K1) + distor_good <- computeDistortion(series, medoids_K1) for (i in 1:3) expect_lte( distor_good, computeDistortion(series,series[,sample(1:n, K1)]) ) }) test_that("clusteringTask2 behave as expected", { - skip("Unexplained failure") - # Same 60 reference sinusoïdal series than in clusteringTask1 test, # but this time we consider them as medoids - skipping stage 1 # Here also we sample 900 series around the 60 "medoids" - n = 900 - x = seq(0,9.5,0.1) - L = length(x) #96 1/4h - K1 = 60 - K2 = 3 + n <- 900 + x <- seq(0,9.5,0.1) + L <- length(x) #96 1/4h + K1 <- 60 + K2 <- 3 #for (i in 1:60) {plot(x^(1+i/30)*cos(x+i),type="l",col=i,ylim=c(-50,50)); par(new=TRUE)} - s = lapply( seq_len(K1), function(i) x^(1+i/30)*cos(x+i) ) - series = matrix(nrow=L, ncol=n) + s <- lapply( seq_len(K1), function(i) x^(1+i/30)*cos(x+i) ) + series <- matrix(nrow=L, ncol=n) for (i in seq_len(n)) - series[,i] = s[[I(i,K1)]] + rnorm(L,sd=0.01) + series[,i] <- s[[I(i,K1)]] + rnorm(L,sd=0.01) - getRefSeries = function(indices) { - indices = indices[indices <= n] + getSeries <- function(indices) { + indices <- indices[indices <= n] if (length(indices)>0) as.matrix(series[,indices]) else NULL } - # Perfect situation: all medoids "after stage 1" are good. - medoids_K1 = bigmemory::as.big.matrix( sapply( 1:K1, function(i) s[[I(i,K1)]] ) ) - algoClust2 = function(dists,K) cluster::pam(dists,K,diss=TRUE)$id.med - medoids_K2 = clusteringTask2(medoids_K1, K2, algoClust2, getRefSeries, - n, 75, 4, 8, "little", verbose=TRUE, parll=FALSE) + # Perfect situation: all medoids "after stage 1" are ~good + algoClust2 <- function(dists,K) cluster::pam(dists,K,diss=TRUE)$id.med + indices2 <- clusteringTask2(1:K1, getSeries, K2, algoClust2, 210, 3, 4, 8, "little", + verbose=TRUE, parll=FALSE) + medoids_K2 <- getSeries(indices2) expect_equal(dim(medoids_K2), c(L,K2)) # Not easy to evaluate result: at least we expect it to be better than random selection of # synchrones within 1...K1 (from where distances computations + clustering was run) - synchrones = computeSynchrones(medoids_K1,getRefSeries,n,75,verbose=FALSE,parll=FALSE) - distor_good = computeDistortion(synchrones, medoids_K2) - for (i in 1:3) - expect_lte( distor_good, computeDistortion(synchrones, synchrones[,sample(1:K1,3)]) ) + distor_good <- computeDistortion(series, medoids_K2) +#TODO: This fails; why? +# for (i in 1:3) +# expect_lte( distor_good, computeDistortion(series, series[,sample(1:K1,3)]) ) }) - -# Compute the sum of (normalized) sum of squares of closest distances to a medoid. -# Note: medoids can be a big.matrix -computeDistortion = function(series, medoids) -{ - if (bigmemory::is.big.matrix(medoids)) - medoids = medoids[,] #extract standard matrix - - n = ncol(series) ; L = nrow(series) - distortion = 0. - for (i in seq_len(n)) - distortion = distortion + min( colSums( sweep(medoids,1,series[,i],'-')^2 ) / L ) - - sqrt( distortion / n ) -} diff --git a/epclust/tests/testthat/test-computeSynchrones.R b/epclust/tests/testthat/test-computeSynchrones.R index db139ed..60d885e 100644 --- a/epclust/tests/testthat/test-computeSynchrones.R +++ b/epclust/tests/testthat/test-computeSynchrones.R @@ -4,28 +4,27 @@ test_that("computeSynchrones behave as expected", { # Generate 300 sinusoïdal series of 3 kinds: all series of indices == 0 mod 3 are the same # (plus noise), all series of indices == 1 mod 3 are the same (plus noise) ... - n = 300 - x = seq(0,9.5,0.1) - L = length(x) #96 1/4h - K = 3 - s1 = cos(x) - s2 = sin(x) - s3 = c( s1[1:(L%/%2)] , s2[(L%/%2+1):L] ) + n <- 300 + x <- seq(0,9.5,0.1) + L <- length(x) #96 1/4h + K <- 3 + s1 <- cos(x) + s2 <- sin(x) + s3 <- c( s1[1:(L%/%2)] , s2[(L%/%2+1):L] ) #sum((s1-s2)^2) == 96 #sum((s1-s3)^2) == 58 #sum((s2-s3)^2) == 38 - s = list(s1, s2, s3) - series = matrix(nrow=L, ncol=n) + s <- list(s1, s2, s3) + series <- matrix(nrow=L, ncol=n) for (i in seq_len(n)) - series[,i] = s[[I(i,K)]] + rnorm(L,sd=0.01) + series[,i] <- s[[I(i,K)]] + rnorm(L,sd=0.01) - getRefSeries = function(indices) { - indices = indices[indices <= n] + getSeries <- function(indices) { + indices <- indices[indices <= n] if (length(indices)>0) as.matrix(series[,indices]) else NULL } - synchrones = computeSynchrones(bigmemory::as.big.matrix(cbind(s1,s2,s3)), getRefSeries, - n, 100, verbose=TRUE, parll=FALSE) + synchrones <- computeSynchrones(cbind(s1,s2,s3),getSeries,n,100,verbose=TRUE,parll=FALSE) expect_equal(dim(synchrones), c(L,K)) for (i in 1:K) diff --git a/epclust/tests/testthat/test-computeWerDists.R b/epclust/tests/testthat/test-computeWerDists.R index d83c590..0e02413 100644 --- a/epclust/tests/testthat/test-computeWerDists.R +++ b/epclust/tests/testthat/test-computeWerDists.R @@ -2,16 +2,17 @@ context("computeWerDists") test_that("computeWerDists output correct results", { - nbytes = 8 - endian = "little" + nbytes <- 8 + endian <- "little" # On two identical series - serie = rnorm(212, sd=5) - synchrones = cbind(serie, serie) - dists = computeWerDists(synchrones, 4, nbytes,endian,verbose=TRUE,parll=FALSE) + serie <- rnorm(212, sd=5) + series <- cbind(serie, serie) + getSeries <- function(indices) as.matrix(series[,indices]) + dists <- computeWerDists(1:2, getSeries, 50, 3, 4, nbytes, endian, + verbose=TRUE, parll=FALSE) expect_equal(dists, matrix(0.,nrow=2,ncol=2)) # On two constant series - # TODO:... + # TODO: ref results. Ask Jairo to check function. }) - diff --git a/epclust/tests/testthat/test-de_serialize.R b/epclust/tests/testthat/test-de_serialize.R index 8fb78ed..14618a2 100644 --- a/epclust/tests/testthat/test-de_serialize.R +++ b/epclust/tests/testthat/test-de_serialize.R @@ -2,20 +2,20 @@ context("de_serialize") test_that("serialization + getDataInFile retrieve original data / from matrix", { - data_bin_file = ".epclust_test_m.bin" + data_bin_file <- ".epclust_test_m.bin" unlink(data_bin_file) # Dataset 200 cols / 30 rows - data_ascii = matrix(runif(200*30,-10,10),nrow=30) - nbytes = 4 #lead to a precision of 1e-7 / 1e-8 - endian = "little" + data_ascii <- matrix(runif(200*30,-10,10),nrow=30) + nbytes <- 4 #lead to a precision of 1e-7 / 1e-8 + endian <- "little" # Simulate serialization in one single call binarize(data_ascii, data_bin_file, 500, ",", nbytes, endian) expect_equal(file.info(data_bin_file)$size, length(data_ascii)*nbytes+8) for (indices in list(c(1,3,5), 3:13, c(5,20,50), c(75,130:135), 196:200)) { - data_lines = getDataInFile(indices, data_bin_file, nbytes, endian) + data_lines <- getDataInFile(indices, data_bin_file, nbytes, endian) expect_equal(data_lines, data_ascii[,indices], tolerance=1e-6) } unlink(data_bin_file) @@ -26,7 +26,7 @@ test_that("serialization + getDataInFile retrieve original data / from matrix", expect_equal(file.info(data_bin_file)$size, length(data_ascii)*nbytes+8) for (indices in list(c(1,3,5), 3:13, c(5,20,50), c(75,130:135), 196:200)) { - data_lines = getDataInFile(indices, data_bin_file, nbytes, endian) + data_lines <- getDataInFile(indices, data_bin_file, nbytes, endian) expect_equal(data_lines, data_ascii[,indices], tolerance=1e-6) } unlink(data_bin_file) @@ -34,26 +34,26 @@ test_that("serialization + getDataInFile retrieve original data / from matrix", test_that("serialization + transform + getDataInFile retrieve original transforms", { - data_bin_file = ".epclust_test_t.bin" + data_bin_file <- ".epclust_test_t.bin" unlink(data_bin_file) # Dataset 200 cols / 30 rows - data_ascii = matrix(runif(200*30,-10,10),nrow=30) - nbytes = 8 - endian = "little" + data_ascii <- matrix(runif(200*30,-10,10),nrow=30) + nbytes <- 8 + endian <- "little" binarize(data_ascii, data_bin_file, 500, ",", nbytes, endian) # Serialize transformation (just compute range) into a new binary file - trans_bin_file = ".epclust_test_t_trans.bin" + trans_bin_file <- ".epclust_test_t_trans.bin" unlink(trans_bin_file) - getSeries = function(inds) getDataInFile(inds, data_bin_file, nbytes, endian) + getSeries <- function(inds) getDataInFile(inds, data_bin_file, nbytes, endian) binarizeTransform(getSeries, function(series) apply(series, 2, range), trans_bin_file, 250, nbytes, endian) unlink(data_bin_file) expect_equal(file.info(trans_bin_file)$size, 2*ncol(data_ascii)*nbytes+8) for (indices in list(c(1,3,5), 3:13, c(5,20,50), c(75,130:135), 196:200)) { - trans_cols = getDataInFile(indices, trans_bin_file, nbytes, endian) + trans_cols <- getDataInFile(indices, trans_bin_file, nbytes, endian) expect_equal(trans_cols, apply(data_ascii[,indices],2,range), tolerance=1e-6) } unlink(trans_bin_file) @@ -61,35 +61,32 @@ test_that("serialization + transform + getDataInFile retrieve original transform test_that("serialization + getDataInFile retrieve original data / from connection", { - data_bin_file = ".epclust_test_c.bin" + data_bin_file <- ".epclust_test_c.bin" unlink(data_bin_file) # Dataset 300 cols / 50 rows - data_csv = system.file("testdata","de_serialize.csv",package="epclust") - nbytes = 8 - endian = "big" - data_ascii = t( as.matrix(read.table(data_csv, sep=";", header=FALSE)) ) #for ref + data_csv <- system.file("testdata","de_serialize.csv",package="epclust") + nbytes <- 8 + endian <- "big" + data_ascii <- unname( t( as.matrix(read.table(data_csv,sep=";",header=FALSE)) ) ) #ref # Simulate serialization in one single call binarize(data_csv, data_bin_file, 350, ";", nbytes, endian) expect_equal(file.info(data_bin_file)$size, 300*50*8+8) for (indices in list(c(1,3,5), 3:13, c(5,20,50), c(75,130:135), 196:200)) { - data_cols = getDataInFile(indices,data_bin_file,nbytes,endian) - #HACK: rows naming required to match (ref) data structure - rownames(data_cols) <- paste("V",seq_len(nrow(data_ascii)), sep="") + data_cols <- getDataInFile(indices,data_bin_file,nbytes,endian) expect_equal(data_cols, data_ascii[,indices]) } unlink(data_bin_file) # Serialization in several calls / chunks of 29 --> 29*10 + 10, incomplete last - data_con = file(data_csv, "r") + data_con <- file(data_csv, "r") binarize(data_con, data_bin_file, 29, ";", nbytes, endian) expect_equal(file.info(data_bin_file)$size, 300*50*8+8) for (indices in list(c(1,3,5), 3:13, c(5,20,50), c(75,130:135), 196:200)) { - data_cols = getDataInFile(indices,data_bin_file,nbytes,endian) - rownames(data_cols) <- paste("V",seq_len(nrow(data_ascii)), sep="") + data_cols <- getDataInFile(indices,data_bin_file,nbytes,endian) expect_equal(data_cols, data_ascii[,indices]) } unlink(data_bin_file) diff --git a/epclust/tests/testthat/test-filterMA.R b/epclust/tests/testthat/test-filterMA.R index 8dda50e..19ec6fc 100644 --- a/epclust/tests/testthat/test-filterMA.R +++ b/epclust/tests/testthat/test-filterMA.R @@ -2,16 +2,30 @@ context("filterMA") test_that("[time-]serie filtering behave as expected", { - # Currently just a mean of 3 values - M = matrix(runif(1000,min=-7,max=7), ncol=10) - ref_fM = stats::filter(M, c(1/3,1/3,1/3), circular=FALSE) - fM = epclust:::filterMA(M) + # Mean of 3 values + M <- matrix(runif(1000,min=-7,max=7), ncol=10) + ref_fM <- stats::filter(M, rep(1/3,3), circular=FALSE) + fM <- epclust:::filterMA(M, 3) # Expect an agreement on all inner values expect_equal(dim(fM), c(100,10)) expect_equal(fM[2:99,], ref_fM[2:99,]) - # Border values should be unchanged - expect_equal(fM[1,], M[1,]) - expect_equal(fM[100,], M[100,]) + # Border values should be averages of 2 values + expect_equal(fM[1,], colMeans(M[1:2,])) + expect_equal(fM[100,], colMeans(M[99:100,])) + + # Mean of 5 values + ref_fM <- stats::filter(M, rep(1/5,5), circular=FALSE) + fM <- epclust:::filterMA(M, 5) + + # Expect an agreement on all inner values + expect_equal(dim(fM), c(100,10)) + expect_equal(fM[3:98,], ref_fM[3:98,]) + + # Border values should be averages of 3 or 4 values + expect_equal(fM[1,], colMeans(M[1:3,])) + expect_equal(fM[2,], colMeans(M[1:4,])) + expect_equal(fM[99,], colMeans(M[97:100,])) + expect_equal(fM[100,], colMeans(M[98:100,])) }) diff --git a/epclust/tests/testthat/test-utils.R b/epclust/tests/testthat/test-utils.R index 4448df0..c2474c8 100644 --- a/epclust/tests/testthat/test-utils.R +++ b/epclust/tests/testthat/test-utils.R @@ -18,15 +18,38 @@ test_that("Helper function to split indices work properly", list(indices[201:300]), list(indices[301:400]) )) # length(indices) / nb_per_set == 1, length(indices) %% nb_per_set == 100 - expect_equal(epclust:::.splitIndices(indices,300), list(indices)) + expect_equal(epclust:::.splitIndices(indices,300,min_size=1), + list(1:300, 301:400)) + split_inds <- epclust:::.splitIndices(indices,300,min_size=200) + expect_equal(length(unique(unlist(split_inds))), 400) + expect_equal(length(split_inds), 2) + expect_equal(length(split_inds[[1]]), 200) + expect_equal(length(split_inds[[2]]), 200) + expect_error(epclust:::.splitIndices(indices,300,min_size=300), "Impossible to split*") + # length(indices) / nb_per_set == 2, length(indices) %% nb_per_set == 42 - repartition <- epclust:::.splitIndices(indices,179) - expect_equal(length(repartition), 2) - expect_equal(length(repartition[[1]]), 179 + 21) - expect_equal(length(repartition[[1]]), 179 + 21) + expect_equal(epclust:::.splitIndices(indices,179,min_size=1), + list(1:179, 180:358, 359:400)) + split_inds <-epclust:::.splitIndices(indices,179,min_size=60) + expect_equal(length(unique(unlist(split_inds))), 400) + expect_equal(length(split_inds), 3) + expect_equal(length(split_inds[[1]]), 170) + expect_equal(length(split_inds[[2]]), 170) + expect_equal(length(split_inds[[3]]), 60) + expect_error(epclust:::.splitIndices(indices,179,min_size=150), "Impossible to split*") }) test_that("curvesToContribs output correct results", { -# curvesToContribs(...) + L <- 220 #extended to 256, log2(256) == 8 + + # Zero serie + expect_equal(curvesToContribs(rep(0,L), "d8", "absolute"), as.matrix(rep(0,8))) + expect_equal(curvesToContribs(rep(0,L), "haar", "absolute"), as.matrix(rep(0,8))) + + # Constant serie + expect_equal(curvesToContribs(rep(5,L), "haar", "absolute"), as.matrix(rep(0,8))) + expect_equal(curvesToContribs(rep(10,L), "haar", "absolute"), as.matrix(rep(0,8))) +# expect_equal(curvesToContribs(rep(5,L), "d8", ctype), rep(0,8)) +#TODO: }) diff --git a/reports/2017-03/TODO.ipynb b/reports/2017-04/TODO.ipynb similarity index 100% rename from reports/2017-03/TODO.ipynb rename to reports/2017-04/TODO.ipynb