Approximate maximum product spacing estimation of exponential distribution under multiply progressive
censoring †
Hyejin Shin 1 · Kyeongjun Lee 2
12 Division of Mathematics and Big Data Science, Daegu University
Received 29 August 2019, revised 11 September 2019, accepted 11 September 2019
Abstract
There are many situation in life testing experiments in which units are lost or removed from experimentation before failure. In this paper, we propose the estimators of the parameter and reliability function of the ED under MPC scheme. First, we derive the MLE and MPSE for the parameter and reliability function of ED. And we derive the approximate MPSE for the parameter and reliability function of ED using Talyor series expansion. We also compare the proposed estimators in the sense of the root mean squared error (RMSE) and bias under MPC scheme. Finally, the validity of the proposed methods are demonstrated by a real data.
Keywords: Approximate MPSE, exponential distribuiton, multiply progressive censor- ing, Taylor series expansion.
1. Introduction
Consider an exponential distribution (ED) with pdf
f (x; σ) = 1 σ exp
− x σ
(1.1) and
F (x; σ) = 1 − exp
− x σ
, x ≥ 0, σ > 0. (1.2)
Singh and Kumar (2007) consider a Bayes estimation of the ED under multiply censoring scheme. Wang (2008) proposed a goodness of fit (GOF) test statistics for the ED under progressive censoring (PC) samples. Recently, Lee and Cho (2017) consider exact inference
† This work was supported by Daegu University Undergraduate Research Program, 2019.
1
Undergraduate student, Division of Mathematics and Big Data Science, Daegu University, Gyeongsan 38453, Korea.
2
Corresponding author: Associate professor, Division of Mathematics and Big Data Science, Daegu
University, Gyeongsan 38453, Korea. E-mail: indra [email protected]
for competing risks data under generalized progressive hybrid censored ED. Lee and Lee (2018) consider an estimation of the ED under multiply type II hybrid censoring scheme.
There are many situation in life testing experiments in which units are lost or removed from experimentation before failure. Lee et al. (2012) introduced multiply progressive censoring (MPC) scheme. Under the PC scheme, suppose the experimenter fails to observe the middle observations. Now, let
X a
1:m:n ≤ X a
2:m:n ≤ · · · ≤ X a
s−1:m:n ≤ X a
s:m:n , r i−1 = a i − a i−1 − 1, i = 2, 3, · · · , s (1.3) be the available MPC sample. Lee et al. (2012) consider the approximate maximum likeli- hood estimators (MLEs) for ED under MPC scheme. Yun and Lee (2018) proposed a GOF test statistics for the ED under MPC samples.
The maximum product spacings (MPS) method was introduced by Cheng and Amin (1983). Under classical estimation set up, the MPS method is quite effective and several authors advocated the use of this method as an alternative to MLE, and found that this estimation method provides better estimates than MLE. Also, it is observed that maximum product spacings estimators (MPSE) possesses almost all properties being possessed by MLE.
The main aim of this paper is to propose the estimators of the parameter and reliabil- ity function of the ED under MPC scheme. First, we derive the MLE and MPSE for the parameter and reliability function of ED. And we derive the approximate MPSE for the parameter and reliability function of ED using Talyor series expansion. We also compare the proposed estimators in the sense of the root mean squared error (RMSE) and bias under MPC scheme.
The rest of the paper is organized as follows. In Section 2, different estimation proce- dures are discussed and estimators of parameter and reliability function using MLE, MPSE and approximate MPSE is proposed. In Section 3, comparison of proposed estimators is conducted using Monte Carlo simulation. Also, we analyzed two real data sets. Finally, we conclude the paper in Section 4.
2. Estimation
2.1. Maximum likelihood estimation
This section deals with deriving MLE of the unknown parameter of an ED. Suppose that X a
1:m:n , X a
2:m:n , · · · , X a
s:m:n denote the observed values of such a MPC sample. The m, s and IR IR IR = (IR 1 , IR 2 , · · · , IR m ) are pre-fixed integers satisfying P m
i=1 IR i + m = n. Using Lee et al. (2012), Eq (1.1) and Eq (1.2), the likelihood function under MPC scheme is given by
L(σ) ∝
s
Y
i=2
F (x a
i:m:n ) − F (x a
i−1:m:n ) r
i−1s
Y
i=1
f (x a
i:m:n ) [1 − F (x a
i:m:n )] IR
i,
where r i = a i+1 − a i − 1.
By putting z a
i:m:n = x a
i:m:n /σ, the likelihood function can be written as L(σ) ∝ σ −s
s
Y
i=2
G(z a
i:m:n ) − G(z a
i−1:m:n ) r
i−1s
Y
i=1
g(z a
i:m:n ) [1 − G(z a
i:m:n )] IR
i, where g(z a
i:m:n ) = exp(−z a
i:m:n ) and G(z a
i:m:n ) = 1 − exp(−z a
i:m:n ).
Hence, the log-likelihood function becomes log L(σ) ∝ − s log σ +
s
X
i=2
r i−1 log G(z a
i:m:n ) − G(z a
i−1:m:n )
+
s
X
i=1
[log g(z a
i:m:n ) + IR i log {1 − G(z a
i:m:n )}] .
Differentiating the log-likelihood function partially with respect to σ and then equating to zero, we have
∂ log L(σ)
∂σ = − 1 σ
"
s +
s
X
i=2
r i−1
g(z a
i:m:n )z a
i:m:n − g(z a
i−1:m:n )z a
i−1:m:n G(z a
i:m:n ) − G(z a
i−1:m:n )
−
s
X
i=1
(1 + IR i )z a
i:m:n
#
= 0. (2.1)
The MLE of σ is the solution of Eq (2.1). However, solutions for σ is not available.
Therefore, we propose to use the Newton-Raphson algorithm to solve it. See for example the work of Gwag and Lee (2018), Lee (2019a) and Lee (2019b). Using the MPSE of σ, say ˆ
σ M , the MLE of reliability function is obtained as
< ˆ M (t) = exp(−t/ˆ σ M ).
2.2. Maximum product spacings estimation
This section deals with deriving MPSE of the unknown parameter of an ED. Using Ng et al. (2012), Lee (2019) and Eq (1.2), the product spacings under MPC scheme is given by
L(σ) ∝ F (x a
1:m:n )
s
Y
i=2
F (x a
i:m:n ) − F (x a
i−1:m:n ) 1+r
i−1s
Y
i=1
[1 − F (x a
i:m:n )] IR
i. By putting z a
i:m:n = x a
i:m:n /σ, the likelihood function can be written as
L(σ) ∝ G(z a
1:m:n )
s
Y
i=2
[G(z a
i:m:n ) − G(z a
i−1:m:n )] 1+r
i−1s
Y
i=1
[1 − G(z a
i:m:n )] IR
i. Hence, the log-likelihood function becomes
log L(σ) ∝ log G(z a
1:m:n ) +
s
X
i=2
(1 + r i−1 ) log G(z a
i:m:n ) − G(z a
i−1:m:n )
+
s
X
i=1
IR i log [1 − G(z a
i:m:n )] ,
where g(z a
i:m:n ) = exp(−z a
i:m:n ) and G(z a
i:m:n ) = 1 − exp(−z a
i:m:n ).
Differentiating the log-likelihood function partially with respect to σ and then equating to zero, we have
∂ log L(σ)
∂σ = − 1 σ
"
g(z a
1:m:n )
G(z a
1:m:n ) z a
1:m:n +
s
X
i=2
(1 + r i−1 ) g(z a
i:m:n )z a
i:m:n − g(z a
i−1:m:n )z a
i−1:m:n
G(z a
i:m:n ) − G(z a
i−1:m:n )
−
s
X
i=1
IR i z a
i:m:n
#
= 0. (2.2)
The MPSE of σ is the solution of Eq (2.2). However, solutions for σ is not available.
Therefore, we propose to use the Newton-Raphson algorithm to solve it. See for example the work of Lee and Lee (2018), Lee (2019a) and Lee (2019b). Using the MPSE of σ, say ˆ
σ A , the MPSE of reliability function is obtained as
< ˆ A (t) = exp(−t/ˆ σ A ).
2.3. Approximate maximum product spacings estimation
In this Section, we use the approximate MPSE as an approximate estimator of σ. Let ψ a
i:m:n = F −1 (p a
i:m:n ) = − log (1 − p a
i:m:n ) ,
where
p i:m:n = E(U i:m:n ) = 1 −
m
Y
j=m−i+1
j + IR m−i+1 + · · · + IR m 1 + j + IR m−i+1 + · · · + IR m
.
First, we can approximate the functions by Taylor series expansion as follows g(z a
1:m:n )
G(z a
1:m:n ) z a
1:m:n ' ν 1 + κ 1 z a
1:m:n (2.3) and
g(z a
i:m:n )z a
i:m:n − g(z a
i−1:m:n )z a
i−1:m:n
G(z a
i:m:n ) − G(z a
i−1:m:n ) ' α i + β i z a
i:m:n + γ i z a
i−1:m:n , (2.4)
where
ν 1 = q a
1:m:n
p a
1:m:n
ψ a 2
1:m:n +
1 + q a
1:m:n
p a
1:m:n
, κ 1 = q a
1:m:n
p a
1:m:n
1 − ψ a
1:m:n − q a
1:m:n
p a
1:m:n
ψ a
1:m:n
,
α i = q a
i:m:n ψ a 2
i
:m:n − q a
i−1:m:n ψ 2 a
i−1
:m:n
p a
i:m:n − p a
i−1:m:n
+ q a
i:m:n ψ a
i:m:n − q a
i−1:m:n ψ a
i−1:m:n
p a
i:m:n − p a
i−1:m:n
2
, β i = q a
i:m:n
p a
i:m:n − p a
i−1:m:n
1 − ψ a
i:m:n − q a
i:m:n ψ a
i:m:n − q a
i−1:m:n ψ a
i−1:m:n
p a
i:m:n − p a
i−1:m:n
,
γ i = − q a
i−1:m:n
p a
i:m:n − p a
i−1:m:n
1 − ψ a
i−1:m:n − q a
i:m:n ψ a
i:m:n − q a
i−1:m:n ψ a
i−1:m:n
p a
i:m:n − p a
i−1:m:n
. By substituting the Eqs (2.3) and (2.4) into the Eq (2.2), we can approximate the Eq (2.2) for σ as follows
∂ log L(σ)
∂σ = − 1 σ
"
(ν 1 + κ 1 z a
1:m:n ) +
s
X
i=2
(1 + r i−1 )(α i + β i z a
i:m:n + γ i z a
i−1:m:n )
−
s
X
i=1
IR i z a
i:m:n
#
. (2.5)
Upon solving the Eq (2.5) for σ, we can obtain an approximate MPSE of σ as follows
ˆ σ A1 =
P s
i=1 IR i x a
i:m:n − P s
i=2 (1 + r i−1 )(β i x a
i:m:n + γ i x a
i−1:m:n ) − κ 1 x a
1:m:n ν 1 + P s
i=2 (1 + r i−1 )α i
. (2.6) Next, we can approximate the Eq (2.2) by the Eq (2.4) and
g(z a
1:m:n )
G(z a
1:m:n ) ' ν 2 + κ 2 z a
1:m:n , (2.7) where
ν 2 = q a
1:m:n p a
1:m:n
+
1 + ψ a
1:m:n + q a
1:m:n p a
1:m:n
ψ a
1:m:n
and κ 2 = − q a
1:m:n p 2 a
1:m:n .
By substituting the Eq (2.4) and Eq (2.7) into the Eq (2.2), we can approximate the Eq (2.2) for σ as follows
∂ log L(σ)
∂σ = − 1 σ
"
(ν 2 + κ 2 z a
1:m:n )z a
1:m:n +
s
X
i=2
(1 + r i−1 )(α i + β i z a
i:m:n + γ i z a
i−1:m:n )
−
s
X
i=1
IR i z a
i:m:n
#
. (2.8)
Upon solving the Eq (2.8) for σ, we can obtain an approximate MPSE of σ as follows
ˆ
σ A2 = −B + √
B 2 − 4AC
2A , (2.9)
where
A =
s
X
i=2
(1 + r i−1 )α i ,
B =ν 2 x a
1:m:n −
s
X
i=1
IR i x a
i:m:n +
s
X
i=2
(1 + r i−1 )(β i x a
i:m:n + γ i x a
i−1:m:n ), C =κ 2 x 2 a
1