Minimum message length analysis of the behrens-fisher problem

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationAlgorithmic Probability and Friends
Subtitle of host publicationBayesian Prediction and Artificial Intelligence - Papers from the Ray Solomonoff 85th Memorial Conference
Pages250-260
Number of pages11
DOIs
Publication statusPublished - 1 Dec 2013
Externally publishedYes
EventRay Solomonoff 85th Memorial Conference on Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence - Melbourne, VIC, Australia
Duration: 30 Nov 20112 Dec 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7070 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceRay Solomonoff 85th Memorial Conference on Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence
Country/TerritoryAustralia
CityMelbourne, VIC
Period30/11/112/12/11

Cite this