Examples of aima.core.probability.bayes.Node

aima.core.probability.bayes.Node
Artificial Intelligence A Modern Approach (3rd Edition): page 511.

A node is annotated with quantitative probability information. Each node corresponds to a random variable, which may be discrete or continuous. If there is an arrow from node X to node Y in a Bayesian Network, X is said to be a parent of Y and Y is a child of X. Each node X_i has a conditional probability distribution P(X_i | Parents(X_i)) that quantifies the effect of the parents on the node.
@author Ciaran O'Reilly

    public boolean containsValue(RandomVariable rv) {
      return varIdxs.get(rv) <= extendedIdx;
    }


    public double posteriorForParents(RandomVariable rv) {
      Node n = bn.getNode(rv);
      if (!(n instanceof FiniteNode)) {
        throw new IllegalArgumentException(
            "Enumeration-Ask only works with finite Nodes.");
      }
      FiniteNode fn = (FiniteNode) n;
      Object[] vals = new Object[1 + fn.getParents().size()];
      int idx = 0;
      for (Node pn : n.getParents()) {
        vals[idx] = extendedValues[varIdxs.get(pn.getRandomVariable())];
        idx++;
      }
      vals[idx] = extendedValues[varIdxs.get(rv)];

View Full Code Here

    Set<Node> s = new LinkedHashSet<Node>();
    for (Node n : this.rootNodes) {
      walkNode(n, seenAlready, incomingEdges, s);
    }
    while (!s.isEmpty()) {
      Node n = s.iterator().next();
      s.remove(n);
      variables.add(n.getRandomVariable());
      varToNodeMap.put(n.getRandomVariable(), n);
      for (Node m : n.getChildren()) {
        List<Node> edges = incomingEdges.get(m);
        edges.remove(n);
        if (edges.isEmpty()) {
          s.add(m);
        }

View Full Code Here

  // PRIVATE METHODS
  //
  private Factor makeFactor(RandomVariable var, AssignmentProposition[] e,
      BayesianNetwork bn) {


    Node n = bn.getNode(var);
    if (!(n instanceof FiniteNode)) {
      throw new IllegalArgumentException(
          "Elimination-Ask only works with finite Nodes.");
    }
    FiniteNode fn = (FiniteNode) n;

View Full Code Here

    public boolean containsValue(RandomVariable rv) {
      return varIdxs.get(rv) <= extendedIdx;
    }


    public double posteriorForParents(RandomVariable rv) {
      Node n = bn.getNode(rv);
      if (!(n instanceof FiniteNode)) {
        throw new IllegalArgumentException(
            "Enumeration-Ask only works with finite Nodes.");
      }
      FiniteNode fn = (FiniteNode) n;
      Object[] vals = new Object[1 + fn.getParents().size()];
      int idx = 0;
      for (Node pn : n.getParents()) {
        vals[idx] = extendedValues[varIdxs.get(pn.getRandomVariable())];
        idx++;
      }
      vals[idx] = extendedValues[varIdxs.get(rv)];

View Full Code Here

    if (o == this) {
      return true;
    }


    if (o instanceof Node) {
      Node n = (Node) o;


      return getRandomVariable().equals(n.getRandomVariable());
    }


    return false;
  }

View Full Code Here

    Set<Node> s = new LinkedHashSet<Node>();
    for (Node n : this.rootNodes) {
      walkNode(n, seenAlready, incomingEdges, s);
    }
    while (!s.isEmpty()) {
      Node n = s.iterator().next();
      s.remove(n);
      variables.add(n.getRandomVariable());
      varToNodeMap.put(n.getRandomVariable(), n);
      for (Node m : n.getChildren()) {
        List<Node> edges = incomingEdges.get(m);
        edges.remove(n);
        if (edges.isEmpty()) {
          s.add(m);
        }

View Full Code Here

TOP

Related Classes of aima.core.probability.bayes.Node

aima.core.probability.bayes.exact.EliminationAsk

aima.core.probability.bayes.exact.EnumerationAsk$ObservedEvidence

aima.core.probability.bayes.impl.AbstractNode

aima.core.probability.bayes.impl.BayesNet

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.