Maximum search time |
The system will take at most this time to learn the Bayesian network. |

Score |
The learning is score-based. We currently support BIC, BDeu and MIT. |

Equivalent Sample Size |
Used for the BDeu. |

Parent search strategy |
The first option is *IS* (Independence selection), where the parent search is guided by the BIC* estimation. The second option is *GS* (Greedy selection), where at each step we explore all the superset of the best yet found parent set. The final option is *SQ* (Sequential ordering), where we don't apply any guide and follow the natural ordering. |

Structure optimization strategy |
The first option is *ASOBS* (Acyclic selection ordering-base search). The second option is *OBS* (Ordering-based search). |