Bayesian estimation of reliability using time-to-failure distribution of parametric degradation models

This paper focusses on computing the Bayesian reliability of components whose performance characteristics (degradation – fatigue and cracks) are observed during a specified period of time. Depending upon the nature of degradation data collected, we fit a monotone increasing or decreasing function for the data. Since the components are supposed to have different lifetimes, the rate of degradation is assumed to be a random variable. At a critical level of degradation, the time to failure distribution is obtained. The exponential and power degradation models are studied and exponential density function is assumed for the random variable representing the rate of degradation. The maximum likelihood estimator and Bayesian estimator of the parameter of exponential density function, predictive distribution, hierarchical Bayes approach and robustness of the posterior mean are presented. The Gibbs sampling algorithm is used to obtain the Bayesian estimates of the parameter. Illustrations are provided for the train wheel degradation data.     

Hypothesis Tests for Neyman's Bias in Case–Control Studies

Survival bias is a long recognized problem in case–control studies, and many varieties of bias can come under this umbrella term. We focus on one of them, termed Neyman's bias or ‘prevalence–incidence bias’. It occurs in case–control studies when exposure affects both disease and disease-induced mortality, and we give a formula for the observed, biased odds ratio under such conditions. We compare our result with previous investigations into this phenomenon and consider models under which this bias may or may not be important. Finally, we propose three hypothesis tests to identify when Neyman's bias may be present in case–control studies. We apply these tests to three data sets, one of stroke mortality, another of brain tumors, and the last of atrial fibrillation, and find some evidence of Neyman's bias in the former two cases, but not the last case.     

A new algorithm for clustering based on kernel density estimation

In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.     

A robust automatic clustering algorithm for probability density functions with application to categorizing color images

This study develops a robust automatic algorithm for clustering probability density functions based on the previous research. Unlike other existing methods that often pre-determine the number of clusters, this method can self-organize data groups based on the original data structure. The proposed clustering method is also robust in regards to noise. Three examples of synthetic data and a real-world COREL dataset are utilized to illustrate the accurateness and effectiveness of the proposed approach.     

On An Intriguing Distributional Identity

For a continuous random variable X with support equal to (a, b), with c.d.f. F, and g: Ω₁ → Ω₂ a continuous, strictly increasing function, such that Ω₁∩Ω₂?(a, b), but otherwise arbitrary, we establish that the random variables F(X) ? F(g(X)) and F(g^{? 1}(X)) ? F(X) have the same distribution. Further developments, accompanied by illustrations and observations, address as well the equidistribution identity U ? ψ(U) = ^dψ^{? 1}(U) ? U for U ～ U(0, 1), where ψ is a continuous, strictly increasing and onto function, but otherwise arbitrary. Finally, we expand on applications with connections to variance reduction techniques, the discrepancy between distributions, and a risk identity in predictive density estimation.     

Evaluating the causal economic impacts of transport investments: evidence from the Madrid–Barcelona high speed rail corridor

This paper evaluates economic impacts arising from the introduction of high-speed rail (HSR) between Madrid and Barcelona. Using difference-in-differences estimation we estimate an average treatment effect for provinces with stops on the HSR line of 2.4% for economic output, 3.3% for numbers of firms, and 1.1% for labour productivity. We complement our DID results with a synthetic control analysis for Lleida and Tarragona, two provinces that we argue were assigned HSR stations largely due to their incidental location. We find that both the number of firms and labour productivity are substantially higher in these provinces than in their synthetic counterparts.     

Probabilistic linear solvers: a unifying view

Statistics and Computing - Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian...