Estimations of competing lifetime data from inverse Weibull distribution under adaptive progressively hybrid censored

Abstract

<abstract> <p>In real-life experiments, collecting complete data is time-, finance-, and resources-consuming as stated by statisticians and analysts. Their goal was to compromise between the total time of testing, the number of units under scrutiny, and the expenditures paid through a censoring scheme. Comparing failure-censored schemes (<italic>Type</italic>-Ⅱ and Progressive <italic>Type</italic>-Ⅱ) to Time-censored schemes (<italic>Type</italic>-Ⅰ), it's worth noting that the former is time-consuming and is no more suitable to be applied in real-life situations. This is the reason why the <italic>Type</italic>-Ⅰ adaptive progressive hybrid censoring scheme has exceeded other failure-censored types; Time-censored types enable analysts to accomplish their trials and experiments in a shorter time and with higher efficiency. In this paper, the parameters of the inverse Weibull distribution are estimated under the <italic>Type</italic>-Ⅰ adaptive progressive hybrid censoring scheme (<italic>Type</italic>-Ⅰ APHCS) based on competing risks data. The model parameters are estimated using maximum likelihood estimation and Bayesian estimation methods. Further, we examine the asymptotic confidence intervals and bootstrap confidence intervals for the unknown model parameters. Monte Carlo simulations are carried out to compare the performance of the suggested estimation methods under <italic>Type</italic>-Ⅰ APHCS. Moreover, Markov Chain Monte Carlo by applying Metropolis-Hasting algorithm under the square error of loss function is used to compute Bayes estimates and related to the highest posterior density. Finally, two data sets are studied to illustrate the introduced methods of inference. Based on our results, we can conclude that the Bayesian estimation outperforms the maximum likelihood estimation for estimating the inverse Weibull parameters under <italic>Type</italic>-Ⅰ APHCS.</p> </abstract>