blip.solver: Structure Optimization

In mauro-idsia/r.blip: R binding of blip (Bayesian network Learning Improved Project)

Description

Find an optimal structure from the cache of parent sets

Usage

blip.solver(jkl, method = "winasobs", time = 3600, cores = 1,
  verbose = 1)

Arguments

jkl	cache of pre-computed parent sets.(required)
method	Method to be used. Possible values: "winasobs", "winobs", "asobs", "obs". (default: winasobs)
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

mauro-idsia/r.blip documentation built on May 12, 2019, 8:44 a.m.