Debian Codegraph @

src/Dirichlet.cpp

raw
1 #include "Dirichlet.h"
2 #include "Sum.h"
3 #include "Product.h"
4 #include <iostream>
5
6
7 long double dirichlet(const vector<long double>& probs,
8 const vector<int>& obs,
9 long double s) {
10
11 vector<long double> alphas;
12 for (vector<int>::const_iterator o = obs.begin(); o != obs.end(); ++o)
13 alphas.push_back(*o + 1 * s);
14
15 vector<long double> obsProbs;
16 vector<long double>::const_iterator a = alphas.begin();
17 vector<long double>::const_iterator p = probs.begin();
18 for (; p != probs.end() && a != alphas.end(); ++p, ++a) {
19 obsProbs.push_back(pow(*p, *a - 1));
20 }
21
22 return 1.0 / beta(alphas) * product(obsProbs);
23
24 }
25
26 long double dirichletMaximumLikelihoodRatio(const vector<long double>& probs,
27 const vector<int>& obs,
28 long double s) {
29 long double maximizingObs = obs.size() / sum(obs);
30 vector<int> m(obs.size(), maximizingObs);
31 return dirichlet(probs, obs, s) / dirichlet(probs, m, s);
32 }
33
34
35 // XXX the logspace versions are broken
36
37 long double dirichletln(const vector<long double>& probs,
38 const vector<int>& obs,
39 long double s) {
40
41 vector<long double> alphas;
42 for (vector<int>::const_iterator o = obs.begin(); o != obs.end(); ++o)
43 alphas.push_back(*o + 1 * s);
44
45 vector<long double> obsProbs;
46 vector<long double>::const_iterator a = alphas.begin();
47 vector<long double>::const_iterator p = probs.begin();
48 for (; p != probs.end() && a != alphas.end(); ++p, ++a) {
49 obsProbs.push_back(powln(log(*p), *a - 1));
50 }
51
52 return log(1.0) - (betaln(alphas) + sum(obsProbs));
53
54 }
55
56 long double dirichletMaximumLikelihoodRatioln(const vector<long double>& probs,
57 const vector<int>& obs,
58 long double s) {
59 long double maximizingObs = (long double) obs.size() / (long double) sum(obs);
60 vector<int> m(obs.size(), maximizingObs);
61 return dirichletln(probs, obs, s) - dirichletln(probs, m, s);
62 }