A Quasi-Bayes Sequential Procedure for Mixtures
- 1 September 1978
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 40 (1) , 106-112
- https://doi.org/10.1111/j.2517-6161.1978.tb01654.x
Abstract
Summary: Coherent Bayes sequential learning and classification procedures are often useless in practice because of ever-increasing computational requirements. On the other hand, computationally feasible procedures may not resemble the coherent solution, nor guarantee consistent learning and classification. In this paper, a particular form of classification problem is considered and a “quasi-Bayes” approximate solution requiring minimal computation is motivated and defined. Convergence properties are established and a numerical illustration provided.This publication has 7 references indexed in Scilit:
- A quasi-Bayes unsupervised learning procedure for priors (Corresp.)IEEE Transactions on Information Theory, 1977
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- Recursive estimation of prior probabilities using a mixtureIEEE Transactions on Information Theory, 1977
- Updating a Diagnostic System Using Unconfirmed CasesJournal of the Royal Statistical Society Series C: Applied Statistics, 1976
- Bayesian Classification: Asymptotic ResultsThe Annals of Statistics, 1974
- Analysis of a decision-directed receiver with unknown priorsIEEE Transactions on Information Theory, 1970
- On Dvoretzky Stochastic Approximation TheoremsThe Annals of Mathematical Statistics, 1966