Abstract | ||
---|---|---|
The popular Expectation Maximization technique suffers a major drawback when used to approximate a density function using a mixture of Gaussian components; that is the number of components has to be a priori specified. Also, Expectation Maximization by itself cannot estimate time-varying density functions. In this paper, a novel stochastic technique is introduced to overcome these two limitations. Kernel density estimation is used to obtain a discrete estimate of the true density of the given data. A Stochastic Learning Automaton is then used to select the number of mixture components that minimizes the distance between the density function estimated using the Expectation Maximization and discrete estimate of the density. The validity of the proposed approach is verified using synthetic and real univariate and bivariate observation data. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/s00500-005-0028-4 | Soft Comput. |
Keywords | Field | DocType |
Expectation Maximization,Mixture Component,Kernel Density Estimation,Expectation Maximization Algorithm,Gaussian Component | Mathematical optimization,Multivariate kernel density estimation,Expectation–maximization algorithm,Gaussian,Univariate,Variable kernel density estimation,Probability density function,Mathematics,Kernel (statistics),Kernel density estimation | Journal |
Volume | Issue | ISSN |
10 | 11 | 1432-7643 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wael Abd-Almageed | 1 | 248 | 24.52 |
Aly I. El-Osery | 2 | 11 | 3.96 |
Christopher E. Smith | 3 | 1 | 0.36 |