Analysis of one-way layout of count data in the presence of over or under dispersion

This article develops test statistics for the homogeneity of the means of several treatment groups of count data in the presence of over-dispersion or under-dispersion when there is no likelihood available. The C(α)$C(\alpha )$ or score type tests based on the models that are specified by only the first two moments of the counts are obtained using quasi-likelihood, extended quasi-likelihood, and double extended quasi-likelihood. Monte Carlo simulations are then used to study the comparative behavior of these C(α)$C(\alpha )$ statistics compared to the C(α)$C(\alpha )$ statistic based on a parametric model, namely, the negative binomial model, in terms of the following: size; power; robustness for departures from the data distribution as well as dispersion homogeneity. These simulations demonstrate that the C(α)$C(\alpha )$ statistic based on the double extended quasi-likelihood holds the nominal size at the 5% level well in all data situations, and it shows some edge in power over the other statistics, and, in particular, it performs much better than the commonly used statistic based on the quasi-likelihood. This C(α)$C(\alpha )$ statistic also shows robustness for moderate heterogeneity due to dispersion. Finally, applications to ecological, toxicological and biological data are given.     

Goodness-of-fit tests for parametric regression with selection biased data

Consider the nonparametric location-scale regression model Y=m(X)+σ(X)ε$Y=m(X)+\sigma (X)\epsilon$, where the error ε$\epsilon$ is independent of the covariate X$X$, and m$m$ and σ$\sigma$ are smooth but unknown functions. The pair (X,Y)$(X,Y)$ is allowed to be subject to selection bias. We construct tests for the hypothesis that m(·)$m(·)$ belongs to some parametric family of regression functions. The proposed tests compare the nonparametric maximum likelihood estimator (NPMLE) based on the residuals obtained under the assumed parametric model, with the NPMLE based on the residuals obtained without using the parametric model assumption. The asymptotic distribution of the test statistics is obtained. A bootstrap procedure is proposed to approximate the critical values of the tests. Finally, the finite sample performance of the proposed tests is studied in a simulation study, and the developed tests are applied on environmental data.     

Testing of a sub-hypothesis in linear regression models with long memory errors and deterministic design

This paper considers the problem of testing a sub-hypothesis in homoscedastic linear regression models where errors form long memory moving average processes and designs are non-random. Unlike in the random design case, asymptotic null distribution of the likelihood ratio type test based on the Whittle quadratic form is shown to be non-standard and non-chi-square. Moreover, the rate of consistency of the minimum Whittle dispersion estimator of the slope parameter vector is shown to be n^-(1-α)/2$n^{-(1-\alpha )/2}$, different from the rate n^-1/2$n^{-1/2}$ obtained in the random design case, where α$\alpha$ is the rate at which the error spectral density explodes at the origin. The proposed test is shown to be consistent against fixed alternatives and has non-trivial asymptotic power against local alternatives that converge to null hypothesis at the rate n^-(1-α)/2$n^{-(1-\alpha )/2}$.     

Regression models for functional data by reproducing kernel Hilbert spaces methods

Non-parametric regression models are developed when the predictor is a function-valued random variable X={_Xt}t∈T$X=\{X_t{\}}_{t\in T}$. Based on a representation of the regression function f(X)$f(X)$ in a reproducing kernel Hilbert space such models generalize the classical setting used in statistical learning theory. Two applications corresponding to scalar and categorical response random variable are performed on stock-exchange and medical data. The results of different regression models are compared.     

Statistical analysis for rounded data

When random variables do not take discrete values, observed data are often the rounded values of continuous random variables. Errors caused by rounding of data are often neglected by classical statistical theories. While some pioneers have identified and made suggestions to rectify the problem, few suitable approaches were proposed. In this paper, we propose an approximate MLE (AMLE) procedure to estimate the parameters and discuss the consistency and asymptotic normality of the estimates. For our illustration, we shall consider the estimates of the parameters in AR(p)$\mathit{AR}(p)$ and MA(q)$\mathit{MA}(q)$ models for rounded data.     

Tools for constructing optimal two-level factorial designs for a linear model containing main effects and one two-factor interaction

In Hedayat and Pesotan [1992, Two-level factorial designs for main effects and selected two-factor interactions. Statist. Sinica 2, 453–464.] the concepts of a g(n,e)$g(n,e)$-design and a g(n,e)$g(n,e)$-matrix are introduced to study designs of n$n$ factor two-level experiments which can unbiasedly estimate the mean, the n$n$ main effects and e$e$ specified two-factor interactions appearing in an orthogonal polynomial model and it is observed that the construction of a g-design is equivalent to the construction of a g  -matrix. This paper deals with the construction of D-optimal g(n,1)$g(n,1)$-matrices. A standard form for a g(n,1)$g(n,1)$-matrix is introduced and some lower and upper bounds on the absolute determinant value of a D-optimal g(n,1)$g(n,1)$-matrix in the class of all g(n,1)$g(n,1)$-matrices are obtained and an approach to construct D-optimal g(n,1)$g(n,1)$-matrices is given for 2?n?8$2?n?8$. For two specific subclasses, namely a certain class of g(n,1)$g(n,1)$-matrices within the class of g(n,1)$g(n,1)$-matrices of index one and the class C(H)$C(H)$ of g(8t+2,1)$g(8t+2,1)$-matrices constructed from a normalized Hadamard matrix H   of order 8t+4(t?1)$8t+4(t?1)$ two techniques for the construction of the restricted D-optimal matrices are given.     

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.     

Super-simple cyclic designs with small values

Super-simple cyclic designs are useful on constructing codes and designs such as superimposed codes, perfect hash families and optical orthogonal codes with index two. In this paper, we show that there exists a super-simple cyclic (v,4,λ)$(v,4,\lambda )$ for 7?v?41$7?v?41$ and all admissible λ$\lambda$ with two definite exceptions of (v,λ)=(9,3),(13,5)$(v,\lambda )=(9,3),(13,5)$ and one possible exception of (v,λ)=(39,18)$(v,\lambda )=(39,18)$. Some useful algorithms are explained for computer search and new designs are displayed.     

Minimum Hellinger distance estimation in a nonparametric mixture model

In this paper, we investigate the estimation problem of the mixture proportion λ$\lambda$ in a nonparametric mixture model of the form λF(x)+(1-λ)G(x)$\lambda F(x)+(1-\lambda )G(x)$ using the minimum Hellinger distance approach, where F and G are two unknown distributions. We assume that data from the distributions F and G   as well as from the mixture distribution λF+(1-λ)G$\lambda F+(1-\lambda )G$ are available. We construct a minimum Hellinger distance estimator of λ$\lambda$ and study its asymptotic properties. The proposed estimator is chosen to minimize the Hellinger distance between a parametric mixture model and a nonparametric density estimator. We also develop a maximum likelihood estimator of λ$\lambda$. Theoretical properties such as the existence, strong consistency, asymptotic normality and asymptotic efficiency of the proposed estimators are investigated. Robustness properties of the proposed estimator are studied using a Monte Carlo study. Two real data examples are also analyzed.     

Constrained Bayes and empirical Bayes estimation under random effects normal ANOVA model with balanced loss function

The paper develops constrained Bayes and empirical Bayes estimators in the random effects ANOVA model under balanced loss functions. In the balanced normal–normal model, estimators of the Bayes risks of the constrained Bayes and constrained empirical Bayes estimators are provided which are correct asymptotically up to O(m^-1)$\mathrm{O}(m^{-1})$, that is the remainder term is o(m^-1)$\mathrm{o}(m^{-1})$, m$m$ denoting the number of strata.     

Representing a function of two variables as a superposition over angles of ridge functions with a given shape via linear programming

A ridge function with shape function g   in the horizontal direction is a function of the form g(x)h(y,0)$g(x)h(y,0)$. Along each horizontal line it has the shape g(x)$g(x)$, multiplied by a function h(y,0)$h(y,0)$ which depends on the y-value of the horizontal line. Similarly a ridge function with shape function g   in the vertical direction has the form g(y)h(x,π/2)$g(y)h(x,\pi /2)$. For a given shape function g it may or may not be possible to represent an arbitrary   function f(x,y)$f(x,y)$ as a superposition over all angles of a ridge function with shape g   in each direction, where h=_hf=_hf,g$h=h_f=h_{f,g}$ depends on the functions f and g   and also on the direction, θ:h=_hf,g(·,θ)$\theta :h=h_{f,g}(·,\theta )$. We show that if g   is Gaussian centered at zero then this is always possible and we give the function _hf,g$h_{f,g}$ for a given f(x,y)$f(x,y)$. For highpass or for odd shapes g  , we show it is impossible to represent an arbitrary f(x,y)$f(x,y)$, i.e. in general there is no _hf,g$h_{f,g}$. Note that our problem is similar to tomography, where the problem is to invert the Radon transform, except that the use of the word inversion is here somewhat “inverted”: in tomography f(x,y)$f(x,y)$ is unknown and we find it by inverting the projections of f  ; here, f(x,y)$f(x,y)$ is known, g(z)$g(z)$ is known, and _hf(·,θ)=_hf,g(·,θ)$h_f(·,\theta )=h_{f,g}(·,\theta )$ is the unknown.     

Classification of orthogonal arrays by integer programming

The problem of classifying all isomorphism classes of OA(N,k,s,t)$\mathrm{OA}(N,k,s,t)$'s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot [2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94, 71–90; 2003a. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98, 3–21; 2003b. Small covering designs by branch-and-cut. Math. Programming Ser. B 94, 207–220; 2007. Symmetric ILP: coloring and small integers. Discrete Optim., 4, 40–62] for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24,7,2,2)$\mathrm{OA}(24,7,2,2)$'s, OA(24,k,2,3)$\mathrm{OA}(24,k,2,3)$'s for 6?k?11$6?k?11$, OA(32,k,2,3)$\mathrm{OA}(32,k,2,3)$'s for 6?k?11$6?k?11$, OA(40,k,2,3)$\mathrm{OA}(40,k,2,3)$'s for 6?k?10$6?k?10$, OA(48,k,2,3)$\mathrm{OA}(48,k,2,3)$'s for 6?k?8$6?k?8$, OA(56,k,2,3)$\mathrm{OA}(56,k,2,3)$'s, OA(80,k,2,4)$\mathrm{OA}(80,k,2,4)$'s, OA(112,k,2,4)$\mathrm{OA}(112,k,2,4)$'s, for k=6,7$k=6,7$, OA(64,k,2,4)$\mathrm{OA}(64,k,2,4)$'s, OA(96,k,2,4)$\mathrm{OA}(96,k,2,4)$'s for k=7,8$k=7,8$, and OA(144,k,2,4)$\mathrm{OA}(144,k,2,4)$'s for k=8,9$k=8,9$. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented.     

Regularization and variable selection for infinite variance autoregressive models

Autoregressive models with infinite variance are of great importance in modeling heavy-tailed time series and have been well studied. In this paper, we propose a penalized method to conduct model selection for autoregressive models with innovations having Pareto-like distributions with index α∈(0,2)$\alpha \in (\mathrm{0,2})$. By combining the least absolute deviation loss function and the adaptive lasso penalty, the proposed method is able to consistently identify the true model and at the same time produce efficient estimators with a convergence rate of n^−1/α$n^{-1/\alpha }$. In addition, our approach provides a unified way to conduct variable selection for autoregressive models with finite or infinite variance. A simulation study and a real data analysis are conducted to illustrate the effectiveness of our method.     

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.