The complexity of strict minimum message length inference

Computer Journal

Volumn 45, Issue 3, 2002, Pages 285-292

  Farr, G E ^a   Wallace, C S ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PROCESSING; ENCODING (SYMBOLS); HEURISTIC METHODS; INFORMATION THEORY;

BINOMIAL DISTRIBUTIONS; STRICT MINIMUM MESSAGE LENGTH (SMML) INFERENCE;

COMPUTATIONAL COMPLEXITY;

EID: 0036271820     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.3.285     Document Type: Article

References (22)

1. A formal theory of inductive inference I, II
2. An information measure for classification
3. A program for numerical classification
4. An invariant Bayes method for point estimation
5. Estimation and inference by compact coding
6. Parameter estimation by shortest description of data
7. Modelling by shortest data description
8. Stochastic complexity
9. Compression and approximate matching
10. The posterior probability distribution of alignments and its application to parameter estimation of evolutionary trees and to optimization of multiple alignments
11. Finite-state models in the alignment of macromolecules
12. A decision graph explanation of protein secondary structure prediction
13. Decision tree models of bushfire activity
14. Perceptions of family functioning and cancer
15. Constructing a minimal diagnostic decision tree
16. Stone circle geometries: An information theory approach
17. False oracles and strict MML estimators
18. Minimum message length and kolmogorov complexity
19. A mathematical theory of communication