Package edu.cmu.tetrad.search
Class TeyssierScorerExperimental
java.lang.Object
edu.cmu.tetrad.search.TeyssierScorerExperimental
Implements a scorer extending Teyssier, M., and Koller, D. (2012). Ordering-based search: A simple and effective
algorithm for learning Bayesian networks. arXiv preprint arXiv:1207.1429. You give it a score function
and a variable ordering, and it computes the score. You can move any variable left or right, and it will
keep track of the score using the Teyssier and Kohler method. You can move a variable to a new position,
and you can bookmark a state and come back to it.
- Author:
- josephramsey, bryanandrews
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
TeyssierScorerExperimental
-
-
Method Details
-
shuffleOrder
public void shuffleOrder() -
setOrder
-
getScore
public double getScore() -
hasParent
public boolean hasParent(int i, int j) -
tuck
public boolean tuck(int i, int j) -
getGraph
-
size
public int size()
-