http://bndev.sourceforge.net
Querying BBNCPF [2]
nThe code:
Hashtable t = new Hashtable();
t.put(“a”, “true”); t.put(“c”, “false”);
double value = c.query(t);
will result in:
value = c.query(t U “b = true”) + c.query(t U “b = false”);
Hashtable t = new Hashtable();
t.put(“a”, “true”); t.put(“c”, “false”);
double value = c.query(t);
will result in:
value = c.query(t U “b = true”) + c.query(t U “b = false”);
nSo, if we omit b from the hash table, we are effectively marginalizing on b from c’s table.