Three algorithms for estimating a Markov random field structure.Two of them are an exact version and a simulated annealing version of a penalized maximum conditional likelihood method similar to the Bayesian Information Criterion. These algorithm are described in Frondana (2016) <doi:10.11606/T.45.2018.tde-02022018-151123>.The third one is a greedy algorithm, described in Bresler (2015) <doi:10.1145/2746539.2746631).
https://anaconda.org/r/r-mrfse/badges/version.svg
https://anaconda.org/r/r-mrfse/badges/latest_release_date.svg
https://anaconda.org/r/r-mrfse/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-mrfse/badges/platforms.svg
https://anaconda.org/r/r-mrfse/badges/license.svg
https://anaconda.org/r/r-mrfse/badges/downloads.svg