/
continuous_fbgibbs.c
566 lines (519 loc) · 18.8 KB
/
continuous_fbgibbs.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
/*******************************************************************************
*
* This file is part of the General Hidden Markov Model Library,
* GHMM version __VERSION__, see http://ghmm.org
*
* Filename: ghmm/ghmm/model.c
* Authors: Benhard Knab, Bernd Wichern, Benjamin Georgi, Alexander Schliep
*
* Copyright (C) 1998-2004 Alexander Schliep
* Copyright (C) 1998-2001 ZAIK/ZPR, Universitaet zu Koeln
* Copyright (C) 2002-2004 Max-Planck-Institut fuer Molekulare Genetik,
* Berlin
*
* Contact: schliep@ghmm.org
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the Free
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*
* This file is version $Revision: 2304 $
* from $Date: 2013-05-31 13:48:13 -0400 (Fri, 31 May 2013) $
* last change by $Author: ejb177 $.
*
*******************************************************************************/
#ifdef HAVE_CONFIG_H
# include "../config.h"
#endif
#include <math.h>
#include <float.h>
#include "ghmm.h"
#include "mprintf.h"
#include "mes.h"
#include "matrix.h"
#include "randvar.h"
#include "ghmm_internals.h"
#include "rng.h"
#include "sfoba.h"
#include "continuous_fbgibbs.h"
#include "smodel.h"
#include "block_compression.h"
//data for each state for posterior
typedef struct sample_emission_data{
int emitted;
union{
double val;
double *vec;
}mean;
union{
double val;
double *vec;
double **mat;
}variance;
double a;
double b;
} sample_emission_data;
//data for model posterior
typedef struct ghmm_sample_data{
double **transition;
sample_emission_data **state_data; //[state][mixture] rename to emission_data
}ghmm_sample_data;
/*----------------------------------------------------------------------------*/
/* modified forwards to get cdf pmats */
/*----------------------------------------------------------------------------*/
static double sfoba_stepforward_gibbs (ghmm_cstate * s, double *alpha_t, int osc,
double b_omega, double* pmats, int N)
{
int i, id, prv;
double value = 0.0;
prv = s->in_id[0];
for (i = 0; i < s->in_states; i++) {
id = s->in_id[i];
pmats[id] = s->in_a[osc][i] * alpha_t[id];
value += pmats[id];
//fill in values of pmats previous id to current id
for(; prv < id; prv++){
pmats[prv+1] += pmats[prv];
}
prv = id;
}
for(prv+=1;prv<N;prv++){
pmats[prv] += pmats[prv-1];
}
value *= b_omega; /* b_omega outside the sum */
return (value);
} /* sfoba_stepforward */
/*============================================================================*/
int ghmm_cmodel_forwardgibbs (ghmm_cmodel * smo, double *O, int T, double ***b,
double **alpha, double *scale, double *log_p, double***pmats)
{
# define CUR_PROC "ghmm_cmodel_forward"
int res = -1;
int i, t = 0, osc = 0;
double c_t;
int pos;
/* T is length of sequence; divide by dimension to represent the number of time points */
T /= smo->dim;
/* calculate alpha and scale for t = 0 */
if (b == NULL)
sfoba_initforward(smo, alpha[0], O, scale, NULL);
else
sfoba_initforward(smo, alpha[0], O, scale, b[0]);
if (scale[0] <= DBL_MIN) {
/* means f(O[0], mue, u) << 0, first symbol very unlikely */
/* GHMM_LOG(LCONVERTED, "scale[0] == .0!\n"); */
goto STOP;
}
else {
*log_p = -log (1 / scale[0]);
if (smo->cos == 1) {
osc = 0;
}
else {
if (!smo->class_change->get_class) {
printf ("ERROR: get_class not initialized\n");
return (-1);
}
/* printf("1: cos = %d, k = %d, t = %d\n",smo->cos,smo->class_change->k,t); */
osc = smo->class_change->get_class (smo, O, smo->class_change->k, t);
if (osc >= smo->cos){
printf("ERROR: get_class returned index %d but model has only %d classes !\n",osc,smo->cos);
goto STOP;
}
}
for (t = 1; t < T; t++) {
scale[t] = 0.0;
pos = t * smo->dim;
/* b not calculated yet */
if (b == NULL) {
for (i = 0; i < smo->N; i++) {
alpha[t][i] = sfoba_stepforward_gibbs(smo->s+i, alpha[t-1], osc,
ghmm_cmodel_calc_b(smo->s+i, O+pos),
pmats[t][i],smo->N);
scale[t] += alpha[t][i];
}
}
/* b precalculated */
else {
for (i = 0; i < smo->N; i++) {
alpha[t][i] = sfoba_stepforward_gibbs (smo->s+i, alpha[t - 1], osc,
b[t][i][smo->M], pmats[t][i], smo->N);
scale[t] += alpha[t][i];
}
}
if (scale[t] <= DBL_MIN) { /* seq. can't be build */
goto STOP;
break;
}
c_t = 1 / scale[t];
/* scale alpha */
for (i = 0; i < smo->N; i++)
alpha[t][i] *= c_t;
/* summation of log(c[t]) for calculation of log( P(O|lambda) ) */
*log_p -= log (c_t);
if (smo->cos == 1) {
osc = 0;
}
else {
if (!smo->class_change->get_class) {
printf ("ERROR: get_class not initialized\n");
return (-1);
}
/* printf("1: cos = %d, k = %d, t = %d\n",smo->cos,smo->class_change->k,t); */
osc = smo->class_change->get_class (smo, O, smo->class_change->k, t);
if (osc >= smo->cos){
printf("ERROR: get_class returned index %d but model has only %d classes !\n",osc,smo->cos);
goto STOP;
}
}
}
}
/* log_p should not be smaller than value used for seqs. that
can't be build ???
if (*log_p < (double)PENALTY_LOGP)
*log_p = (double)PENALTY_LOGP;
*/
return 0;
STOP:
*log_p = (double) -DBL_MAX;
return (res);
#undef CUR_PROC
} /* ghmm_cmodel_forward */
//====================================================================================
//==================================end forwards======================================
//====================================================================================
/* XXX mixture */
//[state][power]
//assumes normal dist
void precompute_blocks(ghmm_cmodel *mo, double ** mean, double **std,
double **transition, int max_block_len){
int i, j;
for(i=0; i < mo->N; i++){
mean[i][0] = 1;
mean[i][1] = (mo->s+i)->e->mean.val * (mo->s+i)->e->mean.val;
std[i][0] = sqrt( (mo->s+i)->e->variance.val);
std[i][1] = std[i][0] * sqrt( 2 * M_PI );
//printf("std %e\n", std[i][0]);
transition[i][0] = 1;
transition[i][1] = (mo->s+i)->out_a[0][i];
//printf("transition %d %d %e\n", i, 0, transition[i][0]);
//printf("transition %d %d %e\n", i, 1, transition[i][1]);
for(j = 2; j < max_block_len; j++){
std[i][j] = std[i][j-1] * std[i][1];
transition[i][j] = transition[i][j-1]*transition[i][1];
mean[i][j] = mean[i][j-1]+mean[i][1];
//printf("transition %d %d %e\n", i, j, std[i][j]);
}
}
}
//assumes normal dist
//precomputes b for forward algo
void precompute_block_emission(ghmm_cmodel *mo, block_stats *stats,
int max_block_len, double ***b){
#define CUR_PROC "precalculate_block_emission"
//precompute intermediate values
double **mean2, **std, **transition;
mean2 = ighmm_cmatrix_alloc(mo->N, max_block_len+1);
std = ighmm_cmatrix_alloc(mo->N, max_block_len+1);
transition = ighmm_cmatrix_alloc(mo->N, max_block_len+1);
precompute_blocks(mo, mean2, std, transition, max_block_len+1);
int t, i;
double exponent;
for(t = 0; t < stats->total; t++){
for(i = 0; i < mo->N; i++){//flip order
//printf("sumsqrs %e\n", stats->moment2[t]);
//printf("transition %e\n", transition[i][stats->length[t]]);
exponent = -1 * ( stats->moment2[t] - 2*stats->moment1[t] *
(mo->s+i)->e->mean.val + mean2[i][stats->length[t]] ) /
(2 * (mo->s+i)->e->variance.val);
b[t][i][1] = transition[i][stats->length[t]] * exp( exponent ) /
std[i][stats->length[t]];
//printf("exp = %e\n", exponent);
//printf("b %d %d = %e\n", t, i, b[t][i][1]);
}
}
ighmm_cmatrix_free(&mean2, mo->N);
ighmm_cmatrix_free(&std, mo->N);
ighmm_cmatrix_free(&transition, mo->N);
STOP:
//XXX ERROR
return;
#undef CUR_PROC
}
//====================================================================================
//b is precomputed emissions used mainly for block compression
void ghmm_cmodel_fbgibbstep (ghmm_cmodel * mo, double *O, int len,int *Q, double** alpha,
double***pmats, double***b){
int i,j,k;
for(i = 0; i < len; i++){
for(j = 0; j < mo->N; j++){
alpha[i][j] = 0;
for(k = 0; k < mo->N; k++){
pmats[i][j][k] = 0;
}
}
}
double scale[len];
double logP;
ghmm_cmodel_forwardgibbs(mo, O, len, b, alpha, scale, &logP, pmats);
sampleStatePath(mo->N, alpha[len-1], pmats, len, Q);
}
int ghmm_alloc_sample_data(ghmm_bayes_hmm *mo, ghmm_sample_data *data){
#define CUR_PROC "ghmm_alloc_sample_data"
//XXX must do alloc matrices for dim >1
int i;
data->transition = ighmm_cmatrix_alloc(mo->N, mo->N);
ARRAY_MALLOC(data->state_data, mo->N);
for(i = 0; i < mo->N; i++){
ARRAY_MALLOC(data->state_data[i], mo->M[i]);
/*for(i = 0; i < mo->M[i]; i++){//only needed for dim >1
ghmm_alloc_emission_data(data->state_data[i][j], ghmm_bayes_hmm->params[i][j])
}*/
}
return 0;
STOP:
return -1;
#undef CUR_PROC
}
void ghmm_clear_emission_data(sample_emission_data *data){
data->emitted = 0;
data->mean.val = 0;
data->variance.val = 0;
data->a = 0;
data->b = 0;
}
void ghmm_clear_sample_data(ghmm_sample_data * data, ghmm_bayes_hmm *bayes){
int i, j;
for(i = 0; i < bayes->N; i++){
for(j = 0; j < bayes->M[i]; j++){
ghmm_clear_emission_data(&data->state_data[i][j]);
}
for(j=0; j<bayes->N; j++){
data->transition[i][j] = 0;
}
}
}
void ghmm_get_emission_data_first_pass(sample_emission_data *data, ghmm_density_t type,
double *observation){
switch(type){
case(normal):
data->mean.val += *observation;
data->emitted++;
default://not supported
return;
}
}
void ghmm_get_emission_data_second_pass(sample_emission_data *data, ghmm_density_t type,
double *observation){
double tmp;
switch(type){
case(normal)://divide by emitted before 2 pass
tmp = *observation - data->mean.val;
data->variance.val += tmp*tmp;
default://not supported
return;
}
}
void ghmm_get_sample_data(ghmm_sample_data *data, ghmm_bayes_hmm *bayes,int *Q, double *O, int T){
int i;
for(i=0; i<T-1; i++){
data->transition[Q[i]][Q[i+1]]++;
}
/* XXX just create cases for dists and make functions for sample mean and variance*/
for(i=0; i<T-1; i++){
ghmm_get_emission_data_first_pass(&(data->state_data[Q[i]][0]),
bayes->params[Q[i]][0].type, O+i);
}
for(i=0; i<bayes->N; i++){
if(data->state_data[i][0].emitted>0)
data->state_data[i][0].mean.val /= data->state_data[i][0].emitted;
}
for(i=0;i<T;i++){
ghmm_get_emission_data_second_pass(&data->state_data[Q[i]][0],
bayes->params[Q[i]][0].type, &O[i]);
}
}
//gets data from blocks
void ghmm_get_sample_data_compressed(ghmm_sample_data *data, ghmm_bayes_hmm *bayes,
int *Q, double *O, int T, block_stats *stats){
int i,j,index;
for(i=0; i<T-1; i++){
data->transition[Q[i]][Q[i+1]]++;
data->transition[Q[i]][Q[i]] += stats->length[i];
}
data->transition[Q[T-1]][Q[T-1]] += stats->length[T-1];
index = 0;
for(i=0; i<T; i++){
for(j = 0; j < stats->length[i]; j++){
ghmm_get_emission_data_first_pass(&(data->state_data[Q[i]][0]),
bayes->params[Q[i]][0].type, O+index);
index++;
}
}
for(i=0; i<bayes->N; i++){
if(data->state_data[i][0].emitted>0)
data->state_data[i][0].mean.val /= data->state_data[i][0].emitted;
}
index = 0;
for(i=0;i<T;i++){
for(j = 0; j < stats->length[i]; j++){
ghmm_get_emission_data_second_pass(&data->state_data[Q[i]][0],
bayes->params[Q[i]][0].type, O+index);
index++;
}
}
}
/* using data colected in sample_emission_data sample from posterior distribution*/
void ghmm_update_emission(sample_emission_data *data, ghmm_hyperparameters *params,
ghmm_c_emission *emission){
switch(params->type){
case(normal):
{
double mean, var, a, b;
double tmp;
//var
var = params->emission[0].variance.val + data->emitted;
//mean
mean = params->emission[0].variance.val * params->emission[0].mean.val;
mean += data->emitted*data->mean.val;
mean /= (params->emission[0].variance.val + data->emitted );
//a
a = params->emission[1].min + data->emitted/2;
//b
tmp = data->mean.val - params->emission[0].mean.val;
b = params->emission[1].max;
b += .5*data->variance.val;
b += (data->emitted*params->emission[0].variance.val/2*tmp*tmp)/
(data->emitted+params->emission[0].variance.val);
// sample from posterior hyperparameters
tmp = ighmm_rand_gamma(a, 1/b, 0);
emission->variance.val = 1/tmp;
//if(emission->variance.val < 1 ) emission->variance.val = 1;
emission->mean.val = ighmm_rand_normal(mean, 1/(var*tmp),0);
}
default:
return;
}
}
void ghmm_update_model(ghmm_cmodel *mo, ghmm_bayes_hmm *bayes, ghmm_sample_data *data){
int i, k;
double tmp_n[mo->N];
double tmp2_n[mo->N];
//emission
for(i=0; i<bayes->N; i++){
for(k=0; k<bayes->M[k]; k++){
ghmm_update_emission(&data->state_data[i][k], &bayes->params[i][k],&mo->s[i].e[k]);
}
}
//add prior for A, Pi
for(i = 0; i < bayes->N; i++){
tmp_n[i] = 0;
for(k=0;k<bayes->M[i];k++){
tmp_n[i] += data->state_data[i][k].emitted;
}
for(k = 0; k < bayes->N; k++){
data->transition[i][k] += bayes->A[i][k];
//printf("data %f\n", data->transition[i][k]);
}
}
//Pi
ighmm_rand_dirichlet(0, mo->N, tmp_n, tmp2_n);
for(k=0;k<mo->N;k++){
mo->s[k].pi = tmp2_n[k];
}
//A
for(i=0;i<mo->N;i++){
ighmm_rand_dirichlet(0, mo->N, data->transition[i], tmp_n);
for(k = 0; k < mo->N; k++){
ghmm_cmodel_set_transition(mo, i, k, 0, tmp_n[k]);
}
}
}
//only uses first sequence
int* ghmm_bayes_hmm_fbgibbs(ghmm_bayes_hmm *bayes, ghmm_cmodel *mo, ghmm_cseq* seq,
int burnIn, int seed){
#define CUR_PROC "ghmm_cmodel_fbgibbs"
//XXX seed
GHMM_RNG_SET (RNG, seed);
int max_seq = ghmm_cseq_max_len(seq);
double **alpha = ighmm_cmatrix_alloc(max_seq,mo->N);
double ***pmats = ighmm_cmatrix_3d_alloc(max_seq, mo->N, mo->N);
int **Q;
ARRAY_CALLOC(Q, seq->seq_number);
int seq_iter;
for(seq_iter = 0; seq_iter < seq->seq_number; seq_iter++){
ARRAY_CALLOC(Q[seq_iter], seq->seq_len[seq_iter]);
}
ghmm_sample_data data;
ghmm_alloc_sample_data(bayes, &data);
ghmm_clear_sample_data(&data, bayes);//XXX swap parameter
for(; burnIn > 0; burnIn--){
for(seq_iter = 0; seq_iter < seq->seq_number; seq_iter++){
ghmm_cmodel_fbgibbstep(mo,seq->seq[seq_iter],seq->seq_len[seq_iter], Q[seq_iter],
alpha, pmats, NULL);
ghmm_get_sample_data(&data, bayes, Q[seq_iter], seq->seq[seq_iter],
seq->seq_len[seq_iter]);
ghmm_update_model(mo, bayes, &data);
ghmm_clear_sample_data(&data, bayes);
}
}
ighmm_cmatrix_free(&alpha, max_seq);
ighmm_cmatrix_3d_free(&pmats, max_seq,mo->N);
return Q;
STOP:
return NULL; //XXX error handle
#undef CUR_PROC
}
int* ghmm_bayes_hmm_fbgibbs_compressed(ghmm_bayes_hmm *bayes, ghmm_cmodel *mo, ghmm_cseq* seq,
int burnIn, int seed, double width, double delta, int max_len_permitted){
#define CUR_PROC "ghmm_cmodel_fbgibbs"
//XXX seed
GHMM_RNG_SET (RNG, seed);
block_stats *stats = compress_observations(seq, width*delta, delta);
stats = merge_observations(seq, width, max_len_permitted, stats);
print_stats(stats, seq->seq_len[0]);
//get max_block_len
int max_block_len = stats->length[0];
int i;
for(i = 1; i < stats->total; i++){
if(max_block_len < stats->length[i])
max_block_len = stats->length[i];
}
//printf("max b len %d\n", max_block_len);
double ***b = ighmm_cmatrix_3d_alloc(stats->total, mo->N, 2);
double **alpha = ighmm_cmatrix_alloc(seq->seq_len[0],mo->N);
double ***pmats = ighmm_cmatrix_3d_alloc(seq->seq_len[0], mo->N, mo->N);
int *Q;
ARRAY_CALLOC(Q, seq->seq_len[0]);//XXX extra length for compressed
ghmm_sample_data data;
ghmm_alloc_sample_data(bayes, &data);
ghmm_clear_sample_data(&data, bayes);//XXX swap parameter
for(; burnIn > 0; burnIn--){
//XXX only using seq 0
precompute_block_emission(mo, stats, max_block_len, b);//XXX maxlen
ghmm_cmodel_fbgibbstep(mo,seq->seq[0], stats->total, Q, alpha, pmats, b);
ghmm_get_sample_data_compressed(&data, bayes, Q, seq->seq[0],
stats->total, stats);
ghmm_update_model(mo, bayes, &data);
ghmm_clear_sample_data(&data, bayes);
}
ighmm_cmatrix_free(&alpha, seq->seq_len[0]);
ighmm_cmatrix_3d_free(&pmats, seq->seq_len[0],mo->N);
ighmm_cmatrix_3d_free(&b, stats->total, mo->N);
free_block_stats(&stats);
return Q;
STOP:
return NULL; //XXX error handle
#undef CUR_PROC
}