naive.getug.multinom {lcd} | R Documentation |
Learns an undirected independence graph from a given data set. The data are assumed to be multinomially distributed.
naive.getug.multinom(freq.tb, p.value, method = "mkb")
freq.tb |
an object of class freq.tb , the frequency table
for the data. |
p.value |
the thresholding p-value for each conditional independence test. |
method |
a string to specify a method, see details. |
Currently, there are three supported method
's. "mkb"
stands for grow-shrink Markov blanket selection, where greedy Markov
blanket selection is performed for each vertex and the blankets are the
neighborhood for vertices of the output graph. The "simple"
method simply performs conditional independence test for each vertex
pair with all the rest vertices as the conditioning set. The
"fwd"
method uses the forward selection procedure described in
Edwards (2000).
The adjacency matrix of an undirected graph.
Zongming Ma and Xiangrui Meng
Edwards, D. (2000). Introduction to Graphical Modelling. 2nd Ed. Springer-Verlag, New York.