Analysis of Competing Risks by Using Bayesian Smoothing

We consider the competing risks set-up. In many practical situations, the conditional probability of the cause of failure given the failure time is of direct interest. We propose to model the competing risks by the overall hazard rate and the conditional probabilities rather than the cause-specific hazards. We adopt a Bayesian smoothing approach for both quantities of interest. Illustrations are given at the end.     

Penalized Pseudolikelihood Inference in Spatial Interaction Models with Covariates

Given spatially located observed random variables ( x , z = {( x _i , z _i )} _i , we propose a new method for non-parametric estimation of the potential functions of a Markov random field p ( x | z ), based on a roughness penalty approach. The new estimator maximizes the penalized log-pseudolikelihood function and is a natural cubic spline. The calculations involved do not rely on Monte Carlo simulation. We suggest the use of B-splines to stabilize the numerical procedure. An application in Bayesian image reconstruction is described.     

Bayesian prediction of waiting times in stochastic models

The authors show how saddlepoint techniques lead to highly accurate approximations for Bayesian predictive densities and cumulative distribution functions in stochastic model settings where the prior is tractable, but not necessarily the likelihood or the predictand distribution. They consider more specifically models involving predictions associated with waiting times for semi‐Markov processes whose distributions are indexed by an unknown parameter θ. Bayesian prediction for such processes when they are not stationary is also addressed and the inverse‐Gaussian based saddlepoint approximation of Wood, Booth & Butler (1993) is shown to accurately deal with the nonstationarity whereas the normal‐based Lugannani & Rice (1980) approximation cannot, Their methods are illustrated by predicting various waiting times associated with M/M/q and M/G/1 queues. They also discuss modifications to the matrix renewal theory needed for computing the moment generating functions that are used in the saddlepoint methods.     

Estimation for Birnbaum–Saunders Distribution in Simple Step Stress–accelerated Life Test with Type-II Censoring

This paper develops the Bayesian estimation for the Birnbaum–Saunders distribution based on Type-II censoring in the simple step stress–accelerated life test with power law accelerated form. Maximum likelihood estimates are obtained and Gibbs sampling procedure is used to get the Bayesian estimates for shape parameter of Birnbaum–Saunders distribution and parameters of power law–accelerated model. Asymptotic normality method and Markov Chain Monte Carlo method are employed to construct the corresponding confidence interval and highest posterior density interval at different confidence level, respectively. At last, the results are compared by using Monte Carlo simulations, and a numerical example is analyzed for illustration.     

The k-factor GARMA Process with Infinite Variance Innovations

In this article, we develop the theory of k-factor Gegenbauer Autoregressive Moving Average (GARMA) process with infinite variance innovations which is a generalization of the stable seasonal fractional Autoregressive Integrated Moving Average (ARIMA) model introduced by Diongue et al. (2008 Diongue, A.K., Guégan, D. (2008). Estimation of k-Factor GIGARCH Process: A Monte Carlo Study. Communications in Statistics-Simulation and Computation 37:2037–2049.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]). Stationarity and invertibility conditions of this new model are derived. Conditional Sum of Squares (CSS) and Markov Chains Monte Carlo (MCMC) Whittle methods are investigated for parameter estimation. Monte Carlo simulations are also used to evaluate the finite sample performance of these estimation techniques. Finally, the usefulness of the model is corroborated with the application to streamflow data for Senegal River at Bakel.     

Predictive Inference for Big,Spatial, Non‐Gaussian Data: MODIS Cloud Data and its Change‐of‐Support

Remote sensing of the earth with satellites yields datasets that can be massive in size, nonstationary in space, and non‐Gaussian in distribution. To overcome computational challenges, we use the reduced‐rank spatial random effects (SRE) model in a statistical analysis of cloud‐mask data from NASA's Moderate Resolution Imaging Spectroradiometer (MODIS) instrument on board NASA's Terra satellite. Parameterisations of cloud processes are the biggest source of uncertainty and sensitivity in different climate models’ future projections of Earth's climate. An accurate quantification of the spatial distribution of clouds, as well as a rigorously estimated pixel‐scale clear‐sky‐probability process, is needed to establish reliable estimates of cloud‐distributional changes and trends caused by climate change. Here we give a hierarchical spatial‐statistical modelling approach for a very large spatial dataset of 2.75 million pixels, corresponding to a granule of MODIS cloud‐mask data, and we use spatial change‐of‐Support relationships to estimate cloud fraction at coarser resolutions. Our model is non‐Gaussian; it postulates a hidden process for the clear‐sky probability that makes use of the SRE model, EM‐estimation, and optimal (empirical Bayes) spatial prediction of the clear‐sky‐probability process. Measures of prediction uncertainty are also given.     

Integrating Neural Networks and Semi-Markov Processes for Automated Knowledge Acquisition: An Application to Real-time Scheduling*

Recently, artificial neural networks (ANN) have gained attention as a promising modeling tool for building intelligent systems. A number of applications have been reported in areas varying from pattern recognition to bankruptcy prediction. In this paper, we present a creative methodology that integrates computer simulation, semi-Markov optimization, and ANN techniques for automated knowledge acquisition in real-time scheduling. The integrated approach focuses on the synergy between operations research and ANN in eliciting human knowledge, filtering inconsistent data, and building competent models capable of performing at the expert level. The new approach includes three main components. First, computer simulation is used to collect expert decisions. This step allows expert knowledge to be obtained in a non-intrusive way and minimizes the difficulties involved in interviewing experts, constructing repertory grids, or using other similar structures required for manual knowledge acquisition. The data collected from computer simulation are then optimized using a semi-Markov decision model to remove data redundancies, inconsistencies, and errors. Finally, the optimized data are used to build ANN-based expert systems. The integrated approach is evaluated by comparing it with the human expert and using ANN alone in the domain of real-time scheduling. The results indicate that ANN-based systems perform worse than human experts from whom the data were collected, but the integrated approach outperforms human experts and ANN models alone.