networkfamily              package:deal              R Documentation

_G_e_n_e_r_a_t_e_s _a_n_d _l_e_a_r_n_s _a_l_l _n_e_t_w_o_r_k_s _f_o_r _a _s_e_t _o_f _v_a_r_i_a_b_l_e_s.

_D_e_s_c_r_i_p_t_i_o_n:

     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
     `unique.networkfamily') are available.

_U_s_a_g_e:

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

     print(x,...)
     plot(x,layout=<<see below>>,
             cexscale=5,arrowlength=0.1,sscale=7,...) 

_A_r_g_u_m_e_n_t_s:

      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 `plot.network'.

_D_e_t_a_i_l_s:

     `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.

_V_a_l_u_e:

     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'.

_N_o_t_e:

     Generating all possible networks can be very time consuming!

_A_u_t_h_o_r(_s):

     Susanne Gammelgaard Bttcher alma@math.auc.dk, 
     Claus Dethlefsen dethlef@math.auc.dk.

_R_e_f_e_r_e_n_c_e_s:

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

_S_e_e _A_l_s_o:

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

_E_x_a_m_p_l_e_s:

     data(rats)
     allrats <- networkfamily(rats)$nw
     plot(allrats)
     print(allrats)

