@inproceedings{aabccd150d704ee5b8cc3bca1ef8e03f,
title = "Minimum message length analysis of the behrens-fisher problem",
abstract = "Given two sequences of Gaussian data, the Behrens-Fisher problem is to infer whether there exists a difference between the two corresponding population means if the population variances are unknown. This paper examines the Behrens-Fisher-type problem within the minimum message length framework of inductive inference. Using a special bounding on a uniform prior over the population means, a simple Bayesian hypothesis test is derived that does not require computationally expensive numerical integration of the posterior distribution. The minimum message length procedure is then compared against well-known methods on the Behrens-Fisher hypothesis testing problem and the estimation of the common mean problem showing excellent performance in both cases. Extensions to the generalised Behrens-Fisher problem and the multivariate Behrens-Fisher problem are also discussed.",
author = "Enes Makalic and Schmidt, \{Daniel F.\}",
year = "2013",
month = dec,
day = "1",
doi = "10.1007/978-3-642-44958-1-19",
language = "English",
isbn = "9783642449574",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "250--260",
booktitle = "Algorithmic Probability and Friends",
note = "Ray Solomonoff 85th Memorial Conference on Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence ; Conference date: 30-11-2011 Through 02-12-2011",
}