Package edu.cmu.tetrad.search

Class PermutationSearch

java.lang.Object

edu.cmu.tetrad.search.PermutationSearch

public class PermutationSearch
extends Object

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:

• SuborderSearch
• Boss
• Sp
• Knowledge

Constructor Summary

Constructors

Constructor	Description
PermutationSearch(SuborderSearch suborderSearch)	Constructs a new PermutationSearch using the given SuborderSearch.

Method Summary

Modifier and Type	Method	Description
static Graph	getGraph(List<Node> nodes, Map<Node,Set<Node>> parents, boolean cpDag)	Construct a graph given a specification of the parents for each node.
static Graph	getGraph(List<Node> nodes, Map<Node,Set<Node>> parents, Knowledge knowledge, boolean cpDag)	Construct a graph given a specification of the parents for each node.
GrowShrinkTree	getGST(Node node)
List<Node>	getOrder()
List<Node>	getVariables()	Returns the variables.
Graph	search()	Performe the search and return a CPDAG.
void	setKnowledge(Knowledge knowledge)	Sets the knowledge to be used in the search.
void	setOrder(List<Node> order)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

PermutationSearch

public PermutationSearch(SuborderSearch suborderSearch)

Constructs a new PermutationSearch using the given SuborderSearch.

Parameters:

suborderSearch - The SuborderSearch (see).

See Also:

• SuborderSearch

Method Details

getGraph

public static Graph getGraph(List<Node> nodes,
 Map<Node,Set<Node>> parents,
 boolean cpDag)

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)

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.

knowledge - the knoweldge to use to construct the graph.

cpDag - Whether a CPDAG is wanted, if false, a DAG.

Returns:

The construted graph.

search

public Graph search()

Performe the search and return a CPDAG.

Returns:

The CPDAG.

getOrder

public List<Node> getOrder()

setOrder

public void setOrder(List<Node> order)

getGST

public GrowShrinkTree getGST(Node node)

getVariables

public List<Node> getVariables()

Returns the variables.

Returns:

This list.

setKnowledge

public void setKnowledge(Knowledge knowledge)

Sets the knowledge to be used in the search.

Parameters:

knowledge - This knowledge.