computePathMatrix2

auxiliary file for SID: computes a path matrix efficiently (can probably be made faster)
The only difference to the function computePathMatrix is that this function changes the graph by removing all edges that leave condSet. If condSet is empty, it just returns PathMatrix1.

The code computes the structural intervention distance (SID) between a true directed acyclic graph (DAG) and an estimated DAG. Definition and details about the implementation can be found in J. Peters and P. Bühlmann: "Structural intervention distance (SID) for evaluating causal graphs", Neural Computation 27, pages 771-799, 2015 <doi:10.1162/NECO_a_00708>.

Fred Gruber

Structural Intervention Distance

Jonas Peters

computePathMatrix2 function

<dl> <dt>G</dt>
<dd>graph.</dd> <dt>condSet</dt>
<dd>set of variables</dd> <dt>PathMatrix1</dt>
<dd>PathMatrix1</dd> <dt>spars</dt>
<dd>boolean indicating whether the matrices are sparse</dd></dl>

Arguments

Jonas Peters &lt;jonas.peters@tuebingen.mpg.de&gt;

Author

auxiliary file for SID: computes a path matrix efficiently (can probably be made faster) — computePathMatrix2

<dl>

 <dt>G</dt>
<dd>graph.</dd>

 <dt>condSet</dt>
<dd>set of variables</dd>

 <dt>PathMatrix1</dt>
<dd>PathMatrix1</dd>

 <dt>spars</dt>
<dd>boolean indicating whether the matrices are sparse</dd>

</dl>

computePathMatrix2: auxiliary file for SID: computes a path matrix efficiently (can probably be made faster)

Description

Usage

Value

Arguments

Author

See Also