WER distances is a regular matrix, fix doc (weird latex error?)
[epclust.git] / epclust / R / clustering.R
CommitLineData
4bcfdbee
BA
1#' @name clustering
2#' @rdname clustering
492cd9e7 3#' @aliases clusteringTask1 computeClusters1 computeClusters2
4bcfdbee 4#'
492cd9e7 5#' @title Two-stage clustering, withing one task (see \code{claws()})
4bcfdbee 6#'
492cd9e7
BA
7#' @description \code{clusteringTask1()} runs one full stage-1 task, which consists in
8#' iterated stage 1 clustering (on nb_curves / ntasks energy contributions, computed
bf5c0844
BA
9#' through discrete wavelets coefficients).
10#' \code{clusteringTask2()} runs a full stage-2 task, which consists in synchrones
11#' and then WER distances computations, before applying the clustering algorithm.
12#' \code{computeClusters1()} and \code{computeClusters2()} correspond to the atomic
13#' clustering procedures respectively for stage 1 and 2. The former applies the
14#' clustering algorithm (PAM) on a contributions matrix, while the latter clusters
15#' a chunk of series inside one task (~max nb_series_per_chunk)
4bcfdbee
BA
16#'
17#' @param indices Range of series indices to cluster in parallel (initial data)
18#' @param getContribs Function to retrieve contributions from initial series indices:
19#' \code{getContribs(indices)} outpus a contributions matrix
20#' @param contribs matrix of contributions (e.g. output of \code{curvesToContribs()})
777c4b02 21#' @param distances matrix of K1 x K1 (WER) distances between synchrones
4bcfdbee
BA
22#' @inheritParams computeSynchrones
23#' @inheritParams claws
24#'
492cd9e7 25#' @return For \code{clusteringTask1()} and \code{computeClusters1()}, the indices of the
4bcfdbee 26#' computed (K1) medoids. Indices are irrelevant for stage 2 clustering, thus
24ed5d83 27#' \code{computeClusters2()} outputs a big.matrix of medoids
4bcfdbee
BA
28#' (of size limited by nb_series_per_chunk)
29NULL
30
31#' @rdname clustering
32#' @export
492cd9e7
BA
33clusteringTask1 = function(
34 indices, getContribs, K1, nb_series_per_chunk, ncores_clust=1, verbose=FALSE, parll=TRUE)
5c652979 35{
492cd9e7 36 if (verbose)
e161499b 37 cat(paste("*** Clustering task 1 on ",length(indices)," lines\n", sep=""))
4bcfdbee 38
492cd9e7 39 if (parll)
7b13d0c2 40 {
492cd9e7
BA
41 cl = parallel::makeCluster(ncores_clust)
42 parallel::clusterExport(cl, varlist=c("getContribs","K1","verbose"), envir=environment())
7b13d0c2 43 }
492cd9e7
BA
44 while (length(indices) > K1)
45 {
46 indices_workers = .spreadIndices(indices, nb_series_per_chunk)
e161499b
BA
47 indices <-
48 if (parll)
49 {
50 unlist( parallel::parLapply(cl, indices_workers, function(inds) {
51 require("epclust", quietly=TRUE)
52 inds[ computeClusters1(getContribs(inds), K1, verbose) ]
53 }) )
54 }
55 else
56 {
57 unlist( lapply(indices_workers, function(inds)
58 inds[ computeClusters1(getContribs(inds), K1, verbose) ]
59 ) )
60 }
492cd9e7
BA
61 }
62 if (parll)
63 parallel::stopCluster(cl)
64
56857861 65 indices #medoids
5c652979
BA
66}
67
4bcfdbee
BA
68#' @rdname clustering
69#' @export
bf5c0844 70clusteringTask2 = function(medoids, K2,
492cd9e7 71 getRefSeries, nb_ref_curves, nb_series_per_chunk, ncores_clust=1,verbose=FALSE,parll=TRUE)
5c652979 72{
e161499b
BA
73 if (verbose)
74 cat(paste("*** Clustering task 2 on ",nrow(medoids)," lines\n", sep=""))
75
bf5c0844
BA
76 if (nrow(medoids) <= K2)
77 return (medoids)
492cd9e7
BA
78 synchrones = computeSynchrones(medoids,
79 getRefSeries, nb_ref_curves, nb_series_per_chunk, ncores_clust, verbose, parll)
80 distances = computeWerDists(synchrones, ncores_clust, verbose, parll)
777c4b02 81 medoids[ computeClusters2(distances,K2,verbose), ]
5c652979
BA
82}
83
bf5c0844
BA
84#' @rdname clustering
85#' @export
e161499b
BA
86computeClusters1 = function(contribs, K1, verbose=FALSE)
87{
88 if (verbose)
89 cat(paste(" computeClusters1() on ",nrow(contribs)," lines\n", sep=""))
bf5c0844 90 cluster::pam(contribs, K1, diss=FALSE)$id.med
e161499b 91}
bf5c0844
BA
92
93#' @rdname clustering
94#' @export
e161499b
BA
95computeClusters2 = function(distances, K2, verbose=FALSE)
96{
97 if (verbose)
98 cat(paste(" computeClusters2() on ",nrow(distances)," lines\n", sep=""))
bf5c0844 99 cluster::pam(distances, K2, diss=TRUE)$id.med
e161499b 100}
bf5c0844 101
4bcfdbee
BA
102#' computeSynchrones
103#'
104#' Compute the synchrones curves (sum of clusters elements) from a matrix of medoids,
105#' using L2 distances.
106#'
24ed5d83 107#' @param medoids big.matrix of medoids (curves of same length as initial series)
4bcfdbee
BA
108#' @param getRefSeries Function to retrieve initial series (e.g. in stage 2 after series
109#' have been replaced by stage-1 medoids)
492cd9e7 110#' @param nb_ref_curves How many reference series? (This number is known at this stage)
4bcfdbee
BA
111#' @inheritParams claws
112#'
24ed5d83
BA
113#' @return A big.matrix of size K1 x L where L = data_length
114#'
4bcfdbee 115#' @export
492cd9e7
BA
116computeSynchrones = function(medoids, getRefSeries,
117 nb_ref_curves, nb_series_per_chunk, ncores_clust=1,verbose=FALSE,parll=TRUE)
e205f218 118{
e161499b
BA
119 if (verbose)
120 cat(paste("--- Compute synchrones\n", sep=""))
121
492cd9e7 122 computeSynchronesChunk = function(indices)
3eef8d3d 123 {
492cd9e7 124 ref_series = getRefSeries(indices)
e161499b 125 nb_series = nrow(ref_series)
3eef8d3d 126 #get medoids indices for this chunk of series
e161499b
BA
127
128 #TODO: debug this (address is OK but values are garbage: why?)
129# mi = .Call("computeMedoidsIndices", medoids@address, ref_series, PACKAGE="epclust")
130
131 #R-equivalent, requiring a matrix (thus potentially breaking "fit-in-memory" hope)
132 mat_meds = medoids[,]
133 mi = rep(NA,nb_series)
134 for (i in 1:nb_series)
135 mi[i] <- which.min( rowSums( sweep(mat_meds, 2, ref_series[i,], '-')^2 ) )
136 rm(mat_meds); gc()
137
138 for (i in seq_len(nb_series))
56857861 139 {
492cd9e7
BA
140 if (parll)
141 synchronicity::lock(m)
e161499b
BA
142 synchrones[mi[i],] = synchrones[mi[i],] + ref_series[i,]
143 counts[mi[i],1] = counts[mi[i],1] + 1
492cd9e7
BA
144 if (parll)
145 synchronicity::unlock(m)
146 }
147 }
148
e161499b 149 K = nrow(medoids) ; L = ncol(medoids)
492cd9e7 150 # Use bigmemory (shared==TRUE by default) + synchronicity to fill synchrones in //
24ed5d83 151 # TODO: if size > RAM (not our case), use file-backed big.matrix
e161499b
BA
152 synchrones = bigmemory::big.matrix(nrow=K, ncol=L, type="double", init=0.)
153 counts = bigmemory::big.matrix(nrow=K, ncol=1, type="double", init=0)
24ed5d83 154 # synchronicity is only for Linux & MacOS; on Windows: run sequentially
492cd9e7
BA
155 parll = (requireNamespace("synchronicity",quietly=TRUE)
156 && parll && Sys.info()['sysname'] != "Windows")
157 if (parll)
158 m <- synchronicity::boost.mutex()
159
24ed5d83
BA
160 if (parll)
161 {
162 cl = parallel::makeCluster(ncores_clust)
163 parallel::clusterExport(cl,
164 varlist=c("synchrones","counts","verbose","medoids","getRefSeries"),
165 envir=environment())
166 }
167
492cd9e7 168 indices_workers = .spreadIndices(seq_len(nb_ref_curves), nb_series_per_chunk)
777c4b02 169#browser()
c45fd663 170 ignored <-
492cd9e7 171 if (parll)
e161499b 172 parallel::parLapply(cl, indices_workers, computeSynchronesChunk)
492cd9e7 173 else
c45fd663 174 lapply(indices_workers, computeSynchronesChunk)
492cd9e7 175
24ed5d83
BA
176 if (parll)
177 parallel::stopCluster(cl)
178
179 #TODO: can we avoid this loop? ( synchrones = sweep(synchrones, 1, counts, '/') )
492cd9e7 180 for (i in seq_len(K))
24ed5d83 181 synchrones[i,] = synchrones[i,] / counts[i,1]
3eef8d3d 182 #NOTE: odds for some clusters to be empty? (when series already come from stage 2)
8702eb86 183 # ...maybe; but let's hope resulting K1' be still quite bigger than K2
24ed5d83
BA
184 noNA_rows = sapply(seq_len(K), function(i) all(!is.nan(synchrones[i,])))
185 if (all(noNA_rows))
186 return (synchrones)
187 # Else: some clusters are empty, need to slice synchrones
188 synchrones[noNA_rows,]
e205f218 189}
1c6f223e 190
4bcfdbee
BA
191#' computeWerDists
192#'
193#' Compute the WER distances between the synchrones curves (in rows), which are
194#' returned (e.g.) by \code{computeSynchrones()}
195#'
24ed5d83
BA
196#' @param synchrones A big.matrix of synchrones, in rows. The series have same length
197#' as the series in the initial dataset
492cd9e7 198#' @inheritParams claws
4bcfdbee 199#'
777c4b02 200#' @return A matrix of size K1 x K1
24ed5d83 201#'
4bcfdbee 202#' @export
492cd9e7 203computeWerDists = function(synchrones, ncores_clust=1,verbose=FALSE,parll=TRUE)
d03c0621 204{
e161499b
BA
205 if (verbose)
206 cat(paste("--- Compute WER dists\n", sep=""))
24ed5d83 207
4bcfdbee
BA
208 n <- nrow(synchrones)
209 delta <- ncol(synchrones)
db6fc17d 210 #TODO: automatic tune of all these parameters ? (for other users)
d03c0621 211 nvoice <- 4
4bcfdbee 212 # noctave = 2^13 = 8192 half hours ~ 180 days ; ~log2(ncol(synchrones))
d7d55bc1
BA
213 noctave = 13
214 # 4 here represent 2^5 = 32 half-hours ~ 1 day
db6fc17d 215 #NOTE: default scalevector == 2^(0:(noctave * nvoice) / nvoice) * s0 (?)
24ed5d83 216 scalevector <- 2^(4:(noctave * nvoice) / nvoice + 1)
db6fc17d
BA
217 #condition: ( log2(s0*w0/(2*pi)) - 1 ) * nvoice + 1.5 >= 1
218 s0=2
219 w0=2*pi
220 scaled=FALSE
221 s0log = as.integer( (log2( s0*w0/(2*pi) ) - 1) * nvoice + 1.5 )
222 totnoct = noctave + as.integer(s0log/nvoice) + 1
223
e161499b
BA
224 Xwer_dist <- bigmemory::big.matrix(nrow=n, ncol=n, type="double")
225 fcoefs = rep(1/3, 3) #moving average on 3 values
226
227 # Generate n(n-1)/2 pairs for WER distances computations
228 pairs = list()
229 V = seq_len(n)
230 for (i in 1:n)
231 {
232 V = V[-1]
233 pairs = c(pairs, lapply(V, function(v) c(i,v)))
234 }
235
492cd9e7
BA
236 computeCWT = function(i)
237 {
4bcfdbee 238 ts <- scale(ts(synchrones[i,]), center=TRUE, scale=scaled)
24ed5d83 239 totts.cwt = Rwave::cwt(ts, totnoct, nvoice, w0, plot=FALSE)
db6fc17d
BA
240 ts.cwt = totts.cwt[,s0log:(s0log+noctave*nvoice)]
241 #Normalization
242 sqs <- sqrt(2^(0:(noctave*nvoice)/nvoice)*s0)
af3ea947 243 sqres <- sweep(ts.cwt,2,sqs,'*')
db6fc17d 244 sqres / max(Mod(sqres))
492cd9e7 245 }
3ccd1e39 246
777c4b02 247 # Distance between rows i and j
e161499b
BA
248 computeDistancesIJ = function(pair)
249 {
250 i = pair[1] ; j = pair[2]
251 if (verbose && j==i+1)
252 cat(paste(" Distances (",i,",",j,"), (",i,",",j+1,") ...\n", sep=""))
253 cwt_i = computeCWT(i)
254 cwt_j = computeCWT(j)
255 num <- .Call("filter", Mod(cwt_i * Conj(cwt_j)), PACKAGE="epclust")
256 WX <- .Call("filter", Mod(cwt_i * Conj(cwt_i)), PACKAGE="epclust")
257 WY <- .Call("filter", Mod(cwt_j * Conj(cwt_j)), PACKAGE="epclust")
258 wer2 <- sum(colSums(num)^2) / sum(colSums(WX) * colSums(WY))
259 Xwer_dist[i,j] <- sqrt(delta * ncol(cwt_i) * (1 - wer2))
260 Xwer_dist[j,i] <- Xwer_dist[i,j]
261 Xwer_dist[i,i] = 0.
262 }
263
492cd9e7
BA
264 if (parll)
265 {
266 cl = parallel::makeCluster(ncores_clust)
af3ea947
BA
267 parallel::clusterExport(cl,
268 varlist=c("synchrones","totnoct","nvoice","w0","s0log","noctave","s0","verbose"),
269 envir=environment())
492cd9e7
BA
270 }
271
e161499b 272 ignored <-
492cd9e7 273 if (parll)
e161499b 274 parallel::parLapply(cl, pairs, computeDistancesIJ)
492cd9e7 275 else
e161499b 276 lapply(pairs, computeDistancesIJ)
492cd9e7
BA
277
278 if (parll)
279 parallel::stopCluster(cl)
280
492cd9e7 281 Xwer_dist[n,n] = 0.
777c4b02
BA
282 distances <- Xwer_dist[,]
283 rm(Xwer_dist) ; gc()
284 distances #~small matrix K1 x K1
492cd9e7
BA
285}
286
287# Helper function to divide indices into balanced sets
288.spreadIndices = function(indices, nb_per_chunk)
289{
290 L = length(indices)
291 nb_workers = floor( L / nb_per_chunk )
292 if (nb_workers == 0)
293 {
294 # L < nb_series_per_chunk, simple case
295 indices_workers = list(indices)
296 }
297 else
298 {
299 indices_workers = lapply( seq_len(nb_workers), function(i)
300 indices[(nb_per_chunk*(i-1)+1):(nb_per_chunk*i)] )
301 # Spread the remaining load among the workers
302 rem = L %% nb_per_chunk
303 while (rem > 0)
304 {
305 index = rem%%nb_workers + 1
306 indices_workers[[index]] = c(indices_workers[[index]], indices[L-rem+1])
307 rem = rem - 1
d03c0621 308 }
1c6f223e 309 }
492cd9e7 310 indices_workers
1c6f223e 311}