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 q = (q_{1} \\cdots q_{m-1}) of m statistical classes with known probability density functions F_{1}(X) \\cdots F_{m}(x) on the basis of n statistically independent observations (X_{l} \\cdots x_{n}) is considered. The mixture density g(x\\mid q) = \\sum^{m-1}_{j=1}q_{j}F_{j}(x) + (1 - \\sum^{m-1}_{\\tau = 1}q_{\\tau})F_{m}(x) is used to show that the maximum likelihood estimate of q is asymptotically efficient and weakly consistent under very mild constraints on the set of density functions. A recursive estimate is proposed for q . By using stochastic approximation theory and optimizing the gain sequence, it is shown that the recursive estimate is asymptotically efficient for the m = 2 class case. For m > 2 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 :
بازگشت