Package edu.cmu.tetrad.search
Class PermutationSearch
java.lang.Object
edu.cmu.tetrad.search.PermutationSearch
Implements common elements of a permutation search. The specific parts for each permutation search are implemented as a SuborderSearch.
This class specifically handles an optimization for tiered knowledge, whereby tiers in the knowledge can be searched one at a time in order from the lowest to highest, taking all variables from previous tiers as a fixed for a later tier. This allows these permutation searches to search over many more variables than otherwise, so long as tiered knowledge is available to organize the search.
This class is configured to respect the knowledge of forbidden and required edges, including knowledge of temporal tiers.
- Author:
- bryanandrews
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionPermutationSearch
(SuborderSearch suborderSearch) Constructs a new PermutationSearch using the given SuborderSearch. -
Method Summary
Modifier and TypeMethodDescriptionboolean
getCpdag()
Retrieves the value of cpdag.static Graph
Construct a graph given a specification of the parents for each node.static Graph
Constructs a graph given a specification of the parents for each node.Retrieves the GrowShrinkTree (GST) associated with the given Node.getOrder()
Retrieves the order list.Retrieves the list of variables.search()
Performs a search for a graph using the default options.search
(boolean cpdag) Performe the search and return a CPDAG.void
setCpdag
(boolean cpdag) Sets the flag indicating whether a CPDAG (partially directed acyclic graph) is wanted or not.void
setKnowledge
(Knowledge knowledge) Sets the knowledge to be used for the search.void
Sets the order list for the search.void
setSeed
(long seed) Sets the seed value used for generating random numbers.
-
Constructor Details
-
PermutationSearch
Constructs a new PermutationSearch using the given SuborderSearch.- Parameters:
suborderSearch
- The SuborderSearch (see).- See Also:
-
-
Method Details
-
getGraph
Construct a graph given a specification of the parents for each node.- Parameters:
nodes
- The nodes.parents
- A map from each node to its parents.cpDag
- Whether a CPDAG is wanted, if false, a DAG.- Returns:
- The constructed graph.
-
getGraph
public static Graph getGraph(List<Node> nodes, Map<Node, Set<Node>> parents, Knowledge knowledge, boolean cpDag) Constructs a graph given a specification of the parents for each node.- Parameters:
nodes
- The nodes.parents
- A map from each node to its parents.knowledge
- the knowledge to use to construct the graph.cpDag
- Whether a CPDAG is wanted, if false, a DAG.- Returns:
- The construted graph.
-
search
Performs a search for a graph using the default options. Returns the resulting graph.- Returns:
- The constructed CPDAG.
- Throws:
InterruptedException
-
search
Performe the search and return a CPDAG.- Parameters:
cpdag
- True a CPDAG is wanted, if false, a DAG.- Returns:
- The CPDAG.
- Throws:
InterruptedException
-
getOrder
-
setOrder
Sets the order list for the search.- Parameters:
order
- The order list to set. Must contain all variables.- Throws:
AssertionError
- If the order list does not contain all variables.
-
getGST
Retrieves the GrowShrinkTree (GST) associated with the given Node.- Parameters:
node
- The Node whose GST is to be retrieved.- Returns:
- The GrowShrinkTree associated with the given Node.
-
getVariables
-
setKnowledge
Sets the knowledge to be used for the search.- Parameters:
knowledge
- The knowledge to be set.
-
getCpdag
public boolean getCpdag()Retrieves the value of cpdag.- Returns:
- The value of the cpdag flag.
-
setCpdag
public void setCpdag(boolean cpdag) Sets the flag indicating whether a CPDAG (partially directed acyclic graph) is wanted or not.- Parameters:
cpdag
- The value indicating whether a CPDAG is wanted or not.
-
setSeed
public void setSeed(long seed) Sets the seed value used for generating random numbers.- Parameters:
seed
- The seed value to set.
-