mrfse

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.

Last 30 days

This package has been downloaded 175 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 8 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 2,717 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Oct 23, 2024 with 51 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.