public VariablesIterator (ACRF.UnrolledGraph acrf, Assignment observed) { this.graph = acrf; this.observed = observed; cliquesByVar = new List[graph.numVariables ()]; for (int i = 0; i < cliquesByVar.length; i++) cliquesByVar[i] = new ArrayList (); for (Iterator it = acrf.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next (); for (int vidx = 0; vidx < clique.size(); vidx++) { Variable var = clique.get(vidx); cliquesByVar[graph.getIndex (var)].add (clique); } } }
public VariablesIterator (ACRF.UnrolledGraph acrf, Assignment observed) { this.graph = acrf; this.observed = observed; cliquesByVar = new List[graph.numVariables ()]; for (int i = 0; i < cliquesByVar.length; i++) cliquesByVar[i] = new ArrayList (); for (Iterator it = acrf.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next (); for (int vidx = 0; vidx < clique.size(); vidx++) { Variable var = clique.get(vidx); cliquesByVar[graph.getIndex (var)].add (clique); } } }
public VariablesIterator (ACRF.UnrolledGraph acrf, Assignment observed) { this.graph = acrf; this.observed = observed; cliquesByVar = new List[graph.numVariables ()]; for (int i = 0; i < cliquesByVar.length; i++) cliquesByVar[i] = new ArrayList (); for (Iterator it = acrf.unrolledVarSetIterator (); it.hasNext();) { ACRF.UnrolledVarSet clique = (ACRF.UnrolledVarSet) it.next (); for (int vidx = 0; vidx < clique.size(); vidx++) { Variable var = clique.get(vidx); cliquesByVar[graph.getIndex (var)].add (clique); } } }
unrollTime += (unrollEnd - unrollStart); if (unrolled.numVariables () == 0) continue; // Happens if all nodes are pruned. inferencer.computeMarginals (unrolled); marginalsTime += (System.currentTimeMillis () - unrollEnd);
unrollTime += (unrollEnd - unrollStart); if (unrolled.numVariables () == 0) continue; // Happens if all nodes are pruned. inferencer.computeMarginals (unrolled); marginalsTime += (System.currentTimeMillis () - unrollEnd);
unrollTime += (unrollEnd - unrollStart); if (unrolled.numVariables () == 0) continue; // Happens if all nodes are pruned.
unrollTime += (unrollEnd - unrollStart); if (unrolled.numVariables () == 0) continue; // Happens if all nodes are pruned.
unrollTime += (unrollEnd - unrollStart); if (unrolled.numVariables () == 0) continue; // Happens if all nodes are pruned.
if (unrolled.numVariables () == 0) return 0; // Happens if all nodes are pruned.
if (unrolled.numVariables () == 0) return 0; // Happens if all nodes are pruned.
if (unrolled.numVariables () == 0) return 0; // Happens if all nodes are pruned.
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, templates, null, false); totalNodes =+ unrolled.numVariables (); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet clique = (UnrolledVarSet) it.next(); int tidx = clique.tmpl.index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.fv); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, templates, null, false); totalNodes =+ unrolled.numVariables (); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet clique = (UnrolledVarSet) it.next(); int tidx = clique.tmpl.index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.fv); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } } }
public void collectConstraints (InstanceList ilist) { for (int inum = 0; inum < ilist.size(); inum++) { logger.finest ("*** Collecting constraints for instance "+inum); Instance inst = ilist.get (inum); UnrolledGraph unrolled = new UnrolledGraph (inst, templates, null, false); totalNodes =+ unrolled.numVariables (); for (Iterator it = unrolled.unrolledVarSetIterator (); it.hasNext();) { UnrolledVarSet clique = (UnrolledVarSet) it.next(); int tidx = clique.tmpl.index; if (tidx == -1) continue; int assn = clique.lookupAssignmentNumber (); constraints [tidx][assn].plusEqualsSparse (clique.fv); if (defaultConstraints[tidx].location (assn) != -1) defaultConstraints [tidx].incrementValue (assn, 1.0); } } }
public boolean hasNext () { return vidx < graph.numVariables () - 1; }
public boolean hasNext () { return vidx < graph.numVariables () - 1; }
public boolean hasNext () { return vidx < graph.numVariables () - 1; }
public double getLogNumAssignments () { double total = 0; for (int i = 0; i < numVariables (); i++) { Variable var = get(i); total += Math.log (var.getNumOutcomes ()); } return total; }
public double getLogNumAssignments () { double total = 0; for (int i = 0; i < numVariables (); i++) { Variable var = get(i); total += Math.log (var.getNumOutcomes ()); } return total; }
public double getLogNumAssignments () { double total = 0; for (int i = 0; i < numVariables (); i++) { Variable var = get(i); total += Math.log (var.getNumOutcomes ()); } return total; }