mrfse
Markov Random Field Structure Estimator
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).
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.4.2 |
rolling linux/jammy R-4.5 | mrfse_0.4.2.tar.gz |
103.9 KiB |
0.4.2 |
rolling linux/noble R-4.5 | mrfse_0.4.2.tar.gz |
105.5 KiB |
0.4.2 |
rolling source/ R- | mrfse_0.4.2.tar.gz |
13.8 KiB |
0.4.2 |
latest linux/jammy R-4.5 | mrfse_0.4.2.tar.gz |
103.9 KiB |
0.4.2 |
latest linux/noble R-4.5 | mrfse_0.4.2.tar.gz |
105.5 KiB |
0.4.2 |
latest source/ R- | mrfse_0.4.2.tar.gz |
13.8 KiB |
0.4.2 |
2026-04-26 source/ R- | mrfse_0.4.2.tar.gz |
13.8 KiB |
0.4.2 |
2026-04-23 source/ R- | mrfse_0.4.2.tar.gz |
13.8 KiB |
0.4.2 |
2026-04-09 windows/windows R-4.5 | mrfse_0.4.2.zip |
513.8 KiB |
0.4.2 |
2025-04-20 source/ R- | mrfse_0.4.2.tar.gz |
13.8 KiB |