Crandore Hub

GreedyEPL

Greedy Expected Posterior Loss

Summarises a collection of partitions into a single optimal partition. The objective function is the expected posterior loss, and the minimisation is performed through a greedy algorithm described in Rastelli, R. and Friel, N. (2017) "Optimal Bayesian estimators for latent variable cluster models" <DOI:10.1007/s11222-017-9786-y>.

Versions across snapshots

VersionRepositoryFileSize
1.3 rolling source/ R- GreedyEPL_1.3.tar.gz 11.8 KiB
1.3 rolling linux/jammy R-4.5 GreedyEPL_1.3.tar.gz 77.0 KiB
1.3 rolling linux/noble R-4.5 GreedyEPL_1.3.tar.gz 78.5 KiB
1.3 latest source/ R- GreedyEPL_1.3.tar.gz 11.8 KiB
1.3 latest linux/jammy R-4.5 GreedyEPL_1.3.tar.gz 77.0 KiB
1.3 latest linux/noble R-4.5 GreedyEPL_1.3.tar.gz 78.5 KiB
1.3 2026-04-23 source/ R- GreedyEPL_1.3.tar.gz 11.8 KiB
1.3 2026-04-09 windows/windows R-4.5 GreedyEPL_1.3.zip 396.1 KiB
1.2 2025-04-20 source/ R- GreedyEPL_1.2.tar.gz 11.8 KiB

Dependencies (latest)

Imports

LinkingTo