blip.solver.tw {r.blip}

Structure Optimization - treewidth bound

Description

Find an optimal structure from the cache of parent sets

Usage

blip.solver.tw(jkl, method = "kmax", treewidth = 4, time = 3600,
  cores = 1, verbose = 0)

Arguments

jkl

cache of pre-computed parent sets.(required)

method

Method to be used. Possible values: "kmax", "kg", "ka". (default: kmax)

treewidth

Maximum treewidth (default: 4)

time

Maximum Execution time (default: 3600)

cores

Number of machine cores to use. If 0, all are used. (default: 1)

verbose

Verbose level (default: 0)

Details

The input data is required to be complete and discrete. Accordingly missing values in the input data.frame will be ignored, and all numeric values will be converted to integers.

Value

Structure

Examples

bn <- blip.solver.tw(child.jkl, time=3)