/
FullJointDistributionModel.java
157 lines (126 loc) · 4.52 KB
/
FullJointDistributionModel.java
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
package aima.core.probability.full;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.Set;
import aima.core.probability.CategoricalDistribution;
import aima.core.probability.FiniteProbabilityModel;
import aima.core.probability.ProbabilityModel;
import aima.core.probability.RandomVariable;
import aima.core.probability.proposition.ConjunctiveProposition;
import aima.core.probability.proposition.Proposition;
import aima.core.probability.util.ProbUtil;
import aima.core.probability.util.ProbabilityTable;
/**
* An implementation of the FiniteProbabilityModel API using a full joint
* distribution as the underlying model.
*
* @author Ciaran O'Reilly
*/
public class FullJointDistributionModel implements FiniteProbabilityModel {
private ProbabilityTable distribution = null;
private Set<RandomVariable> representation = null;
public FullJointDistributionModel(double[] values, RandomVariable... vars) {
if (null == vars) {
throw new IllegalArgumentException(
"Random Variables describing the model's representation of the World need to be specified.");
}
distribution = new ProbabilityTable(values, vars);
representation = new LinkedHashSet<RandomVariable>();
for (int i = 0; i < vars.length; i++) {
representation.add(vars[i]);
}
representation = Collections.unmodifiableSet(representation);
}
//
// START-ProbabilityModel
public boolean isValid() {
// Handle rounding
return Math.abs(1 - distribution.getSum()) <= ProbabilityModel.DEFAULT_ROUNDING_THRESHOLD;
}
public double prior(Proposition... phi) {
return probabilityOf(ProbUtil.constructConjunction(phi));
}
public double posterior(Proposition phi, Proposition... evidence) {
Proposition conjEvidence = ProbUtil.constructConjunction(evidence);
// P(A | B) = P(A AND B)/P(B) - (13.3 AIMA3e)
Proposition aAndB = new ConjunctiveProposition(phi, conjEvidence);
double probabilityOfEvidence = prior(conjEvidence);
if (0 != probabilityOfEvidence) {
return prior(aAndB) / probabilityOfEvidence;
}
return 0;
}
public Set<RandomVariable> getRepresentation() {
return representation;
}
// END-ProbabilityModel
//
//
// START-FiniteProbabilityModel
public CategoricalDistribution priorDistribution(Proposition... phi) {
return jointDistribution(phi);
}
public CategoricalDistribution posteriorDistribution(Proposition phi,
Proposition... evidence) {
Proposition conjEvidence = ProbUtil.constructConjunction(evidence);
// P(A | B) = P(A AND B)/P(B) - (13.3 AIMA3e)
CategoricalDistribution dAandB = jointDistribution(phi, conjEvidence);
CategoricalDistribution dEvidence = jointDistribution(conjEvidence);
return dAandB.divideBy(dEvidence);
}
public CategoricalDistribution jointDistribution(
Proposition... propositions) {
ProbabilityTable d = null;
final Proposition conjProp = ProbUtil
.constructConjunction(propositions);
final LinkedHashSet<RandomVariable> vars = new LinkedHashSet<RandomVariable>(
conjProp.getUnboundScope());
if (vars.size() > 0) {
RandomVariable[] distVars = new RandomVariable[vars.size()];
vars.toArray(distVars);
final ProbabilityTable ud = new ProbabilityTable(distVars);
final Object[] values = new Object[vars.size()];
ProbabilityTable.Iterator di = new ProbabilityTable.Iterator() {
public void iterate(Map<RandomVariable, Object> possibleWorld,
double probability) {
if (conjProp.holds(possibleWorld)) {
int i = 0;
for (RandomVariable rv : vars) {
values[i] = possibleWorld.get(rv);
i++;
}
int dIdx = ud.getIndex(values);
ud.setValue(dIdx, ud.getValues()[dIdx] + probability);
}
}
};
distribution.iterateOverTable(di);
d = ud;
} else {
// No Unbound Variables, therefore just return
// the singular probability related to the proposition.
d = new ProbabilityTable();
d.setValue(0, prior(propositions));
}
return d;
}
// END-FiniteProbabilityModel
//
//
// PRIVATE METHODS
//
private double probabilityOf(final Proposition phi) {
final double[] probSum = new double[1];
ProbabilityTable.Iterator di = new ProbabilityTable.Iterator() {
public void iterate(Map<RandomVariable, Object> possibleWorld,
double probability) {
if (phi.holds(possibleWorld)) {
probSum[0] += probability;
}
}
};
distribution.iterateOverTable(di);
return probSum[0];
}
}