BMN: The pseudo-likelihood method for pairwise binary markov networks

This package implements approximate and exact methods for pairwise binary markov models. The exact method uses an implementation of the junction tree algorithm for binary graphical models. For more details see the help files

AuthorHolger Hoefling
Date of publication2010-04-25 16:00:14
MaintainerHolger Hoefling <hhoeflin@gmail.com>
LicenseGPL-2
Version1.02

View on CRAN

Files in this package

BMN
BMN/R
BMN/R/BMNExact.R BMN/R/BMNPseudo.R BMN/R/SynDataGibbs.R BMN/R/BMNJT.R
BMN/src
BMN/src/pseudoLikelihood.cc
BMN/src/Makevars.old
BMN/src/ProbGraph.cc
BMN/src/JTAlgWrapper.cc
BMN/src/pseudoLikelihood.h
BMN/src/Potential.cc
BMN/src/Potential.h
BMN/src/ProbGraph.h
BMN/src/Makevars.win
BMN/src/JunctionTree.h
BMN/src/JunctionTree.cc
BMN/src/Makevars
BMN/man
BMN/man/BMNExact.Rd BMN/man/BMNExamples.Rd BMN/man/BMNPseudo.Rd BMN/man/BMNJT.Rd
BMN/DESCRIPTION
BMN/NAMESPACE

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.