deal (version 1.2-8)

networkfamily: Generates and learns all networks for a set of variables.

Description

Method for generating and learning all networks that are possible for a given set of variables. These may be plotted or printed. Also, functions for sorting according to the network score (see nwfsort) and for making a network family unique (see the unique method for networkfamily objects) are available.

Usage

networkfamily(data,nw=network(data), prior=jointprior(nw),
              trylist=vector("list",size(nw)), timetrace=TRUE) 

## S3 method for class 'networkfamily':
print(x,...)
## S3 method for class 'networkfamily':
plot(x,layout=,
        cexscale=5,arrowlength=0.1,sscale=7,...)

Arguments

nw

an object of class network. This should be the empty network for the set of variables.

data

a data frame used for learning the network, see network.

prior

a list containing parameter priors, generated by jointprior.

trylist

a list used internally for reusing learning of nodes, see maketrylist.

timetrace

a logical. If TRUE, prints some timing information on the screen.

x

an object of class networkfamily.

layout

a numeric two dimensional vector with the number of plots in the rows and columns of each plotting page. Default set to rep(min(1+floor(sqrt(length(x))),5),2).

cexscale

a numeric. A scaling parameter to set the size of the nodes.

arrowlength

a numeric, which gives the length of the arrow heads.

sscale

a numeric. The nodes are initially placed on a circle with radius sscale.

...

additional plot arguments passed to the plot method for network objects.

Value

• The function networkfamily returns a list with two components,
• nw
  an object of class networkfamily.
• trylist
  an updated list used internally for reusing learning of nodes, see maketrylist.

Details

networkfamily generates and learns all possible networks with the nodes given as in the initial network nw. This is done by successively trying to generate the networks with all possible arrows to/from each node (see addarrows). If there is a ban list present in nw (see network), then this is respected, as are the restrictions described in insert. After generation of all possible networks, a test for cycles (see cycletest) is performed and only networks with directed acyclic graphs are returned.

References

Further information about deal can be found at: http://www.math.auc.dk/novo/deal.

See Also

network, genlatex, heuristic, nwfsort, unique.networkfamily, elementin, addarrows, cycletest

Examples

data(rats)
allrats <- getnetwork(networkfamily(rats))
plot(allrats)
print(allrats)