Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 106-112 |
Journal | Journal of the Royal Statistical Society. Series B: Statistical Methodology |
Volume | 40 |
Issue number | 1 |
State | Published - 1978 |
Externally published | Yes |