Evidential-EM Algorithm Applied to Progressively Censored Observations

January 07, 2015 Β· Declared Dead Β· πŸ› International Conference on Information Processing and Management of Uncertainty

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kuang Zhou, Arnaud Martin, Quan Pan arXiv ID 1501.01432 Category cs.AI: Artificial Intelligence Cross-listed stat.ME Citations 6 Venue International Conference on Information Processing and Management of Uncertainty Last Checked 4 months ago
Abstract
Evidential-EM (E2M) algorithm is an effective approach for computing maximum likelihood estimations under finite mixture models, especially when there is uncertain information about data. In this paper we present an extension of the E2M method in a particular case of incom-plete data, where the loss of information is due to both mixture models and censored observations. The prior uncertain information is expressed by belief functions, while the pseudo-likelihood function is derived based on imprecise observations and prior knowledge. Then E2M method is evoked to maximize the generalized likelihood function to obtain the optimal estimation of parameters. Numerical examples show that the proposed method could effectively integrate the uncertain prior infor-mation with the current imprecise knowledge conveyed by the observed data.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted