// ===========================SCORING METHODS===================//
public double scoreDag(Graph graph) {
Graph dag = new EdgeListGraphSingleConnections(graph);
buildIndexing(graph);
double score = 0.0;
for (Node y : dag.getNodes()) {
Set<Node> parents = new HashSet<Node>(dag.getParents(y));
int nextIndex = -1;
for (int i = 0; i < getVariables().size(); i++) {
nextIndex = hashIndices.get(variables.get(i));
}
int parentIndices[] = new int[parents.size()];
Iterator<Node> pi = parents.iterator();
int count = 0;
while (pi.hasNext()) {
Node nextParent = pi.next();
parentIndices[count++] = hashIndices.get(nextParent);
}
if (this.isDiscrete()) {
score += localDiscreteScore(nextIndex, parentIndices);
} else {
score += localSemScore(nextIndex, parentIndices);
}
}
return score;
}
/** Evaluate the Insert(X, Y, T) operator (Definition 12 from Chickering, 2002). */
private double insertEval(Node x, Node y, List<Node> t, List<Node> naYX, Graph graph) {
Set<Node> set1 = new HashSet<Node>(naYX);
set1.addAll(t);
List<Node> paY = graph.getParents(y);
set1.addAll(paY);
Set<Node> set2 = new HashSet<Node>(set1);
set1.add(x);
return scoreGraphChange(y, set1, set2);
}
// Can be done concurrently.
private double deleteEval(Node x, Node y, List<Node> h, List<Node> naYX, Graph graph) {
List<Node> paY = graph.getParents(y);
Set<Node> paYMinuxX = new HashSet<Node>(paY);
paYMinuxX.remove(x);
Set<Node> set1 = new HashSet<Node>(naYX);
set1.removeAll(h);
set1.addAll(paYMinuxX);
Set<Node> set2 = new HashSet<Node>(naYX);
set2.removeAll(h);
set2.addAll(paY);
return scoreGraphChange(y, set1, set2);
}
