A Diagnostic for Association in Bivariate Survival Models

We propose exploratory, easily implemented methods for diagnosing the appropriateness of an underlying copula model for bivariate failure time data, allowing censoring in either or both failure times. It is found that the proposed approach effectively distinguishes gamma from positive stable copula models when the sample is moderately large or the association is strong. Data from the Womens Health and Aging Study (WHAS, Guralnik et al., The Womenss Health and Aging Study: Health and Social Characterisitics of Older Women with Disability. National Institute on Aging: Bethesda, Mayland, 1995) are analyzed to demonstrate the proposed diagnostic methodology. The positive stable model gives a better overall fit to these data than the gamma frailty model, but it tends to underestimate association at the later time points. The finding is consistent with recent theory differentiating catastrophic from progressive disability onset in older adults. The proposed methods supply an interpretable quantity for copula diagnosis. We hope that they will usefully inform practitioners as to the reasonableness of their modeling choices.     

Stochastic comparison of processes generated by random interruptions of monotone functions and related results

Many stochastic processes considered in applied probability models, and, in particular, in reliability theory, are processes of the following form: Shocks occur according to some point process, and each shock causes the process to have a random jump. Between shocks the process increases or decreases in some deterministic fashion. In this paper we study processes for which the rate of increase or decrease between shocks depends only on the height of the process. For such processes we find conditions under which the processes can be stochastically compared. We also study hybrid processes in which periods of increase and periods of decrease alternate. A further result yields a stochastic comparison of processes that start with a random jump, rather than processes in which there is at the beginning some random delay time before the first jump.Supported by NSF Grant DMS 9303891.     

The ℓ1 oblique procrustes problem

In this paper, we reconsider the well-known oblique Procrustes problem where the usual least-squares objective function is replaced by a more robust discrepancy measure, based on the ₁ norm or smooth approximations of it.We propose two approaches to the solution of this problem. One approach is based on convex analysis and uses the structure of the problem to permit a solution to the ₁ norm problem. An alternative approach is to smooth the problem by working with smooth approximations to the ₁ norm, and this leads to a solution process based on the solution of ordinary differential equations on manifolds. The general weighted Procrustes problem (both orthogonal and oblique) can also be solved by the latter approach. Numerical examples to illustrate the algorithms which have been developed are reported and analyzed.     

Probabilistic text understanding

We discuss a new framework for text understanding. Three major design decisions characterize this approach. First, we take the problem of text understanding to be a particular case of the general problem of abductive inference. Second, we use probability theory to handle the uncertainty which arises in this abductive inference process. Finally, all aspects of natural language processing are treated in the same framework, allowing us to integrate syntactic, semantic and pragmatic constraints. In order to apply probability theory to this problem, we have developed a probabilistic model of text understanding. To make it practical to use this model, we have devised a way of incrementally constructing and evaluating belief networks. We have written a program,wimp3, to experiment with this framework. To evaluate this program, we have developed a simple single-blind testing method.     

Data depth and correlation

Summary: We describe depth–based graphical displays that show the interdependence of multivariate distributions. The plots involve one–dimensional curves or bivariate scatterplots, so they are easier to interpret than correlation matrices. The correlation curve, modelled on the scale curve of Liu et al. (1999), compares the volume of the observed central regions with the volume under independence. The correlation DD–plot is the scatterplot of depth values under a reference distribution against depth values under independence. The area of the plot gives a measure of distance from independence. Correlation curve and DD-plot require an independence model as a baseline: Besides classical parametric specifications, a nonparametric estimator, derived from the randomization principle, is used. Combining data depth and the notion of quadrant dependence, quadrant correlation trajectories are obtained which allow simultaneous representation of subsets of variables. The properties of the plots for the multivariate normal distribution are investigated. Some real data examples are illustrated. *This work was completed with the support of Ca Foscari University.     

Weibull Regression for Lifetimes Measured with Error

Models are considered in which true lifetimes are generated by a Weibull regression model and measured lifetimes are determined from the true times by certain measurement error models. Adjusted estimators are obtained under one parametric specification. The bias properties of these estimators and standard estimators are compared both theoretically, using small measurement error asymptotics, and by simulation. The standard estimators of regression coefficients, other than the intercept, are bias-robust. The adjusted estimator of the shape parameter removes the bias of the standard estimator.     

Principal curves revisited

A principal curve (Hastie and Stuetzle, 1989) is a smooth curve passing through the middle of a distribution or data cloud, and is a generalization of linear principal components. We give an alternative definition of a principal curve, based on a mixture model. Estimation is carried out through an EM algorithm. Some comparisons are made to the Hastie-Stuetzle definition.     

Non-standard methods in evolutionary computation

The paper presents non-standard methods in evolutionary computation and discusses their applicability to various optimization problems. These methods maintain populations of individuals with nonlinear chromosomal structure and use genetic operators enhanced by the problem specific knowledge.     

Applications of a general propagation algorithm for probabilistic expert systems

A probabilistic expert system provides a graphical representation of a joint probability distribution which can be used to simplify and localize calculations. Jensenet al. (1990) introduced a flow-propagation algorithm for calculating marginal and conditional distributions in such a system. This paper analyses that algorithm in detail, and shows how it can be modified to perform other tasks, including maximization of the joint density and simultaneous fast retraction of evidence entered on several variables.     

Conditional residual lifetimes of coherent systems under double monitoring

In this paper, we obtain a mixture representation for the reliability function of the conditional residual lifetime of a coherent system with n independent and identically distributed (i.i.d.) components under double monitoring. We suppose that at time t₁, j components have failed while at time t₂ the system is still alive. Based on these mixture representation, we then study stochastic comparisons of the conditional residual lifetimes of two coherent systems with independent and identical components.     

Stochastic comparisons of two-unit repairable systems

Abstract

We consider two models of two-unit repairable systems: cold standby system and warm standby system. We suppose that the lifetimes and repair times of the units are all independent exponentially distributed random variables. Using stochastic orders we compare the lifetimes of systems under different assumptions on the parameters of exponential distributions. We also consider a cold standby system where the lifetimes and repair times of its units are not necessarily exponentially distributed.     

Computations of Signatures of Coherent Systems with Five Components

The signatures of coherent systems are useful tools to compute the system reliability functions, the system expected lifetimes and to compare different systems using stochastic orderings. It is well known that there exist 2, 5, and 20 different coherent systems with 2, 3, and 4 components, respectively. The signatures for these systems were given in Shaked and Suarez-Llorens (2003 Shaked , M. , Suarez-Llorens , A. ( 2003 ). On the comparison of reliability experiments based on the convolution order . Journal of the American Statistical Association 98 : 693 – 702 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]). In this article, we obtain an algorithm to compute all the coherent systems with n components and their signatures. Using this algorithm we show that there exist 180 coherent systems with 5 components and we compute their signatures.     

On a system of nonhomogeneous components sharing a common frailty

The components of a reliability system subjected to a common random environment usually have dependent lifetimes. This paper studies the stochastic properties of such a system with lifetimes of the components following multivariate frailty models and multivariate mixed proportional reversed hazard rate (PRHR) models, respectively. Through doing stochastic comparison, we devote to throwing a new light on how the random environment affects the number of working components of a reliability system and on assessing the performance of a k-out-of-n system.     

The German Administrative Record Census – An object identification problem

Summary: The next German census will be an Administrative Record Census. Data from several administrative registers about persons will be merged. Object identification has to be applied, since no unique identification number exists in the registers. We present a two–step procedure. We briefly discuss questions like correctness and completeness of the Administrative Record Census. Then we focus on the object identification problem, that can be perceived as a special classification problem. Pairs of records are to be classified as matched or not matched. To achieve computational efficiency a preselection technique of pairs is applied. Our approach is illustrated with a database containing a large set of consumer addresses.*This work was partially supported by the Berlin–Brandenburg Graduate School in Distributed Information Systems (DFG grant no. GRK 316). The authors thank Michael Fürnrohr for previewing the paper. We would like to thank also for the helpful comments of an anonymous reviewer.     

Computing location depth and regression depth in higher dimensions

The location depth (Tukey 1975) of a point relative to a p-dimensional data set Z of size n is defined as the smallest number of data points in a closed halfspace with boundary through . For bivariate data, it can be computed in O(nlogn) time (Rousseeuw and Ruts 1996). In this paper we construct an exact algorithm to compute the location depth in three dimensions in O(n2logn) time. We also give an approximate algorithm to compute the location depth in p dimensions in O(mp3+mpn) time, where m is the number of p-subsets used.Recently, Rousseeuw and Hubert (1996) defined the depth of a regression fit. The depth of a hyperplane with coefficients (1,...,p) is the smallest number of residuals that need to change sign to make (1,...,p) a nonfit. For bivariate data (p=2) this depth can be computed in O(nlogn) time as well. We construct an algorithm to compute the regression depth of a plane relative to a three-dimensional data set in O(n2logn) time, and another that deals with p=4 in O(n3logn) time. For data sets with large n and/or p we propose an approximate algorithm that computes the depth of a regression fit in O(mp3+mpn+mnlogn) time. For all of these algorithms, actual implementations are made available.     

Comparisons of Test Statistics Arising from Marginal Analyses of Multivariate Survival Data

We investigate the properties of several statistical tests for comparing treatment groups with respect to multivariate survival data, based on the marginal analysis approach introduced by Wei, Lin and Weissfeld [Regression Analysis of multivariate incomplete failure time data by modelling marginal distributians, JASA vol. 84 pp. 1065–1073]. We consider two types of directional tests, based on a constrained maximization and on linear combinations of the unconstrained maximizer of the working likelihood function, and the omnibus test arising from the same working likelihood. The directional tests are members of a larger class of tests, from which an asymptotically optimal test can be found. We compare the asymptotic powers of the tests under general contiguous alternatives for a variety of settings, and also consider the choice of the number of survival times to include in the multivariate outcome. We illustrate the results with simulations and with the results from a clinical trial examining recurring opportunistic infections in persons with HIV.     

An explanation of generalized profile likelihoods

Let X, T, Y be random vectors such that the distribution of Y conditional on covariates partitioned into the vectors X = x and T = t is given by f(y; x, ), where = (, (t)). Here is a parameter vector and (t) is a smooth, real–valued function of t. The joint distribution of X and T is assumed to be independent of and . This semiparametric model is called conditionally parametric because the conditional distribution f(y; x, ) of Y given X = x, T = t is parameterized by a finite dimensional parameter = (, (t)). Severini and Wong (1992. Annals of Statistics 20: 1768–1802) show how to estimate and (·) using generalized profile likelihoods, and they also provide a review of the literature on generalized profile likelihoods. Under specified regularity conditions, they derive an asymptotically efficient estimator of and a uniformly consistent estimator of (·). The purpose of this paper is to provide a short tutorial for this method of estimation under a likelihood–based model, reviewing results from Stein (1956. Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, University of California Press, Berkeley, pp. 187–196), Severini (1987. Ph.D Thesis, The University of Chicago, Department of Statistics, Chicago, Illinois), and Severini and Wong (op. cit.).     

Some representation theorems in terms of mean residual lifetime and mean inactivity time of coherent systems

Abstract

In this paper, we consider a k-out-of-n system consisting of n identical components with independent lifetimes. We show that when the underlying distribution function F(t) is absolutely continuous, then it can be univocally determined by some particular mean residual lives or mean inactivity times of the system. It is then shown that these results may be extended to coherent (or mixed) systems.