Pseudo MLE for semiparametric transformation model with doubly truncated data

In this article, we consider the efficient estimation of the semiparametric transformation model with doubly truncated data. We propose a two-step approach for obtaining the pseudo maximum likelihood estimators (PMLE) of regression parameters. In the first step, the truncation time distribution is estimated by the nonparametric maximum likelihood estimator (Shen, 2010a) when the distribution function $K$ of the truncation time is unspecified or by the conditional maximum likelihood estimator (Bilker and Wang, 1996) when $K$ is parameterized. In the second step, using the pseudo complete-data likelihood function with the estimated distribution of truncation time, we propose expectation–maximization algorithms for obtaining the PMLE. We establish the consistency of the PMLE. The simulation study indicates that the PMLE performs well in finite samples. The proposed method is illustrated using an AIDS data set.     

On inference from Markov chain macro-data using transforms

We consider data that are longitudinal, arising from n individuals over m time periods. Each individual moves according to the same homogeneous Markov chain, with s states. If the individual sample paths are observed, so that ‘micro-data’ are available, the transition probability matrix is estimated by maximum likelihood straightforwardly from the transition counts. If only the overall numbers in the various states at each time point are observed, we have ‘macro-data’, and the likelihood function is difficult to compute. In that case a variety of methods has been proposed in the literature. In this paper we propose methods based on generating functions and investigate their performance.     

Parameter estimation of the flexible Weibull distribution for type I censored samples

Often in practice one is interested in the situation where the lifetime data are censored. Censorship is a common phenomenon frequently encountered when analyzing lifetime data due to time constraints. In this paper, the flexible Weibull distribution proposed in Bebbington et al. [A flexible Weibull extension, Reliab. Eng. Syst. Safety 92 (2007), pp. 719–726] is studied using maximum likelihood technics based on three different algorithms: Newton Raphson, Levenberg Marquardt and Trust Region reflective. The proposed parameter estimation method is introduced and proved to work from theoretical and practical point of view. On one hand, we apply a maximum likelihood estimation method using complete simulated and real data. On the other hand, we study for the first time the model using simulated and real data for type I censored samples. The estimation results are approved by a statistical test.     

Assessing the bias of maximum likelihood estimates of contaminated garch models

It is well known that Gaussian maximum likelihood estimates of time series models are not robust. In this paper we prove this is also the case for the Generalized Autoregressive Conditional Heteroscedastic (GARCH) models. By expressing the Gaussian maximum likelihood estimates as Ψ estimates and by assuming the existence of a contaminated process, we prove they possess zero breakdown point and unbounded influence curves. By simulating GARCH processes under several proportions of contaminations we assess how much biased the maximum likelihood estimates may become and compare these results to a robust alternative. The t-student maximum likelihood estimates of GARCH models are also considered.     

Inference in mixed proportional hazard models with <Emphasis Type="Italic">K</Emphasis> random effects

A general formulation of mixed proportional hazard models with K random effects is provided. It enables to account for a population stratified at K different levels. I then show how to approximate the partial maximum likelihood estimator using an EM algorithm. In a Monte Carlo study, the behavior of the estimator is assessed and I provide an application to the ratification of ILO conventions. Compared to other procedures, the results indicate an important decrease in computing time, as well as improved convergence and stability.     

The analysis of ordinal time-series data via a transition (Markov) model

While standard techniques are available for the analysis of time-series (longitudinal) data, and for ordinal (rating) data, not much is available for the combination of the two, at least in a readily-usable form. However, this data type is common place in the natural and health sciences where repeated ratings are recorded on the same subject. To analyse these data, this paper considers a transition (Markov) model where the rating of a subject at one time depends explicitly on the observed rating at the previous point of time by incorporating the previous rating as a predictor variable. Complications arise with adequate handling of data at the first observation (t=1), as there is no prior observation to use as a predictor. To overcome this, it is postulated the existence of a rating at time t=0; however it is treated as ‘missing data’ and the expectation–maximisation algorithm used to accommodate this. The particular benefits of this method are shown for shorter time series.     

Estimation of regression equation with cauchy disturbances

In this paper we present two methods of estimating a linear regression equation with Cauchy disturbances. The first method uses the maximum likelihood principle and therefore the estimators obtained are consistent. The asymptotic covariance is derived which provides with the necessary statistics for the purpose of making inference in large samples. The second method is the method of least lines which minimizes the sum of absolute errors (MSAE) from the fitted regression. Then these two methods are compared through a Monte Carlo study. The maximum likelihood method emerges superior over the MSAE method. However, the MSAE procedure which does not depend on the distribution of the error term appears to be a close competitor to the maximum likelihood estimator.     

On the trimmed mean and minimax-variance L-estimation in Kolmogorov neighbourhoods

We consider the properties of the trimmed mean, as regards minimax-variance L-estimation of a location parameter in a Kolmogorov neighbourhood K() of the normal distribution: We first review some results on the search for an L-minimax estimator in this neighbourhood, i.e. a linear combination of order statistics whose maximum variance in K_t() is a minimum in the class of L-estimators. The natural candidate – the L-estimate which is efficient for that member of K_t,() with minimum Fisher information – is known not to be a saddlepoint solution to the minimax problem. We show here that it is not a solution at all. We do this by showing that a smaller maximum variance is attained by an appropriately trimmed mean. We argue that this trimmed mean, as well as being computationally simple – much simpler than the efficient L-estimate referred to above, and simpler than the minimax M- and R-estimators – is at least “nearly” minimax.     

Penalized Maximum Likelihood Estimator for Normal Mixtures

The estimation of the parameters of a mixture of Gaussian densities is considered, within the framework of maximum likelihood. Due to unboundedness of the likelihood function, the maximum likelihood estimator fails to exist. We adopt a solution to likelihood function degeneracy which consists in penalizing the likelihood function. The resulting penalized likelihood function is then bounded over the parameter space and the existence of the penalized maximum likelihood estimator is granted. As original contribution we provide asymptotic properties, and in particular a consistency proof, for the penalized maximum likelihood estimator. Numerical examples are provided in the finite data case, showing the performances of the penalized estimator compared to the standard one.     

A Simple Solution to Bayesian Mixture Labeling

The label-switching problem is one of the fundamental problems in Bayesian mixture analysis. Using all the Markov chain Monte Carlo samples as the initials for the expectation-maximization (EM) algorithm, we propose to label the samples based on the modes they converge to. Our method is based on the assumption that the samples converged to the same mode have the same labels. If a relative noninformative prior is used or the sample size is large, the posterior will be close to the likelihood and then the posterior modes can be located approximately by the EM algorithm for mixture likelihood, without assuming the availability of the closed form of the posterior. In order to speed up the computation of this labeling method, we also propose to first cluster the samples by K-means with a large number of clusters K. Then, by assuming that the samples within each cluster have the same labels, we only need to find one converged mode for each cluster. Using a Monte Carlo simulation study and a real dataset, we demonstrate the success of our new method in dealing with the label-switching problem.     

Parameter Estimation for Bivariate Shock Models with Singular Distribution for Censored Data with Concomitant Order Statistics

When two‐component parallel systems are tested, the data consist of Type‐II censored data X_(i), i= 1, n, from one component, and their concomitants Y _[i] randomly censored at X_(r), the stopping time of the experiment. Marshall & Olkin's (1967) bivariate exponential distribution is used to illustrate statistical inference procedures developed for this data type. Although this data type is motivated practically, the likelihood is complicated, and maximum likelihood estimation is difficult, especially in the case where the parameter space is a non‐open set. An iterative algorithm is proposed for finding maximum likelihood estimates. This article derives several properties of the maximum likelihood estimator (MLE) including existence, uniqueness, strong consistency and asymptotic distribution. It also develops an alternative estimation method with closed‐form expressions based on marginal distributions, and derives its asymptotic properties. Compared with variances of the MLEs in the finite and large sample situations, the alternative estimator performs very well, especially when the correlation between X and Y is small.     

Estimating Spatial Autocorrelation With Sampled Network Data

Spatial autocorrelation is a parameter of importance for network data analysis. To estimate spatial autocorrelation, maximum likelihood has been popularly used. However, its rigorous implementation requires the whole network to be observed. This is practically infeasible if network size is huge (e.g., Facebook, Twitter, Weibo, WeChat, etc.). In that case, one has to rely on sampled network data to infer about spatial autocorrelation. By doing so, network relationships (i.e., edges) involving unsampled nodes are overlooked. This leads to distorted network structure and underestimated spatial autocorrelation. To solve the problem, we propose here a novel solution. By temporarily assuming that the spatial autocorrelation is small, we are able to approximate the likelihood function by its first-order Taylor’s expansion. This leads to the method of approximate maximum likelihood estimator (AMLE), which further inspires the development of paired maximum likelihood estimator (PMLE). Compared with AMLE, PMLE is computationally superior and thus is particularly useful for large-scale network data analysis. Under appropriate regularity conditions (without assuming a small spatial autocorrelation), we show theoretically that PMLE is consistent and asymptotically normal. Numerical studies based on both simulated and real datasets are presented for illustration purpose.     

Efficient Likelihood Estimators

If X ₁, …, X _n are identically and independently distributed, then as n ? ∞, there exists under suitable regularity conditions a sequence of solutions of the likelihood equation that is consistent and asymptotically efficient. However, this consistent solution is not necessarily the maximum likelihood estimate. Likelihood estimation should therefore emphasize the determination of a consistent sequence of solutions of the likelihood equations rather than maximizing the likelihood. The issues are illustrated on some examples.     

Dependent Right Censorship in the MOMW Distribution

In this paper, we consider paired survival data, in which pair members are subject to the same right censoring time, but they are dependent on each other. Assuming the Marshall–Olkin Multivariate Weibull distribution for the joint distribution of the lifetimes (X₁, X₂) and the censoring time X₃, we derive the joint density of the actual observed data and obtain maximum likelihood estimators, Bayes estimators and posterior regret Gamma minimax estimators of the unknown parameters under squared error loss and weighted squared error loss functions. We compare the performances of the maximum likelihood estimators and Bayes estimators numerically in terms of biases and estimated Mean Squared Error Loss.     

Mean likelihood estimators

The use of Mathematica in deriving mean likelihood estimators is discussed. Comparisons are made between the mean likelihood estimator, the maximum likelihood estimator, and the Bayes estimator based on a Jeffrey's noninformative prior. These estimators are compared using the mean-square error criterion and Pitman measure of closeness. In some cases it is possible, using Mathematica, to derive exact results for these criteria. Using Mathematica, simulation comparisons among the criteria can be made for any model for which we can readily obtain estimators.In the binomial and exponential distribution cases, these criteria are evaluated exactly. In the first-order moving-average model, analytical comparisons are possible only for n = 2. In general, we find that for the binomial distribution and the first-order moving-average time series model the mean likelihood estimator outperforms the maximum likelihood estimator and the Bayes estimator with a Jeffrey's noninformative prior. Mathematica was used for symbolic and numeric computations as well as for the graphical display of results. A Mathematica notebook which provides the Mathematica code used in this article is available: http://www.stats.uwo.ca/mcleod/epubs/mele. Our article concludes with our opinions and criticisms of the relative merits of some of the popular computing environments for statistics researchers.     

Online change detection of Markov chains with unknown post-change transition probabilities

ABSTRACT

In this paper, we investigate the performance of cumulative sum (CUSUM) stopping rules for the online detection of unknown change point in a time homogeneous Markov chain. Under the condition that the post-change transition probabilities are unknown, we proposed two CUSUM type schemes for the detection. The first scheme is based on the maximum likelihood estimates of the post-change transition probabilities. This scheme is limited by its computation burden, which is mitigated by another scheme based on the reference transition probabilities selected from a prior known region. We give the bounds of the mean delay time and the mean time between false alarms to illustrate the effectiveness of the proposed schemes. The results of the simulation also demonstrate the feasibility of the proposed schemes.     

Applying skovgaard's modified directed likelihood statistic to mixed linear models

The introduction of software to calculate maximum likelihood estimates for mixed linear models has made likelihood estimation a practical alternative to methods based on sums of squares. Likelihood based tests and confidence intervals, however, may be misleading in problems with small sample sizes. This paper discusses an adjusted version of the directed log-likelihood statistic for mixed models that is highly accurate for testing one parameter hypotheses. Indroduced by Skovgaard (1996, Journal of the Bernoulli Society,2,145-165), we show in mixed models that the statistic has a simple conpact from that may be obtained from standard software. Simulation studies indicate that this statistic is more accurate than many of the specialized procedure that have been advocated.     

Preventive replacement policies with products update announcements

Abstract

When we consider the improvement of the functional performances that are released by the new updates of the products, it is an interesting problem to revisit the existing replacement policies. For such a viewpoint, four replacement models with product update announcements, i.e., PUA for abbreviation, are given in this paper: Model 1, the unit is replaced at time T or at PUA over time T. Model 2, the unit is replaced at the Kth failure or at PUA over the Kth failure. By considering both time T and failure K, Models 3 and 4 are obtained based on the approaches of replacement first and last. We obtain the expected cost rates for four models and discuss analytically their optimal replacement policies Further, numerical examples are given when the time for PUA has an exponential distribution.     

Computation of the asymptotic null distribution of goodness-of-fit tests for multi-state models

We develop an improved approximation to the asymptotic null distribution of the goodness-of-fit tests for panel observed multi-state Markov models (Aguirre-Hernandez and Farewell, Stat Med 21:1899–1911, 2002) and hidden Markov models (Titman and Sharples, Stat Med 27:2177–2195, 2008). By considering the joint distribution of the grouped observed transition counts and the maximum likelihood estimate of the parameter vector it is shown that the distribution can be expressed as a weighted sum of independent c²₁{\chi^2_1} random variables, where the weights are dependent on the true parameters. The performance of this approximation for finite sample sizes and where the weights are calculated using the maximum likelihood estimates of the parameters is considered through simulation. In the scenarios considered, the approximation performs well and is a substantial improvement over the simple χ ² approximation.     

Comparison of estimation methods for the Weibull distribution

Weibull distributions have received wide ranging applications in many areas including reliability, hydrology and communication systems. Many estimation methods have been proposed for Weibull distributions. But there has not been a comprehensive comparison of these estimation methods. Most studies have focused on comparing the maximum likelihood estimation (MLE) with one of the other approaches. In this paper, we first propose an L-moment estimator for the Weibull distribution. Then, a comprehensive comparison is made of the following methods: the method of maximum likelihood estimation (MLE), the method of logarithmic moments, the percentile method, the method of moments and the method of L-moments.