DocumentCode
926580
Title
Recursive estimation of prior probabilities using a mixture
Author
Kazakos, Dimitri
Volume
23
Issue
2
fYear
1977
fDate
3/1/1977 12:00:00 AM
Firstpage
203
Lastpage
211
Abstract
The problem of estimating the prior probabilities
of
statistical classes with known probability density functions
on the basis of
statistically independent observations
is considered. The mixture density
is used to show that the maximum likelihood estimate of
is asymptotically efficient and weakly consistent under very mild constraints on the set of density functions. A recursive estimate is proposed for
. By using stochastic approximation theory and optimizing the gain sequence, it is shown that the recursive estimate is asymptotically efficient for the
class case. For
classes, the rate of convergence is computed and shown to be very close to asymptotic efficiency.
of
statistical classes with known probability density functions
on the basis of
statistically independent observations
is considered. The mixture density
is used to show that the maximum likelihood estimate of
is asymptotically efficient and weakly consistent under very mild constraints on the set of density functions. A recursive estimate is proposed for
. By using stochastic approximation theory and optimizing the gain sequence, it is shown that the recursive estimate is asymptotically efficient for the
class case. For
classes, the rate of convergence is computed and shown to be very close to asymptotic efficiency.Keywords
Parameter estimation; Probability functions; Recursive estimation; Stochastic approximation; maximum-likelihood (ML) estimation; Computational complexity; Convergence; Crops; Density functional theory; Maximum likelihood estimation; Parameter estimation; Probability density function; Recursive estimation; Remote sensing; Stochastic processes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1977.1055693
Filename
1055693
Link To Document