You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* Adding bips_tpc: This version introduces the bips_tpc module, based on the temporal PC (tPC) and the micd package. It enables causal discovery through the PC algorithm allowing for Edge constraints, mixed data, and missing data handling.
* Updating basic conf example. Updating example for MVPC.
Copy file name to clipboardExpand all lines: docs/source/available_background_knowledge.rst
+30-20Lines changed: 30 additions & 20 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -8,47 +8,54 @@ Edge constraints
8
8
---------------------------------------
9
9
10
10
Benchpress allows users to incorporate edge constraints to guide structure learning algorithms in several packages:
11
-
**pcalg**, **mvpc**, **bnlearn**, **tetrad**, **gobnilp**, and **bidag**. These constraints enable the inclusion of prior knowledge to refine
11
+
**pcalg**, **bips_tpc**, **mvpc**, **bnlearn**, **tetrad**, **gobnilp**, and **bidag**. These constraints enable the inclusion of prior knowledge to refine
12
12
the search space of causal graphs, improving the reliability of the inferred relationships. Users can specify **forbidden or
13
13
required edges**, **tiers for temporal ordering**, and **group-based constraints**.
14
14
15
15
The edge constraints should be defined in a JSON file located within the ``resources/constraints`` folder.
- ``forbidden_edges``: A list of directed edges that are explicitly prohibited from existing between specific nodes. Each edge is defined as a pair of nodes, where the first node cannot directly cause the second node.
38
41
- ``required_edges``: A list of directed edges that are enforced between specific nodes. Each edge is defined as a pair of nodes, where the first node must directly cause the second node.
39
-
40
-
- *Note: For algorithms in the* **pcalg** and **mvpc** *package, the above attributes only specify the presence or absence of edges and do not control their directionality.*
41
42
- ``tiers``: Defines a temporal ordering of nodes across multiple levels (or) tiers. Nodes in one tier are constrained from causing nodes in any of the preceding tiers.
42
43
- ``tier_settings``:
43
44
44
45
- ``forbidden_within_tiers``: If set to `true`, prevents edges between nodes that reside within the same tier.
45
46
- ``can_only_cause_next_tier``: If set to `true`, restricts nodes in one tier to only influence or cause nodes in the immediate next tier.
46
47
47
-
- ``Groups``: Defines relationships between sets of nodes, grouping them for the purpose of controlling edge behavior across multiple nodes at once. Each group is defined by a collection of "cause" nodes and "effect" nodes.
48
+
- *Groups*: Defines relationships between sets of nodes, grouping them for the purpose of controlling edge behavior across multiple nodes at once. Each group is defined by a collection of "cause" nodes and "effect" nodes.
48
49
49
50
- ``forbidden_groups``: A set of constraints that prohibits directed edges between specified groups of nodes.
50
51
- ``required_groups``: A set of requirements that enforces directed edges between specified groups of nodes.
52
+
- ``context_all``: If set to `true`, edges added from this node to all other nodes.
53
+
- ``context_tier``: If set to `true`, edges added from this node to all nodes within the same tier.
54
+
- ``source_nodes``: A list of nodes that are restricted to have no parents.
51
55
56
+
.. note::
57
+
58
+
For algorithms in the **pcalg** and **mvpc** *package, the above attributes only specify the presence or absence of edges and do not control their directionality.*
52
59
53
60
.. rubric:: Example JSON
54
61
@@ -89,7 +96,10 @@ The edge constraints should be defined in a JSON file located within the ``resou
0 commit comments