コード例 #1
0
ファイル: GesConcurrent.java プロジェクト: renjiey/tetrad
 /**
  * Fully direct a graph with background knowledge. I am not sure how to adapt Chickering's
  * suggested algorithm above (dagToPdag) to incorporate background knowledge, so I am also
  * implementing this algorithm based on Meek's 1995 UAI paper. Notice it is the same implemented
  * in PcSearch. *IMPORTANT!* *It assumes all colliders are oriented, as well as arrows dictated by
  * time order.*
  */
 private void meekOrient(Graph graph, IKnowledge knowledge) {
   MeekRules rules = new MeekRules();
   rules.setOrientInPlace(false);
   rules.setKnowledge(knowledge);
   rules.orientImplied(graph);
 }
コード例 #2
0
 public ImpliedOrientation getMeekRules() {
   MeekRules rules = new MeekRules();
   rules.setKnowledge(params.getKnowledge());
   return rules;
 }