EM algorithms for beta kernel distributions
Mahdi Teimouri, Saralees Nadarajah, Shou Hsing Shih
Abstract
Mahdi Teimouri, Saralees Nadarajah, Shou Hsing Shih
Abstract
The EM algorithm is employed to compute maximum-likelihood estimates for beta kernel distributions. Estimation is considered under two censoring schemes: the progressive Type-I censoring and progressive Type-II right censoring schemes. As an application, the EM algorithm is executed to obtain maximum-likelihood estimates for the beta Weibull distribution under the two censoring schemes. A simulation study and two real data sets are used to show the efficiency of the EM algorithm.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The EM algorithm is employed to compute maximum-likelihood estimates for beta kernel distributions. Estimation is considered under two censoring schemes: the progressive Type-I censoring and progressive Type-II right censoring schemes. As an application, the EM algorithm is executed to obtain maximum-likelihood estimates for the beta Weibull distribution under the two censoring schemes. A simulation study and two real data sets are used to show the efficiency of the EM algorithm.
Key concepts: Mathematics, BETA (programming language), Beta distribution, Kernel (algebra), Algorithm, Applied mathematics, Statistics, Combinatorics