Uniform in bandwidth consistency for various kernel estimators involving functional data

The paper investigates various nonparametric models including regression, conditional distribution, conditional density and conditional hazard function, when the covariates are infinite dimensional. The main contribution is to prove uniform in bandwidth asymptotic results for kernel estimators of these functional operators. Then, the application issues, involving data-driven bandwidth selection, are discussed.     

Some novel results on pairwise quasi-asymptotical independence with applications to risk theory

In this article we obtain some novel results on pairwise quasi-asymptotically independent (pQAI) random variables. Concretely speaking, let X₁, …, X_n be n real-valued pQAI random variables, and W₁, …, W_n be another n non negative and arbitrarily dependent random variables, but independent of X₁, …, X_n. Under some mild conditions, we prove that W₁X₁, …, W_nX_n are still pQAI as well. Our result is in a general setting whether the primary random variables X₁, …, X_n are heavy-tailed or not. Finally, a special case of above result is applied to risk theory for investigating the finite-time ruin probability for a discrete-time risk model with a wide type of dependence structure.     

A Mann–Whitney type effect measure of interaction for factorial designs

We propose a measure for interaction for factorial designs that is formulated in terms of a probability similar to the effect size of the Mann–Whitney test. It is shown how asymptotic confidence intervals can be obtained for the effect size and how a statistical test can be constructed. We further show how the test is related to the test proposed by Bhapkar and Gore [Sankhya A, 36:261–272 (1974)]. The results of a simulation study indicate that the test has good power properties and illustrate when the asymptotic approximations are adequate. The effect size is demonstrated on an example dataset.     

Three-group ROC predictive analysis for ordinal outcomes

Measuring the accuracy of diagnostic tests is crucial in many application areas including medicine, machine learning, and credit scoring. The receiver operating characteristic (ROC) surface is a useful tool to assess the ability of a diagnostic test to discriminate among three-ordered classes or groups. In this article, nonparametric predictive inference (NPI) for three-group ROC analysis for ordinal outcomes is presented. NPI is a frequentist statistical method that is explicitly aimed at using few modeling assumptions, enabled through the use of lower and upper probabilities to quantify uncertainty. This article also includes results on the volumes under the ROC surfaces and consideration of the choice of decision thresholds for the diagnosis. Two examples are provided to illustrate our method.     

The performance of model averaged tail area confidence intervals

We investigate the exact coverage and expected length properties of the model averaged tail area (MATA) confidence interval proposed by Turek and Fletcher, CSDA, 2012, in the context of two nested, normal linear regression models. The simpler model is obtained by applying a single linear constraint on the regression parameter vector of the full model. For given length of response vector and nominal coverage of the MATA confidence interval, we consider all possible models of this type and all possible true parameter values, together with a wide class of design matrices and parameters of interest. Our results show that, while not ideal, MATA confidence intervals perform surprisingly well in our regression scenario, provided that we use the minimum weight within the class of weights that we consider on the simpler model.     

Palm Distributions for Log Gaussian Cox Processes

This paper establishes a remarkable result regarding Palm distributions for a log Gaussian Cox process: the reduced Palm distribution for a log Gaussian Cox process is itself a log Gaussian Cox process that only differs from the original log Gaussian Cox process in the intensity function. This new result is used to study functional summaries for log Gaussian Cox processes.     

Estimation of P{X < Y} for geometric—exponential model based on complete and censored samples

This article deals with the estimation of R = P{X < Y}, where X and Y are independent random variables from geometric and exponential distribution, respectively. For complete samples, the MLE of R, its asymptotic distribution, and confidence interval based on it are obtained. The procedure for deriving bootstrap-p confidence interval is presented. The UMVUE of R and UMVUE of its variance are derived. The Bayes estimator of R is investigated and its Lindley's approximation is obtained. A simulation study is performed in order to compare these estimators. Finally, all point estimators for right censored sample from the exponential distribution, are obtained.     

Computational approach test for inference about several correlation coefficients: Equality and common

In this article, we consider inference about the correlation coefficients of several bivariate normal distributions. We first propose computational approach tests for testing the equality of the correlation coefficients. In fact, these approaches are parametric bootstrap tests, and simulation studies show that they perform very satisfactory, and the actual sizes of these tests are better than other existing approaches. We also present a computational approach test and a parametric bootstrap confidence interval for inference about the parameter of common correlation coefficient. At the end, all the approaches are illustrated using two real examples.     

A probabilistic clustering method for data elements with normal distributed attributes

By considering uncertainty in the attributes common methods cannot be applicable in data clustering. In the recent years, many researches have been done by considering fuzzy concepts to interpolate the uncertainty. But when data elements attributes have probabilistic distributions, the uncertainty cannot be interpreted by fuzzy theory. In this article, a new concept for clustering of elements with predefined probabilistic distributions for their attributes has been proposed, so each observation will be as a member of a cluster with special probability. Two metaheuristic algorithms have been applied to deal with the problem. Squared Euclidean distance type has been considered to calculate the similarity of data elements to cluster centers. The sensitivity analysis shows that the proposed approach will converge to the classic approaches results when the variance of each point tends to be zero. Moreover, numerical analysis confirms that the proposed approach is efficient in clustering of probabilistic data.     

Saddlepoint p-values for group of linear rank tests

Many nonparametric tests in one sample problem, matched pairs, and competingrisks under censoring have the same underlying permutation distribution. This article proposes a saddlepoint approximation to the exact p-values of these tests instead of the asymptotic approximations. The performance of the saddlepoint approximation is assessed by using simulation studies that show the superiority of the saddlepoint methods over the asymptotic approximations in several settings. The use of the saddlepoint to approximate the p-values of class of two sample tests under complete randomized design is also discussed.