forward_greedy_fast: A faster version of a forward greedy search

In kelvinyangli/mbmml: Learn Markov blankets using Minimum Message Length

Description

This is a faster version of a forward greedy search. It can only be used with mml_cpt_fast() as the objective function.

Usage

forward_greedy_fast(data, varCnt, arities, vars, sampleSize, target,
  alpha = 1, statingPara = FALSE, debug = FALSE)

Arguments

data	A categorical data set.
varCnt	A list of stored indices for each value of each node. It is obtained by the function count_occurance().
arities	A vector of arities.
vars	vars
sampleSize	Sample size of the given data.
target	The target node.
alpha	A vector of concentration parameters for a Dirichlet distribution. Range is from zeor to positive infinity, length is equal to the arity of the target variable.
statingPara	Default is FALSE. If TRUE, then MML estimate of the parameters are also stated with extra 0.5log(pi*e/6) per parameter.
debug	A boolearn argument to display more details.

kelvinyangli/mbmml documentation built on June 29, 2020, 3:12 a.m.