SMML  Binomial 

Strict Minimum Message Length (SMML) inference partitions the data space. Problem:
Given N, devise an optimal code for a twopart message to transmit
For this problem there is a polynomialtime algorithm (equivalent to Dijkstra's shortestpaths algorithm) to find an optimal partition of [0..N] and so construct an optimal codebook (Farr & Wallace 1997, 2002). Assuming a uniformprior on the parameter
For a given number of trials, N, the program calculates the expected code length under an adaptive code, and, for MML, the optimal MML code book and the expected message length when using that code book. The latter is necessarily very slightly greater than that of the adaptive code because an MML message transmits not only the data but also something more, that is an opinion (inference, estimate) about the data.


↑ © L. Allison, www.allisons.org/ll/ (or as otherwise indicated). Created with "vi (Linux)", charset=iso88591, fetched Friday, 09Dec2022 12:42:28 UTC. Free: Linux, Ubuntu operatingsys, OpenOffice officesuite, The GIMP ~photoshop, Firefox webbrowser, FlashBlock flash on/off. 