Learn R Programming

⚠️There's a newer version (3.1.9) of this package.Take me there.

abn (version 2.2.2)

Modelling Multivariate Data with Additive Bayesian Networks

Description

Bayesian network analysis is a form of probabilistic graphical models which derives from empirical data a directed acyclic graph, DAG, describing the dependency structure between random variables. An additive Bayesian network model consists of a form of a DAG where each node comprises a generalized linear model, GLM. Additive Bayesian network models are equivalent to Bayesian multivariate regression using graphical modelling, they generalises the usual multivariable regression, GLM, to multiple dependent variables. 'abn' provides routines to help determine optimal Bayesian network models for a given data set, where these models are used to identify statistical dependencies in messy, complex data. The additive formulation of these models is equivalent to multivariate generalised linear modelling (including mixed models with iid random effects). The usual term to describe this model selection process is structure discovery. The core functionality is concerned with model selection - determining the most robust empirical model of data from interdependent variables. Laplace approximations are used to estimate goodness of fit metrics and model parameters, and wrappers are also included to the INLA package which can be obtained from . The computing library JAGS is used to simulate 'abn'-like data. A comprehensive set of documented case studies, numerical accuracy/quality assurance exercises, and additional documentation are available from the 'abn' website .

Copy Link

Version

Install

install.packages('abn')

Monthly Downloads

716

Version

2.2.2

License

GPL (>= 2)

Maintainer

Gilles Kratzer

Last Published

July 2nd, 2020

Functions in abn (2.2.2)

. abn .

abn Package
ex1.dag.data

Synthetic validation data set for use with abn library examples
adg

Dataset related to average daily growth performance and abattoir findings in pigs commercial production.
compareDag

Compare two DAGs
abn-internal

abn internal functions
FCV

Dataset related to Feline calicivirus infection among cats in Switzerland.
discretization

Discretization of a Possibly Continuous Data Frame of Random Variables based on their distribution
createDag

Create a legitimate DAGs
ex0.dag.data

Synthetic validation data set for use with abn library examples
fitabn

Fit an additive Bayesian network model
buildscorecache

Build a cache of goodness of fit metrics for each node in a DAG, possibly subject to user-defined restrictions
searchHeuristic

A family of heuristic algorithms that aims at finding high scoring directed acyclic graphs
miData

Empirical Estimation of the Entropy from a Table of Counts
ex2.dag.data

Synthetic validation data set for use with abn library examples
infoDag

Compute standard information for a DAG.
expit

Expit, Logit, and odds
ex5.dag.data

Valdiation data set for use with abn library examples
entropyData

Computes an Empirical Estimation of the Entropy from a Table of Counts
essentialGraph

Plot an ABN graphic
scoreContribution

Compute the score's contribution in a network of each observation.
ex6.dag.data

Valdiation data set for use with abn library examples
ex3.dag.data

Validation data set for use with abn library examples
ex7.dag.data

Valdiation data set for use with abn library examples
linkStrength

A function that returns the strengths of the edge connections in a Bayesian Network learned from observational data.
ex4.dag.data

Valdiation data set for use with abn library examples
simulateAbn

Simulate from an ABN Network
pigs.vienna

Dataset related to diseases present in `finishing pigs', animals about to enter the human food chain at an abattoir.
or

Odds Ratio from a Table
var33

simulated dataset from a DAG comprising of 33 variables
simulateDag

Simulate DAGs
plotabn

Plot an ABN graphic
tographviz

Convert a DAG into graphviz format
mostprobable

Find most probable DAG structure
mb

Compute the Markov blanket
searchHillclimber

Find high scoring directed acyclic graphs using heuristic search.