Optimal Information Processing and Bayes's Theorem

In this article statistical inference is viewed as information processing involving input information and output information. After introducing information measures for the input and output information, an information criterion functional is formulated and optimized to obtain an optimal information processing rule (IPR). For the particular information measures and criterion functional adopted, it is shown that Bayes's theorem is the optimal IPR. This optimal IPR is shown to be 100% efficient in the sense that its use leads to the output information being exactly equal to the given input information. Also, the analysis links Bayes's theorem to maximum-entropy considerations.     

A Practical Implementation and Bayesian Estimation in Franklin's Randomized Response Procedure

A Bayesian estimator based on Franklin's randomized response procedure is proposed for proportion estimation in surveys dealing with a sensitive character. The method is simple to implement and avoids the usual drawbacks of Franklin's estimator, i.e., the occurrence of negative estimates when the population proportion is small. A simulation study is considered in order to assess the performance of the proposed estimator as well as the corresponding credible interval.     

A note on Bayesian estimation of traffic intensity in single-server Markovian queues

ABSTRACT

In queuing theory, a major interest of researchers is studying the behavior and formation process and analyzing the performance characteristics of queues, particularly the traffic intensity, which is defined as the ratio between the arrival rate and the service rate. How these parameters can be estimated using some statistical inferential method is the mathematical problem treated here. This article aims to obtain better Bayesian estimates for the traffic intensity of M/M/1 queues, which, in Kendall notation, stand for Markovian single-server infinity queues. The Jeffreys prior is proposed to obtain the posterior and predictive distributions of some parameters of interest. Samples are obtained through simulation and some performance characteristics are analyzed. It is observed from the Bayes factor that Jeffreys prior is competitive, among informative and non-informative prior distributions, and presents the best performance in many of the cases tested.     

Nonparametric product partition models for multiple change-points analysis

ABSTRACT

We propose an extension of parametric product partition models. We name our proposal nonparametric product partition models because we associate a random measure instead of a parametric kernel to each set within a random partition. Our methodology does not impose any specific form on the marginal distribution of the observations, allowing us to detect shifts of behaviour even when dealing with heavy-tailed or skewed distributions. We propose a suitable loss function and find the partition of the data having minimum expected loss. We then apply our nonparametric procedure to multiple change-point analysis and compare it with PPMs and with other methodologies that have recently appeared in the literature. Also, in the context of missing data, we exploit the product partition structure in order to estimate the distribution function of each missing value, allowing us to detect change points using the loss function mentioned above. Finally, we present applications to financial as well as genetic data.     

A new approximation to the distribution function of the studentized maximum root

The Studentized maximum root (SMR) distribution is useful for constructing simultaneous confidence intervals around product interaction contrasts in replicated two-way ANOVA. A three-moment approximation to the SMR distribution is proposed. The approximation requires the first three moments of the maximum root of a central Wishart matrix. These values are obtained by means of numerical integration. The accuracy of the approximation is compared to the accuracy of a two-moment approximation for selected two-way table sizes. Both approximations are reasonably accurate. The three-moment approximation is generally superior.     

A test for the equality of k medians against the simple tree alternative under right censorship

We consider a test for the equality of k population medians, θ_i i=1,2,….,k, when it is believed a priori, that θ _i: The observations are subject to right censorhip. The distributions of the censoring variables for each population are assumed to be equal. This test is compared with the general k-sample test proposed by Breslow     

Some aspects of statistical inference on the lagrange (generalized) poisson distribution

A generalization of the Poisson distribution was defined by Consul and Jain (Ann. Math. Statist., 41, (1970)) and was obtained as a particular family of Lagrange distributions by Consul and Shenton (SIAM. J. Appl. Math., 23, (1972)). The distribution is subsequently named the generalized Poisson distribution (GPD). This GPD reduces to the Poisson distribution for ? = 0. When the data have a one-way layout structure, the asymptotically locally optimal Neyman's C(d) test is constructed and compared with the conditional test on the hypothesis H_o? = 0. Within the framework of the generalized linear models an appropriate link function is given, and the asymptotic distributions of the estimated parameters are derived.     

Notes on likelihood intervals and profiling

In many applications, decisions are made on the basis of function of parameters g(θ). When the value of g(theta;) is calculated using estimated values for te parameters, its is important to have a measure of the uncertainty associated with that value of g(theta;). Likelihood ratio approaches to finding likelihood intervals for functions of parameters have been shown to be more reliable, in terms of coverage probability, than the linearization approach. Two approaches to the generalization of the profiling algorithm have been proposed in the literature to enable construction of likelihood intervals for a function of parameters (Chen and Jennrich, 1996; Bates and Watts, 1988). In this paper we show the equivalence of these two methods. We also provide and analysis of cases in which neither profiling algorithm is appropriate. For one of these cases an alternate approach is suggested Whereas generalized profiling is based on maximizing the likelihood function given a constraint on the value of g(θ), the alternative algorithm is based on optimizing g(θ) given a constraint on the value of the likelihood function.