z-logo
Premium
Maximum‐likelihood maximum‐entropy constrained probability density function estimation for prediction of rare events
Author(s) -
Ahooyi Taha Mohseni,
Soroush Masoud,
Arbogast Jeffrey E.,
Seider Warren D.,
Oktem Ulku G.
Publication year - 2014
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.14330
Subject(s) - interpretability , principle of maximum entropy , kernel density estimation , probability density function , computer science , density estimation , likelihood function , entropy (arrow of time) , bayesian probability , mathematics , nonparametric statistics , data mining , mathematical optimization , algorithm , estimation theory , statistics , artificial intelligence , physics , quantum mechanics , estimator
This work addresses the problem of estimating complete probability density functions (PDFs) from historical process data that are incomplete (lack information on rare events), in the framework of Bayesian networks. In particular, this article presents a method of estimating the probabilities of events for which historical process data have no record. The rare‐event prediction problem becomes more difficult and interesting, when an accurate first‐principles model of the process is not available. To address this problem, a novel method of estimating complete multivariate PDFs is proposed. This method uses the maximum entropy and maximum likelihood principles. It is tested on mathematical and process examples, and the application and satisfactory performance of the method in risk assessment and fault detection are shown. Also, the proposed method is compared with a few copula methods and a nonparametric kernel method, in terms of performance, flexibility, interpretability, and rate of convergence. © 2014 American Institute of Chemical Engineers AIChE J , 60: 1013–1026, 2014

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here