1980
DOI: 10.1007/bf02888347
|View full text |Cite
|
Sign up to set email alerts
|

Approximations of unsupervised Bayes learning procedures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1983
1983
1991
1991

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…for the next k observations using (3)-{1O) and so on. The exact evaluation of the mean and variance of the mixture is computationally too cumbersome for large k, Quasi-Bayes (QB(k» (Makov, 1979;Smith and Makov, 1980) Here the unknown o's are substituted by their expectation.…”
Section: Approximating Proceduresmentioning
confidence: 99%
“…for the next k observations using (3)-{1O) and so on. The exact evaluation of the mean and variance of the mixture is computationally too cumbersome for large k, Quasi-Bayes (QB(k» (Makov, 1979;Smith and Makov, 1980) Here the unknown o's are substituted by their expectation.…”
Section: Approximating Proceduresmentioning
confidence: 99%
“…PROFILE LIKELIHOOD WITH SOME RANDOM X Suppose ( Yi, Xi), for i = 1, . The situation is akin to unsupervized learning as discussed, for example, by Makov (1980). ., n, are calibration data from model (I i 1) with controlled X's, but that there are also separately a random sample of X-values, px 1 vectors x,...…”
Section: Introductionmentioning
confidence: 99%