Inferences on correlation coefficients: One-sample,independent and correlated cases

This article concerns inference on the correlation coefficients of a multivariate normal distribution. Inferential procedures based on the concepts of generalized variables (GVs) and generalized p$p$-values are proposed for elements of a correlation matrix. For the simple correlation coefficient, the merits of the generalized confidence limits and other approximate methods are evaluated using a numerical study. The study indicates that the proposed generalized confidence limits are uniformly most accurate even for samples as small as three. The results are extended for comparing two independent correlations, overlapping and non-overlapping dependent correlations. For each problem, the properties of the GV approach and other asymptotic methods are evaluated using Monte Carlo simulation. The GV approach produces satisfactory results for all the problems considered. The methods are illustrated using a few practical examples.     

CARMA(p,q) generalized random processes

There is now a vast literature on the theory and applications of generalized random processes, pioneered by Itô (1953), Gel’fand (1955) and Yaglom (1957). In this note we make use of the theory of generalized random processes as defined in the book of Gel’fand and Vilenkin (1964) to extend the definition of continuous-time ARMA(p,q  ) processes to allow q≥p$q\ge p$, in which case the processes do not exist in the classical sense. The resulting CARMA generalized random processes provide a framework within which it is possible to study derivatives of CARMA processes of arbitrarily high order.     

Optimal fractional factorial designs and their construction

Optimal symmetrical fractional factorial designs with n$n$ runs and m$m$ factors of s$s$ levels each are constructed. We consider only designs such that no two factors are aliases. The minimum moment aberration criterion proposed by Xu (2003) is used to judge the optimality of the designs. The minimum moment aberration criterion is equivalent to the popular generalized minimum aberration criterion proposed by Xu and Wu (2001), but the minimum moment criterion is simpler to formulate and employ computationally. Some optimal designs are constructed by using generalized Hadamard matrices.     

Explicit formulas for generalized family-wise error rates and unimprovable step-down multiple testing procedures

Many multiple testing procedures (MTPs) are available today, and their number is growing. Also available are many type I error rates: the family-wise error rate (FWER), the false discovery rate, the proportion of false positives, and others. Most MTPs are designed to control a specific type I error rate, and it is hard to compare different procedures. We approach the problem by studying the exact level at which threshold step-down (TSD) procedures (an important class of MTPs exemplified by the classic Holm procedure) control the generalized FWER   defined as the probability of k$k$ or more false rejections. We find that level explicitly for any TSD procedure and any k$k$. No assumptions are made about the dependency structure of the p$p$-values of the individual tests. We derive from our formula a criterion for unimprovability   of a procedure in the class of TSD procedures controlling the generalized FWER at a given level. In turn, this criterion implies that for each k$k$ the number of such unimprovable procedures is finite and is greater than one if k>1$k>1$. Consequently, in this case the most rejective procedure in the above class does not exist.     

Robust modified profile estimating function with application to the generalized estimating equation

We consider methods for reducing the effect of fitting nuisance parameters on a general estimating function, when the estimating function depends on not only a vector of parameters of interest, θ$\theta$, but also on a vector of nuisance parameters, λ$\lambda$. We propose a class of modified profile estimating functions with plug-in bias reduced by two orders. A robust version of the adjustment term does not require any information about the probability mechanism beyond that required by the original estimating function. An important application of this method is bias correction for the generalized estimating equation in analyzing stratified longitudinal data, where the stratum-specific intercepts are considered as fixed nuisance parameters, the dependence of the expected outcome on the covariates is of interest, and the intracluster correlation structure is unknown. Furthermore, when the quasi-scores for θ$\theta$ and λ$\lambda$ are available, we propose an additional multiplicative adjustment term such that the modified profile estimating function is approximately information unbiased. This multiplicative adjustment term can serve as an optimal weight in the analysis of stratified studies. A brief simulation study shows that the proposed method considerably reduces the impact of the nuisance parameters.     

Asymptotic properties of the EPMC for modified linear discriminant analysis when sample size and dimension are both large

We deal with the problem of classifying a new observation vector into one of two known multivariate normal distributions when the dimension p and training sample size N   are both large with p<N$p<N$. Modified linear discriminant analysis (MLDA) was suggested by Xu et al. [10]. Error rate of MLDA is smaller than the one of LDA. However, if p and N   are moderately large, error rate of MLDA is close to the one of LDA. These results are conditional ones, so we should investigate whether they hold unconditionally. In this paper, we give two types of asymptotic approximations of expected probability of misclassification (EPMC) for MLDA as n→∞$n\to \infty$ with p=O(n^δ)$p=O(n^{\delta })$, 0<δ<1$0<\delta <1$. The one of two is the same as the asymptotic approximation of LDA, and the other is corrected version of the approximation. Simulation reveals that the modified version of approximation has good accuracy for the case in which p and N are moderately large.     

Exact D-optimal designs for a linear log contrast model with mixture experiment for three and four ingredients

This study investigates the exact D-optimal designs of the linear log contrast model using the mixture experiment suggested by Aitchison and Bacon-Shone (1984) and the design space restricted by Lim (1987) and Chan (1988). Results show that for three ingredients, there are six extreme points that can be divided into two non-intersect sets S₁ and S₂. An exact N-point D  -optimal design for N=3p+q,p≥1,1≤q≤2$N=3p+q,p\ge 1,1\le q\le 2$ arranges equal weight n/N,0≤n≤p$n/N,0\le n\le p$ at the points of S₁ (S₂) and puts the remaining weight (N−3n)/N$(N-3n)/N$ on the points of S₂ (S₁) as evenly as possible. For four ingredients and N=6p+q,p≥1,1≤q≤5$N=6p+q,p\ge 1,1\le q\le 5$, an exact N-point design that distributes the weights as evenly as possible among the six supports of the approximate D-optimal design is exact D-optimal.     

Confidence limits and prediction limits for a Weibull distribution based on the generalized variable approach

In this article, we consider the problems of constructing confidence interval for a Weibull mean and setting prediction limits for future samples. Specifically, we construct upper prediction limits that include at least l$l$ of m$m$ samples from a Weibull distribution at each of r$r$ locations. The methods are based on the concept of generalized variable approach. The procedures can be easily extended to the type II censored samples, and they can be used to find approximate inferential procedures for type I censored samples. The proposed methods are conceptually simple and easy to use. The results are illustrated using some practical examples.     

Results for two-level fractional factorial designs of resolution IV or more

The main theorem of this paper shows that foldover designs are the only (regular or nonregular) two-level factorial designs of resolution IV (strength 3) or more for n   runs and n/3?m?n/2$n/3?m?n/2$ factors. This theorem is a generalization of a coding theory result of Davydov and Tombak [1990. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry. Problems Inform. Transmission 25, 265–275] which, under translation, effectively states that foldover (or even) designs are the only regular two-level factorial designs of resolution IV or more for n   runs and 5n/16?m?n/2$5n/16?m?n/2$ factors. This paper also contains other theorems including an alternative proof of Davydov and Tombak's result.     

Testing linear hypotheses of mean vectors for high-dimension data with unequal covariance matrices

We propose a new test procedure for testing linear hypothesis on the mean vectors of normal populations with unequal covariance matrices when the dimensionality, p exceeds the sample size N  , i.e. p/N→c<∞$p/N\to c<\infty$. Our procedure is based on the Dempster trace criterion and is shown to be consistent in high dimensions.     

Confidence intervals in regression utilizing prior information

We consider a linear regression model with regression parameter β=(_β1,…,_βp)$\beta =({\beta }_1,\dots ,{\beta }_p)$ and independent and identically N(0,σ²)$N(0,{\sigma }^2)$ distributed errors. Suppose that the parameter of interest is θ=a^Tβ$\theta =a^T\beta$ where a$a$ is a specified vector. Define the parameter τ=c^Tβ-t$\tau =c^T\beta -t$ where the vector c$c$ and the number t$t$ are specified and a$a$ and c$c$ are linearly independent. Also suppose that we have uncertain prior information that τ=0$\tau =0$. We present a new frequentist 1-α$1-\alpha$ confidence interval for θ$\theta$ that utilizes this prior information. We require this confidence interval to (a) have endpoints that are continuous functions of the data and (b) coincide with the standard 1-α$1-\alpha$ confidence interval when the data strongly contradict this prior information. This interval is optimal in the sense that it has minimum weighted average expected length where the largest weight is given to this expected length when τ=0$\tau =0$. This minimization leads to an interval that has the following desirable properties. This interval has expected length that (a) is relatively small when the prior information about τ$\tau$ is correct and (b) has a maximum value that is not too large. The following problem will be used to illustrate the application of this new confidence interval. Consider a 2×2$2\times 2$ factorial experiment with 20 replicates. Suppose that the parameter of interest θ$\theta$ is a specified simple   effect and that we have uncertain prior information that the two-factor interaction is zero. Our aim is to find a frequentist 0.95 confidence interval for θ$\theta$ that utilizes this prior information.     

Estimation of smooth regression functions in monotone response models

We consider the estimation of smooth regression functions in a class of conditionally parametric co-variate-response models. Independent and identically distributed observations are available from the distribution of (Z,X)$(Z,X)$, where Z is a real-valued co-variate with some unknown distribution, and the response X conditional on Z   is distributed according to the density p(·,ψ(Z))$p(·,\psi (Z))$, where p(·,θ)$p(·,\theta )$ is a one-parameter exponential family. The function ψ$\psi$ is a smooth monotone function. Under this formulation, the regression function E(X|Z)$E(X|Z)$ is monotone in the co-variate Z   (and can be expressed as a one–one function of ψ$\psi$); hence the term “monotone response model”. Using a penalized least squares approach that incorporates both monotonicity and smoothness, we develop a scheme for producing smooth monotone estimates of the regression function and also the function ψ$\psi$ across this entire class of models. Point-wise asymptotic normality of this estimator is established, with the rate of convergence depending on the smoothing parameter. This enables construction of Wald-type (point-wise) as well as pivotal confidence sets for ψ$\psi$ and also the regression function. The methodology is extended to the general heteroscedastic model, and its asymptotic properties are discussed.     

An identity for the Fisher information and Mahalanobis distance

Consider a mixture problem consisting of k classes. Suppose we observe an s-dimensional random vector X   whose distribution is specified by the relations P(X∈A|Y=i)=_Pi(A)$P(X\in A|Y=i)=P_i(A)$, where Y   is an unobserved class identifier defined on {1,…,k}$\{1,\dots ,k\}$, having distribution P(Y=i)=_pi$P(Y=i)=p_i$. Assuming the distributions _Pi$P_i$ having a common covariance matrix, elegant identities are presented that connect the matrix of Fisher information in Y   on the parameters _p1,…,_pk$p_1,\dots ,p_k$, the matrix of linear information in X, and the Mahalanobis distances between the pairs of P  's. Since the parameters are not free, the information matrices are singular and the technique of generalized inverses is used. A matrix extension of the Mahalanobis distance and its invariant forms are introduced that are of interest in their own right. In terms of parameter estimation, the results provide an independent of the parameter upper bound for the loss of accuracy by esimating _p1,…,_pk$p_1,\dots ,p_k$ from a sample of X^′$X^{\prime }$s, as compared with the ideal estimator based on a random sample of Y^′$Y^{\prime }$s.     

Mantel-Haenszel estimators for irregular sparse K2×J tables

This paper deals with sparse K2×J(J>2)$K2\times J(J>2)$ tables. Projection-method Mantel–Haenszel (MH) estimators of the common odds ratios have been proposed for K2×J$K2\times J$ tables, which include Greenland's generalized MH estimator as a special case. The method projects log-transformed MH estimators for all K2×2$K2\times 2$ subtables, which were called naive MH estimators, onto a linear space spanned by log odds ratios. However, for sparse tables it is often the case that naive MH estimators are unable to be computed. In this paper we introduce alternative naive MH estimators using a graph that represents K2×J$K2\times J$ tables, and apply the projection to these alternative estimators. The idea leads to infinitely many reasonable estimators and we propose a method to choose the optimal one by solving a quadratic optimization problem induced by the graph, where some graph-theoretic arguments play important roles to simplify the optimization problem. An illustration is given using data from a case–control study. A simulation study is also conducted, which indicates that the MH estimator tends to have a smaller mean squared error than the MH estimator previously suggested and the conditional maximum likelihood estimator for sparse tables.     

A marked point process perspective in fitting spatial point process models

This paper discusses a new perspective in fitting spatial point process models. Specifically the spatial point process of interest is treated as a marked point process where at each observed event x$\mathbf{x}$ a stochastic process M(x;t)$M(\mathbf{x};t)$, 0<t<r$0<t<r$, is defined. Each mark process M(x;t)$M(\mathbf{x};t)$ is compared with its expected value, say F(t;θ)$F(t;\theta )$, to produce a discrepancy measure at x$\mathbf{x}$, where θ$\theta$ is a set of unknown parameters. All individual discrepancy measures are combined to define an overall measure which will then be minimized to estimate the unknown parameters. The proposed approach can be easily applied to data with sample size commonly encountered in practice. Simulations and an application to a real data example demonstrate the efficacy of the proposed approach.     

Asymptotic results in canonical discriminant analysis when the dimension is large compared to the sample size

This paper deals with the distributions of test statistics for the number of useful discriminant functions and the characteristic roots in canonical discriminant analysis. These asymptotic distributions have been extensively studied when the number p   of variables is fixed, the number q+1$q+1$ of groups is fixed, and the sample size N tends to infinity. However, these approximations become increasingly inaccurate as the value of p increases for a fixed value of N. On the other hand, we encounter to analyze high-dimensional data such that p is large compared to n. The purpose of the present paper is to derive asymptotic distributions of these statistics in a high-dimensional framework such that q   is fixed, p→∞$p\to \infty$, m=n-p+q→∞$m=n-p+q\to \infty$, and p/n→c∈(0,1)$p/n\to c\in (0,1)$, where n=N-q-1$n=N-q-1$. Numerical simulation revealed that our new asymptotic approximations are more accurate than the classical asymptotic approximations in a considerably wide range of (n,p,q)$(n,p,q)$.