INGOR
SDHybrid: Static-dynamic hybrid greedy algorithm

This estimates edges both Xt-1 to Xt, and Xt to Xt.

If there are p variables in the data set, the resultant network consists of 2 × p nodes. The additional p nodes represent ones of T−1. Such nodes have "/T-1" as their suffix of nodes names to disinguish them from the original variables.

In this document, the original nodes (or nodes represnting time t) are called as T−0 nodes.

Do not specify the dynamic model (-y) option.

Arguments

args={key [ =value, ... ] }
Arguments for the HC algorithm. See Combinatorial Greedy Hill-Climbing Algorithm for available arguments. "bs_check" is not effective in this argument. Specify it directly as an argument for this algorithm.
order=x1:x2
Specifies the order of time points estimated as parents of T−0 nodes. Use 0 representing T−0 nodes, or 1 representing T−1 nodes for x1 and x2. If specified, at first T−x1 nodes are only parent candidates. Then, the estimated parents are fixed and T−s2 node parents are estimated. If not specified, both edges from T−1 and T−0 to T−0 are estimated simultaneously.
bs_check= ( on | off )

If on is set, checks the consistency of the lengths of the secondary IDs and/or the lists for the pid and list mode bootstrap. (default: on)


INGOR Manual