both of which are concerned with determining the inter-relationships among two or more variables.
Other chapters of the NAG Library which cover similar problems are Chapters E02 and E04. Chapter E02 routines may be used to fit linear models by criteria other than least squares and also for polynomial regression; Chapter E04 routines may be used to fit nonlinear models and linearly constrained linear models.
2Background to the Problems
2.1Correlation
2.1.1Aims of correlation analysis
Correlation analysis provides a single summary statistic – the correlation coefficient – describing the strength of the association between two variables. The most common types of association which are investigated by correlation analysis are linear relationships, and there are a number of forms of linear correlation coefficients for use with different types of data.
2.1.2Correlation coefficients
The (Pearson) product-moment correlation coefficients measure a linear relationship, while Kendall's tau and Spearman's rank order correlation coefficients measure monotonicity only. All three coefficients range from $-1.0$ to $+1.0$. A coefficient of zero always indicates that no linear relationship exists; a $+1.0$ coefficient implies a ‘perfect’ positive relationship (i.e., an increase in one variable is always associated with a corresponding increase in the other variable); and a coefficient of $-1.0$ indicates a ‘perfect’ negative relationship (i.e., an increase in one variable is always associated with a corresponding decrease in the other variable).
Consider the bivariate scattergrams in Figure 1: (a) and (b) show strictly linear functions for which the values of the product-moment correlation coefficient, and (since a linear function is also monotonic) both Kendall's tau and Spearman's rank order coefficients, would be $+1.0$ and $-1.0$ respectively. However, though the relationships in figures (c) and (d) are respectively monotonically increasing and monotonically decreasing, for which both Kendall's and Spearman's nonparametric coefficients would be $+1.0$ (in (c)) and $-1.0$ (in (d)), the functions are nonlinear so that the product-moment coefficients would not take such ‘perfect’ extreme values. There is no obvious relationship between the variables in figure (e), so all three coefficients would assume values close to zero, while in figure (f) though there is an obvious parabolic relationship between the two variables, it would not be detected by any of the correlation coefficients which would again take values near to zero; it is important, therefore, to examine scattergrams as well as the correlation coefficients.
In order to decide which type of correlation is the most appropriate, it is necessary to appreciate the different groups into which variables may be classified. Variables are generally divided into four types of scales: the nominal scale, the ordinal scale, the interval scale, and the ratio scale. The nominal scale is used only to categorise data; for each category a name, perhaps numeric, is assigned so that two different categories will be identified by distinct names. The ordinal scale, as well as categorising the observations, orders the categories. Each category is assigned a distinct identifying symbol, in such a way that the order of the symbols corresponds to the order of the categories. (The most common system for ordinal variables is to assign numerical identifiers to the categories, though if they have previously been assigned alphabetic characters, these may be transformed to a numerical system by any convenient method which preserves the ordering of the categories.) The interval scale not only categorises and orders the observations, but also quantifies the comparison between categories; this necessitates a common unit of measurement and an arbitrary zero-point. Finally, the ratio scale is similar to the interval scale, except that it has an absolute (as opposed to arbitrary) zero-point.
Product-moment correlation coefficients are used with variables which are interval (or ratio) scales; these coefficients measure the amount of spread about the linear least squares equation. For a product-moment correlation coefficient, $r$, based on $n$ pairs of observations, testing against the null hypothesis that there is no correlation between the two variables, the statistic
$$r\sqrt{\frac{n-2}{1-{r}^{2}}}$$
has a Student's $t$-distribution with $n-2$ degrees of freedom; its significance can be tested accordingly.
Ranked and ordinal scale data are generally analysed by nonparametric methods – usually either Spearman's or Kendall's tau rank order correlation coefficients, which, as their names suggest, operate solely on the ranks, or relative orders, of the data values. Interval or ratio scale variables may also be validly analysed by nonparametric methods, but such techniques are statistically less powerful than a product-moment method. For a Spearman rank order correlation coefficient, $R$, based on $n$ pairs of observations, testing against the null hypothesis that there is no correlation between the two variables, for large samples the statistic
$$R\sqrt{\frac{n-2}{1-{R}^{2}}}$$
has approximately a Student's $t$-distribution with $n-2$ degrees of freedom, and may be treated accordingly. (This is similar to the product-moment correlation coefficient, $r$, see above.) Kendall's tau coefficient, based on $n$ pairs of observations, has, for large samples, an approximately Normal distribution with mean zero and standard deviation
$$\sqrt{\frac{4n+10}{9n(n-1)}}$$
when tested against the null hypothesis that there is no correlation between the two variables; the coefficient should, therefore, be divided by this standard deviation and tested against the standard Normal distribution, $\mathrm{N}(0,1)$.
When the number of ordinal categories a variable takes is large, and the number of ties is relatively small, Spearman's rank order correlation coefficients have advantages over Kendall's tau; conversely, when the number of categories is small, or there are a large number of ties, Kendall's tau is usually preferred. Thus, when the ordinal scale is more or less continuous, Spearman's rank order coefficients are preferred, whereas Kendall's tau is used when the data is grouped into a smaller number of categories; both measures do however include corrections for the occurrence of ties, and the basic concepts underlying the two coefficients are quite similar. The absolute value of Kendall's tau coefficient tends to be slightly smaller than Spearman's coefficient for the same set of data.
There is no authoritative dictum on the selection of correlation coefficients – particularly on the advisability of using correlations with ordinal data. This is a matter of discretion for you.
2.1.3Partial correlation
The correlation coefficients described above measure the association between two variables ignoring any other variables in the system. Suppose there are three variables $X,Y$ and $Z$ as shown in the path diagram below.
Figure 2
The association between $Y$ and $Z$ is made up of the direct association between $Y$ and $Z$ and the association caused by the path through $X$, that is the association of both $Y$ and $Z$ with the third variable $X$. For example, if $Z$ and $Y$ were cholesterol level and blood pressure and $X$ were age since both blood pressure and cholesterol level may increase with age the correlation between blood pressure and cholesterol level eliminating the effect of age is required.
The correlation between two variables eliminating the effect of a third variable is known as the partial correlation. If ${\rho}_{zy}$, ${\rho}_{zx}$ and ${\rho}_{xy}$ represent the correlations between $x$, $y$ and $z$ then the partial correlation between $Z$ and $Y$ given $X$ is
The partial correlation is then estimated by using product-moment correlation coefficients.
In general, let a set of variables be partitioned into two groups $Y$ and $X$ with ${n}_{y}$ variables in $Y$ and ${n}_{x}$ variables in $X$ and let the variance-covariance matrix of all ${n}_{y}+{n}_{x}$ variables be partitioned into
The partial correlation matrix is then computed by standardizing ${\Sigma}_{y\mid x}$.
2.1.4Robust estimation of correlation coefficients
The product-moment correlation coefficient can be greatly affected by the presence of a few extreme observations or outliers. There are robust estimation procedures which aim to decrease the effect of extreme values.
Mathematically these methods can be described as follows. A robust estimate of the variance-covariance matrix, $C$, can be written as
where ${\tau}^{2}$ is a correction factor to give an unbiased estimator if the data is Normal and $A$ is a lower triangular matrix. Let ${x}_{i}$ be the vector of values for the $i$th observation and let ${z}_{i}=A({x}_{i}-\theta )$, $\theta $ being a robust estimate of location, then $\theta $ and $A$ are found as solutions to
where $w\left(t\right)$, $u\left(t\right)$ and $v\left(t\right)$ are functions such that they return a value of $1$ for reasonable values of $t$ and decreasing values for large $t$. The correlation matrix can then be calculated from the variance-covariance matrix. If $w$, $u$, and $v$ returned $1$ for all values then the product-moment correlation coefficient would be calculated.
2.1.5Missing values
When there are missing values in the data these may be handled in one of two ways. Firstly, if a case contains a missing observation for any variable, then that case is omitted in its entirety from all calculations; this may be termed casewise treatment of missing data. Secondly, if a case contains a missing observation for any variable, then the case is omitted from only those calculations involving the variable for which the value is missing; this may be called pairwise treatment of missing data. Pairwise deletion of missing data has the advantage of using as much of the data as possible in the computation of each coefficient. In extreme circumstances, however, it can have the disadvantage of producing coefficients which are based on a different number of cases, and even on different selections of cases or samples; furthermore, the ‘correlation’ matrices formed in this way need not necessarily be positive semidefinite, a requirement for a correlation matrix. Casewise deletion of missing data generally causes fewer cases to be used in the calculation of the coefficients than does pairwise deletion. How great this difference is will obviously depend on the distribution of the missing data, both among cases and among variables.
Pairwise treatment does, therefore, use more information from the sample but should not be used without careful consideration of the location of the missing observations in the data matrix, and the consequent effect of processing the missing data in that fashion.
2.1.6Nearest Correlation Matrix
A correlation matrix is, by definition, a symmetric, positive semidefinite matrix with unit diagonals and all elements in the range $[\mathrm{-1},1]$.
In practice, rather than having a true correlation matrix, you may find that you have a matrix of pairwise correlations. This usually occurs in the presence of missing values, when the missing values are treated in a pairwise fashion as discussed in Section 2.1.5. Matrices constructed in this way may not be not positive semidefinite, and, therefore, are not a valid correlation matrix. However, a valid correlation matrix can be calculated that is in some sense ‘close’ to the original.
Given an $n\times n$ matrix, $G$, there are a number of available ways of computing the ‘nearest’ correlation matrix, $\Sigma $ to $G$:
Where $S$ is the symmetric matrix defined as $S=\frac{1}{2}(G+{G}^{\mathrm{T}})$ and ${s}_{ij}$ and ${\sigma}_{ij}$ denotes the elements of $S$ and $\Sigma $ respectively.
A weighted Frobenius norm can also be used. The term being summed across, therefore, becomes
${w}_{i}{w}_{j}{({s}_{ij}-{\sigma}_{ij})}^{2}$ if row and column weights are being used or
${w}_{ij}{({s}_{ij}-{\sigma}_{ij})}^{2}$
when element-wise weights are used. A constraint on the rank of $\Sigma $ can also be added if a low-rank correlation matrix is required to constrain the number of independent random variables.
(b)Factor Loading Method
This method is similar to (a) in that it finds a $\Sigma $ that is closest to $S$ in the Frobenius norm. However, it also ensures that $\Sigma $ has a $k$-factor structure, that is $\Sigma $ can be written as
where $I$ is the identity matrix and $X$ has $n$ rows and $k$ columns.
$X$ is often referred to as the factor loading matrix. This problem primarily arises when a factor model $\xi =X\eta +D\epsilon $ is used to describe a multivariate time series or collateralized debt obligations. In this model $\eta \in {\mathbb{R}}^{k}$ and $\xi \in {\mathbb{R}}^{n}$ are vectors of independent random variables having zero mean and unit variance, with $\eta $ and $\epsilon $ independent of each other, and $X\in {\mathbb{R}}^{n\times k}$ with $D\in {\mathbb{R}}^{n\times n}$ diagonal. In the case of modelling debt obligations $\xi $ can, for example, model the equity returns of $n$ different companies of a portfolio where $\eta $ describes $k$ factors influencing all companies, in contrast to the elements of $\epsilon $ having only an effect on the equity of the corresponding company. With this model the complex behaviour of a portfolio, with potentially thousands of equities, is captured by looking at the major factors driving the behaviour.
The number of factors usually chosen is a lot smaller than $n$, perhaps between $1$ and $10$, yielding a large reduction in the complexity. The number of the factors, $k$, which yields a matrix $X$ such that ${\Vert G-X{X}^{\mathrm{T}}+\mathrm{diag}(I-X{X}^{\mathrm{T}})\Vert}_{F}$ is within a required tolerance can also be determined, by experimenting with the input $k$ and comparing the norms.
(c)Shrinking
Find the smallest $\alpha $ such that
$$\alpha T+(1-\alpha )S$$
is a correlation matrix. Here $T$ is a positive definite target matrix with unit diagonal. $T$ can be chosen to fix elements in the resulting matrix by having elements equal to the corresponding element in $S$.
Shrinking algorithms can be very efficient, using bisection to find $\alpha $. A solution is always found, as $\alpha =1$ gives the result $T$, which is necessarily a valid correlation matrix.
Note that shrinking algorithms do not find the nearest correlation matrix in any mathematical sense, simply the smallest $\alpha $ in the structure above.
2.2Regression
2.2.1Aims of regression modelling
In regression analysis the relationship between one specific random variable, the dependent or response variable, and one or more known variables, called the independent variables or covariates, is studied. This relationship is represented by a mathematical model, or an equation, which associates the dependent variable with the independent variables, together with a set of relevant assumptions. The independent variables are related to the dependent variable by a function, called the regression function, which involves a set of unknown parameters. Values of the parameters which give the best fit for a given set of data are obtained; these values are known as the estimates of the parameters.
The reasons for using a regression model are twofold. The first is to obtain a description of the relationship between the variables as an indicator of possible causality. The second reason is to predict the value of the dependent variable from a set of values of the independent variables. Accordingly, the most usual statistical problems involved in regression analysis are:
(i)to obtain best estimates of the unknown regression parameters;
(ii)to test hypotheses about these parameters;
(iii)to determine the adequacy of the assumed model; and
(iv)to verify the set of relevant assumptions.
2.2.2Regression models and designed experiments
One application of regression models is in the analysis of experiments. In this case the model relates the dependent variable to qualitative independent variables known as factors. Factors may take a number of different values known as levels. For example, in an experiment in which one of four different treatments is applied, the model will have one factor with four levels. Each level of the factor can be represented by a dummy variable taking the values $0$ or $1$. So, in the example there are four dummy variables ${x}_{j}$, for $\mathit{j}=1,2,3,4$, such that:
$$\begin{array}{ll}{x}_{ij}& =1\text{ if the}i\text{th observation received the}j\text{th treatment}\\ & =0\text{ otherwise,}\end{array}$$
along with a variable for the mean ${x}_{0}$:
$$\begin{array}{ll}{x}_{i0}& =1\text{ for all}i\text{.}\end{array}$$
If there were seven observations the data would be:
This means that the effect of ${x}_{4}$ cannot be distinguished from the combined effect of ${x}_{0},{x}_{1},{x}_{2}$ and ${x}_{3}$. This is known as aliasing. In this situation, the aliasing can be deduced from the experimental design and as a result the model to be fitted; in such situations it is known as intrinsic aliasing. In the example above no matter how many times each treatment is replicated (other than $0$) the aliasing will still be present. If the aliasing is due to a particular dataset to which the model is to be fitted then it is known as extrinsic aliasing. If in the example above observation $1$ was missing then the ${x}_{1}$ term would also be aliased. In general, intrinsic aliasing may be overcome by changing the model, e.g., remove ${x}_{0}$ or ${x}_{1}$ from the model, or by introducing constraints on the parameters, e.g., ${\beta}_{1}+{\beta}_{2}+{\beta}_{3}+{\beta}_{4}=0$.
If aliasing is present then there will no longer be a unique set of least squares estimates for the parameters of the model but the fitted values will still have a unique estimate. Some linear functions of the parameters will also have unique estimates; these are known as estimable functions. In the example given above the functions (${\beta}_{0}+{\beta}_{1}$) and (${\beta}_{2}-{\beta}_{3}$) are both estimable.
2.2.3Selecting the regression model
In many situations there are several possible independent variables, not all of which may be needed in the model. In order to select a suitable set of independent variables, two basic approaches can be used.
(a)All possible regressions
In this case all the possible combinations of independent variables are fitted and the one considered the best selected. To choose the best, two conflicting criteria have to be balanced. One is the fit of the model which will improve as more variables are added to the model. The second criterion is the desire to have a model with a small number of significant terms. Depending on how the model is fit, statistics such as ${R}^{2}$, which gives the proportion of variation explained by the model, and ${C}_{p}$, which tries to balance the size of the residual sum of squares against the number of terms in the model, can be used to aid in the choice of model.
(b)Stepwise model building
In stepwise model building the regression model is constructed recursively, adding or deleting the independent variables one at a time. When the model is built up the procedure is known as forward selection. The first step is to choose the single variable which is the best predictor. The second independent variable to be added to the regression equation is that which provides the best fit in conjunction with the first variable. Further variables are then added in this recursive fashion, adding at each step the optimum variable, given the other variables already in the equation. Alternatively, backward elimination can be used. This is when all variables are added and then the variables dropped one at a time, the variable dropped being the one which has the least effect on the fit of the model at that stage. There are also hybrid techniques which combine forward selection with backward elimination.
2.3Linear Regression Models
When the regression model is linear in the parameters (but not necessarily in the independent variables), then the regression model is said to be linear; otherwise the model is classified as nonlinear.
The most elementary form of regression model is the simple linear regression of the dependent variable, $Y$, on a single independent variable, $x$, which takes the form
$$E\left(Y\right)={\beta}_{0}+{\beta}_{1}x$$
(1)
where $E\left(Y\right)$ is the expected or average value of $Y$ and ${\beta}_{0}$ and ${\beta}_{1}$ are the parameters whose values are to be estimated, or, if the regression is required to pass through the origin (i.e., no constant term),
$$E\left(Y\right)={\beta}_{1}x$$
(2)
where ${\beta}_{1}$ is the only unknown parameter.
An extension of this is multiple linear regression in which the dependent variable, $Y$, is regressed on the $p$ ($p>1$) independent variables, ${x}_{1},{x}_{2},\dots ,{x}_{p}$, which takes the form
where ${\beta}_{1},{\beta}_{2},\dots ,{\beta}_{p}$ and ${\beta}_{0}$ are the unknown parameters. Multiple linear regression models test include factors are sometimes known as General Linear (Regression) Models.
A special case of multiple linear regression is polynomial linear regression, in which the $p$ independent variables are in fact powers of the same single variable $x$ (i.e., ${x}_{j}={x}^{j}$, for $\mathit{j}=1,2,\dots ,p$).
There are a great variety of nonlinear regression models; one of the most common is exponential regression, in which the equation may take the form
$$E\left(Y\right)=a+b{e}^{cx}\text{.}$$
(5)
It should be noted that equation (4) represents a linear regression, since even though the equation is not linear in the independent variable, $x$, it is linear in the parameters ${\beta}_{0},{\beta}_{1},{\beta}_{2},\dots .,{\beta}_{p}$, whereas the regression model of equation (5) is nonlinear, as it is nonlinear in the parameters ($a$, $b$, and $c$).
2.3.1Fitting the regression model – least squares estimation
One method used to determine values for the parameters is, based on a given set of data, to minimize the sums of squares of the differences between the observed values of the dependent variable and the values predicted by the regression equation for that set of data – hence the term least squares estimation. For example, if a regression model of the type given by equation (3), namely
where ${e}_{i}$ are unknown independent random errors with $E\left({e}_{i}\right)=0$ and $\mathrm{var}\left({e}_{i}\right)={\sigma}^{2}$, ${\sigma}^{2}$ being a constant, then the method used is to calculate the estimates of the regression parameters ${\beta}_{0},{\beta}_{1},{\beta}_{2},\dots ,{\beta}_{p}$ by minimizing
$$\sum _{i=1}^{n}{e}_{i}^{2}\text{.}$$
(7)
If the errors do not have constant variance, i.e.,
then weighted least squares estimation is used in which
$$\sum _{i=1}^{n}{w}_{i}{e}_{i}^{2}$$
is minimized. For a more complete discussion of these least squares regression methods, and details of the mathematical techniques used, see Draper and Smith (1985) or Kendall and Stuart (1973).
2.3.2Computational methods for least squares regression
Let $X$ be the $n\times p$ matrix of independent variables and $y$ be the vector of values for the dependent variable. To find the least squares estimates of the vector of parameters, $\hat{\beta}$, the $QR$ decomposition of $X$ is found, i.e.,
$$X=Q{R}^{*}$$
where ${R}^{*}=\left(\begin{array}{c}R\\ 0\end{array}\right)$, $R$ being a $p\times p$ upper triangular matrix, and $Q$ an $n\times n$ orthogonal matrix. If $R$ is of full rank then $\hat{\beta}$ is the solution to
$$R\hat{\beta}={c}_{1}$$
where $c={Q}^{\mathrm{T}}y$ and ${c}_{1}$ is the first $p$ rows of $c$. If $R$ is not of full rank, a solution is obtained by means of a singular value decomposition (SVD) of $R$,
where $D$ is a $k\times k$ diagonal matrix with nonzero diagonal elements, $k$ being the rank of $R$, and ${Q}_{*}$ and $P$ are $p\times p$ orthogonal matrices. This gives the solution
${P}_{1}$ being the first $k$ columns of $P$ and ${Q}_{{*}_{1}}$ being the first $k$ columns of ${Q}_{*}$.
This will be only one of the possible solutions. Other estimates may be obtained by applying constraints to the parameters. If weighted regression with a vector of weights $w$ is required then both $X$ and $y$ are premultiplied by ${w}^{1/2}$.
The method described above will, in general, be more accurate than methods based on forming (${X}^{\mathrm{T}}X$), (or a scaled version), and then solving the equations
Having fitted a model two questions need to be asked: first, ‘are all the terms in the model needed?’ and second, ‘is there some systematic lack of fit?’. To answer the first question, either confidence intervals can be computed for the parameters or $t$-tests can be calculated to test hypotheses about the regression parameters – for example, whether the value of the parameter, ${\beta}_{k}$, is significantly different from a specified value, ${b}_{k}$ (often zero). If the estimate of ${\beta}_{k}$ is ${\hat{\beta}}_{k}$ and its standard error is $\mathrm{se}\left({\hat{\beta}}_{k}\right)$ then the $t$-statistic is
It should be noted that both the tests and the confidence intervals may not be independent. Alternatively, $F$-tests based on the residual sums of squares for different models can also be used to test the significance of terms in the model. If model $1$, giving residual sum of squares ${\mathit{RSS}}_{1}$ with degrees of freedom ${\nu}_{1}$, is a sub-model of model $2$, giving residual sum of squares ${\mathit{RSS}}_{2}$ with degrees of freedom ${\nu}_{2}$, i.e., all terms in model $1$ are also in model $2$, then to test if the extra terms in model $2$ are needed the $F$-statistic
may be used. These tests and confidence intervals require the additional assumption that the errors, ${e}_{i}$, are Normally distributed.
To check for systematic lack of fit the residuals, ${r}_{i}={y}_{i}-{\hat{y}}_{i}$, where ${\hat{y}}_{i}$ is the fitted value, should be examined. If the model is correct then they should be random with no discernible pattern. Due to the way they are calculated the residuals do not have constant variance. Now the vector of fitted values can be written as a linear combination of the vector of observations of the dependent variable, $y$, $\hat{y}=Hy$. The variance-covariance matrix of the residuals is then $(I-H){\sigma}^{2}$, $I$ being the identity matrix. The diagonal elements of $H$, ${h}_{ii}$, can, therefore, be used to standardize the residuals. The ${h}_{ii}$ are a measure of the effect of the $i$th observation on the fitted model and are sometimes known as leverages.
If the observations were taken serially the residuals may also be used to test the assumption of the independence of the ${e}_{i}$ and hence the independence of the observations.
2.3.4Ridge regression
When data on predictor variables $x$ are multicollinear, ridge regression models provide an alternative to variable selection in the multiple regression model. In the ridge regression case, parameter estimates in the linear model are found by penalised least squares:
where the value of the ridge parameter $h$ controls the trade-off between the goodness-of-fit and smoothness of a solution.
2.4Robust Estimation
Least squares regression can be greatly affected by a small number of unusual, atypical, or extreme observations. To protect against such occurrences, robust regression methods have been developed. These methods aim to give less weight to an observation which seems to be out of line with the rest of the data given the model under consideration. That is to seek to bound the influence. For a discussion of influence in regression, see Hampel et al. (1986) and Huber (1981).
There are two ways in which an observation for a regression model can be considered atypical. The values of the independent variables for the observation may be atypical or the residual from the model may be large.
The first problem of atypical values of the independent variables can be tackled by calculating weights for each observation which reflect how atypical it is, i.e., a strongly atypical observation would have a low weight. There are several ways of finding suitable weights; some are discussed in Hampel et al. (1986).
The second problem is tackled by bounding the contribution of the individual ${e}_{i}$ to the criterion to be minimized. When minimizing (7) a set of linear equations is formed, the solution of which gives the least squares estimates. The equations are
where ${\sigma}^{2}$ is the variance of the ${e}_{i}$, and $\psi $ is a suitable function which down weights large values of the standardized residuals ${e}_{i}/\sigma $. There are several suggested forms for $\psi $, one of which is Huber's function,
The solution to (8) gives the $M$-estimates of the regression coefficients. The weights can be included in (8) to protect against both types of extreme value. The parameter $\sigma $ can be estimated by the median absolute deviations of the residuals or as a solution to, in the unweighted case,
where $\chi $ is a suitable function and $\beta $ is a constant chosen to make the estimate unbiased. $\chi $ is often chosen to be ${\psi}^{2}/2$ where $\psi $ is given in (9). Another form of robust regression is to minimize the sum of absolute deviations, i.e.,
Robust regressions using least absolute deviations can be computed using routines in Chapter E02.
2.5Generalized Linear Models
Generalized linear models are an extension of the general linear regression model discussed above. They allow a wide range of models to be fitted. These included certain nonlinear regression models, logistic and probit regression models for binary data, and log-linear models for contingency tables. A generalized linear model consists of three basic components:
(a)A suitable distribution for the dependent variable $Y$. The following distributions are common:
(i)Normal
(ii)binomial
(iii)Poisson
(iv)gamma
In addition to the obvious uses of models with these distributions it should be noted that the Poisson distribution can be used in the analysis of contingency tables while the gamma distribution can be used to model variance components. The effect of the choice of the distribution is to define the relationship between the expected value of $Y$, $E\left(Y\right)=\mu $, and its variance and so a generalized linear model with one of the above distributions may be used in a wider context when that relationship holds.
(b)A linear model $\eta =\sum {\beta}_{j}{x}_{j}$, $\eta $ is known as a linear predictor.
(c)A link function $g(\xb7)$ between the expected value of $Y$ and the linear predictor, $g\left(\mu \right)=\eta $. The following link functions are available:
For the binomial distribution $\epsilon $, observing $y$ out of $t$:
(i)exponent link: $\eta ={\mu}^{a}$, for a constant $a$;
(ii)identity link: $\eta =\mu $;
(iii)log link: $\eta =\mathrm{log}\mu $;
(iv)square root link: $\eta =\sqrt{\mu}$;
(v)reciprocal link: $\eta =\frac{1}{\mu}$.
For each distribution there is a canonical link. For the canonical link there exist sufficient statistics for the parameters. The canonical links are:
(i)Normal – identity;
(ii)binomial – logistic;
(iii)Poisson – logarithmic;
(iv)gamma – reciprocal.
For the general linear regression model described above the three components are:
(i)Distribution – Normal;
(ii)Linear model – $\sum {\beta}_{j}{x}_{j}$;
(iii)Link – identity.
The model is fitted by maximum likelihood; this is equivalent to least squares in the case of the Normal distribution. The residual sums of squares used in regression models is generalized to the concept of deviance. The deviance is the logarithm of the ratio of the likelihood of the model to the full model in which ${\hat{\mu}}_{i}={y}_{i}$, where ${\hat{\mu}}_{i}$ is the estimated value of ${\mu}_{i}$. For the Normal distribution the deviance is the residual sum of squares. Except for the case of the Normal distribution with the identity link, the ${\chi}^{2}$ and $F$-tests based on the deviance are only approximate; also, the estimates of the parameters will only be approximately Normally distributed. Thus, only approximate $z$- or $t$-tests may be performed on the parameter values and approximate confidence intervals computed.
The estimates are found by using an iterative weighted least squares procedure. This is equivalent to the Fisher scoring method in which the Hessian matrix used in the Newton–Raphson method is replaced by its expected value. In the case of canonical links, the Fisher scoring method and the Newton–Raphson method are identical. Starting values for the iterative procedure are obtained by replacing the ${\mu}_{i}$ by ${y}_{i}$ in the appropriate equations.
2.6Linear Mixed Effects Regression
In a standard linear model, the independent (or explanatory) variables are assumed to take the same set of values for all units in the population of interest. This type of variable is called fixed. In contrast, an independent variable that fluctuates over the different units is said to be random. Modelling a variable as fixed allows conclusions to be drawn only about the particular set of values observed. Modelling a variable as random allows the results to be generalized to the different levels that may have been observed. In general, if the effects of the levels of a variable are thought of as being drawn from a probability distribution of such effects then the variable is random. If the levels are not a sample of possible levels then the variable is fixed. In practice many qualitative variables can be considered as having fixed effects and most blocking, sampling design, control and repeated measures as having random effects.
In a general linear regression model, defined by
$$y=X\beta +\epsilon $$
where
$y$ is a vector of $n$ observations on the dependent variable,
$X$ is an $n\times p$ design matrix of independent variables,
$\beta $ is a vector of $p$ unknown parameters,
and
$\epsilon $ is a vector of $n$, independent and identically distributed, unknown errors, with
$\epsilon ~N(0,{\sigma}^{2})$,
there are $p$fixed effects (the $\beta $) and a single random effect (the error term $\epsilon $).
An extension to the general linear regression model that allows for additional random effects is the linear mixed effects regression model, (sometimes called the variance components model). One parameterisation of a linear mixed effects model is
$$y=X\beta +Z\nu +\epsilon $$
where
$y$ is a vector of $n$ observations on the dependent variable,
$X$ is an $n\times p$ design matrix of fixed independent variables,
$\beta $ is a vector of $p$ unknown fixed effects,
$Z$ is an $n\times q$ design matrix of random independent variables,
$\nu $ is a vector of length $q$ of unknown random effects,
$\epsilon $ is a vector of length $n$ of unknown random errors,
and $\nu $ and $\epsilon $ are normally distributed with expectation zero and variance / covariance matrix defined by
The routines currently available in this chapter are restricted to cases where
$R={\sigma}_{R}^{2}I$,
$I$ is the $n\times n$ identity matrix and $G$ is a diagonal matrix. Given this restriction the random variables, $Z$, can be subdivided into $g\le q$ groups containing one or more variables. The variables in the $i$th group are identically distributed with expectation zero and variance ${\sigma}_{i}^{2}$. The model, therefore, contains three sets of unknowns, the fixed effects, $\beta $, the random effects, $\nu $, and a vector of $g+1$ variance components, $\gamma $, with $\gamma =\{{\sigma}_{1}^{2},{\sigma}_{2}^{2},\dots ,,,{\sigma}_{g-1}^{2},{\sigma}_{g}^{2},{\sigma}_{R}^{2}\}$. Rather than work directly with $\gamma $ and the full likelihood function, $\gamma $ is replaced by ${\gamma}^{*}=\{{\sigma}_{1}^{2}/{\sigma}_{R}^{2},{\sigma}_{2}^{2}/{\sigma}_{R}^{2},\dots ,{\sigma}_{g-1}^{2}/{\sigma}_{R}^{2},{\sigma}_{g}^{2}/{\sigma}_{R}^{2},1\}$ and the profiled likelihood function is used instead.
The model parameters are estimated using an iterative method based on maximizing either the restricted (profiled) likelihood function or the (profiled) likelihood functions. Fitting the model via restricted maximum likelihood involves maximizing the function
$$V=ZG{Z}^{\mathrm{T}}+R\text{, \hspace{1em}}r=y-Xb\text{\hspace{1em} and \hspace{1em}}b={\left({X}^{\mathrm{T}}{V}^{-1}X\right)}^{-1}{X}^{\mathrm{T}}{V}^{-1}y\text{.}$$
Once the final estimates for ${\gamma}^{*}$ have been obtained, the value of ${\sigma}_{R}^{2}$ is given by
Case weights, ${W}_{c}$, can be incorporated into the model by replacing ${X}^{\mathrm{T}}X$ and ${Z}^{\mathrm{T}}Z$ with ${X}^{\mathrm{T}}{W}_{c}X$ and ${Z}^{\mathrm{T}}{W}_{c}Z$ respectively, for a diagonal weight matrix ${W}_{c}$.
2.7Quantile Regression
Quantile regression is related to least squares regression in that both are interested in studying the relationship between a response variable and one or more independent or explanatory variables. However, whereas least squares regression is concerned with modelling the conditional mean of the dependent variable, quantile regression models the conditional $\tau $th quantile of the dependent variable, for some value of $\tau \in (0,1)$. So, for example, $\tau =0.5$ would be the median.
Throughout this section we will be making use of the following definitions:
(a)If $Z$ is a real valued random variable with distribution function $F$ and density function $f$, such that
(b)$I\left(L\right)$ denotes an indicator function taking the value $1$ if the logical expression $L$ is true and 0 otherwise, e.g., $I(z<0)=1$ if $z<0$ and $0$ if $z\ge 0$.
(c)$y$ denotes a vector of $n$ observations on the dependent (or response) variable, $y=\{{y}_{i}:i=1,2,\dots ,n\}$.
(d)$X$ denotes an $n\times p$ matrix of explanatory or independent variables, often referred to as the design matrix, and ${x}_{i}$ denotes a column vector of length $p$ which holds the $i$th row of $X$.
2.7.1Finding a sample quantile as an optimization problem
hence
$\alpha ={F}^{-1}\left(\tau \right)$
when the solution is unique. If the solution is not unique then there exists a range of quantiles, each of which is equally valid. Taking the smallest value of such a range ensures that the empirical quantile function is left-continuous. Therefore, obtaining the $\tau $th quantile of a distribution $F$ can be achieved by minimizing the expected value of the loss function ${\rho}_{\tau}$.
This idea of obtaining the quantile by solving an optimization problem can be extended to finding the $\tau $th sample quantile. Given a vector of $n$ observed values, $y$, from some distribution the empirical distribution function, ${F}_{n}\left(\alpha \right)={n}^{-1}{\displaystyle \sum _{\mathit{i}=1}^{n}}I({y}_{i}\le \alpha )$ provides an estimate of the unknown distribution function $F$ giving an expected loss of
and, therefore, the problem of finding the $\tau $th sample quantile, $\hat{\alpha}\left(\tau \right)$, can be expressed as finding the solution to the problem
This result leads to least squares regression where, given design matrix $X$ and defining the conditional mean of $y$ as $\mu \left(X\right)=X\beta $, an estimate of $\beta $ is obtained from the solution to
Quantile regression can be derived in a similar manner by specifying the $\tau $th conditional quantile as ${Q}_{y}\left(\tau \right|X)=X\beta \left(\tau \right)$ and estimating $\beta \left(\tau \right)$ as the solution to
2.7.3Quantile regression as a linear programming problem
By introducing $2n$ slack variables, $u=\{{u}_{i}:i=1,2,\dots ,n\}$ and $v=\{{u}_{i}:i=1,2,\dots ,n\}$, the quantile regression minimization problem, (10), can be expressed as a Linear Programming (LP) problem, with primal and associated dual formulations:
where $e$ is a vector of length $n$, where each element is $1$.
If ${r}_{i}$ denotes the $i$th residual, ${r}_{i}={y}_{i}-{x}_{i}^{\mathrm{T}}\beta $, then the slack variables, $(u,v)$, can be thought as corresponding to the absolute value of the positive and negative residuals respectively with
$$\underset{d}{\mathrm{maximize}}\phantom{\rule{0.25em}{0ex}}{y}^{\mathrm{T}}d\text{ \hspace{1em} subject to \hspace{1em}}{X}^{\mathrm{T}}d=0,d\in {[\tau -1,\tau ]}^{n}$$
which, on setting $a=d+(1-\tau )e$, is equivalent to
$$\underset{a}{\mathrm{maximize}}\phantom{\rule{0.25em}{0ex}}{y}^{\mathrm{T}}a\text{ \hspace{1em} subject to \hspace{1em}}{X}^{\mathrm{T}}a=(1-\tau ){X}^{\mathrm{T}}e,a\in {[0,1]}^{n}\text{.}$$
(12)
(c)Canonical form
Linear programming problems are often described in a standard way, called the canonical form. The canonical form of an LP problem is
$$\underset{z}{\mathrm{minimize}}\phantom{\rule{0.25em}{0ex}}{c}^{\mathrm{T}}z\text{ \hspace{1em} subject to \hspace{1em}}{l}_{l}\le \left\{\begin{array}{c}z\\ Az\end{array}\right\}\le {l}_{u}\text{.}$$
Letting ${0}_{p}$ denote a vector of $p$ zeros $\pm {\infty}_{p}$ denote a vector of $p$ arbitrarily small or large values, ${I}_{n\times n}$ denote the $n\times n$ identity matrix, $c=\{a,b\}$ denote the row vector constructed by concatenating the elements of vector $b$ to the elements of vector $a$ and $C=[A,B]$ denote the matrix constructed by concatenating the columns of matrix $B$ onto the columns of matrix $A$ then setting
gives the quantile regression LP problem as described in (11).
Once expressed as an LP problem the parameter estimates $\hat{\beta}\left(\tau \right)$ can be obtained in a number of ways, for example via the inertia-controlling method of Gill and Murray (1978) (see e04mff/e04mfa), the simplex method or an interior point method as used by g02qffandg02qgf.
2.7.4Estimation of the covariance matrix
Koenker (2005) shows that the limiting covariance matrix of
$\sqrt{n}(\hat{\beta}\left(\tau \right)-\beta \left(\tau \right))$ is of the form of a Huber Sandwich. Therefore, under the assumption of Normally distributed errors
and
${f}_{i}\left({Q}_{{y}_{i}}\left(\tau \right|{x}_{i})\right)$
denotes the conditional density of the response $y$ evaluated at the $\tau $th conditional quantile.
More generally, the asymptotic covariance matrix for
$\hat{\beta}\left({\tau}_{1}\right),\hat{\beta}\left({\tau}_{1}\right),\dots ,\hat{\beta}\left({\tau}_{n}\right)$
has blocks defined by
for some bandwidth parameter ${c}_{n}$ satisfying $\underset{n\to \infty}{\mathrm{lim}}}\phantom{\rule{0.25em}{0ex}}{c}_{n}\to 0$ and $\underset{n\to \infty}{\mathrm{lim}}}\phantom{\rule{0.25em}{0ex}}\sqrt{n}{c}_{n}\to \infty $ and Hendricks and Koenker (1991) suggest a method based on an extension of the idea of sparsity.
Rather than use an asymptotic estimate of the covariance matrix, it is also possible to use bootstrapping. Roughly speaking the original data is resampled and a set of parameter estimates obtained from each new sample. A sample covariance matrix is then constructed from the resulting matrix of parameter estimates.
2.8Latent Variable Methods
Regression by means of projections to latent structures also known as partial least squares, is a latent variable linear model suited to data for which:
the number of $x$-variables is high compared to the number of observations;
$x$-variables and/or $y$-variables are multicollinear.
Latent variables are linear combinations of $x$-variables that explain variance in $x$ and $y$-variables. These latent variables, known as factors, are extracted iteratively from the data. A choice of the number of factors to include in a model can be made by considering diagnostic statistics such as the variable influence on projections (VIP).
2.9LARS, LASSO and Forward Stagewise Regression
Least Angle Regression (LARS), Least Absolute Shrinkage Selection Operator (LASSO) and forward stagewise regression are three closely related regression techniques. Of the three, only LASSO has an easily accessible mathematical description suitable for being summarised here. A full description of the all three methods and the relationship between them can be found in Efron et al. (2004) and the references therein.
Given a vector of $n$ observed values,
$y=\{{y}_{i}:i=1,2,\dots ,n\}$ and an $n\times p$ design matrix $X$, where the $j$th column of $X$, denoted ${x}_{j}$, is a vector of length $n$ representing the $j$th independent variable ${x}_{j}$, standardized such that
$\sum _{\mathit{i}=1}^{n}}{x}_{ij}=0$, and
$\sum _{\mathit{i}=1}^{n}}{x}_{ij}^{2}=1$ and a set of model parameters $\beta $ to be estimated from the observed values, the LASSO model of Tibshirani (1996) is given by
for a given value of $t$, where $\alpha =\overline{y}={n}^{\mathrm{-1}}{\displaystyle \sum _{\mathit{i}=1}^{n}}{y}_{i}$. The positive LASSO model is the same as the standard LASSO model, given above, with the added constraint that
Rather than solve (15) for a given value of $t$, Efron et al. (2004) defined an algorithm that returns a full solution path for all possible values of $t$. It turns out that this path is piecewise linear with a finite number of pieces, denoted $K$, corresponding to $K$ sets of parameter estimates.
3Recommendations on Choice and Use of Available Routines
3.1Correlation
3.1.1Product-moment correlation
Let ${\mathit{SS}}_{x}$ be the sum of squares of deviations from the mean, $\overline{x}$, for the variable $x$ for a sample of size $n$, i.e.,
and let ${\mathit{SC}}_{xy}$ be the cross-products of deviations from the means, $\overline{x}$ and $\overline{y}$, for the variables $x$ and $y$ for a sample of size $n$, i.e.,
g02baf computes the product-moment correlation coefficients.
g02btf updates the sample sums of squares and cross-products and deviations from the means by the addition/deletion of a (weighted) observation.
g02buf computes the sample sums of squares and cross-products deviations from the means (optionally weighted). The output from multiple calls to g02buf can be combined via a call to g02bzf, allowing large datasets to be summarised across multiple processing units.
g02bwf computes the product-moment correlation coefficients from the sample sums of squares and cross-products of deviations from the means.
The three routines compute only the upper triangle of the correlation matrix which is stored in a one-dimensional array in packed form.
g02bxf computes both the (optionally weighted) covariance matrix and the (optionally weighted) correlation matrix. These are returned in two-dimensional arrays. (Note that g02btfandg02buf can be used to compute the sums of squares from zero.)
g02bgf can be used to calculate the correlation coefficients for a subset of variables in the data matrix.
3.1.2Product-moment correlation with missing values
If there are missing values then g02bufandg02bxf, as described above, will allow casewise deletion giving the observation zero weight (compared with unit weight for an otherwise unweighted computation).
Other routines also handle missing values in the calculation of unweighted product-moment correlation coefficients. Casewise exclusion of missing values is provided by g02bbf while pairwise omission of missing values is carried out by g02bcf. These two routines calculate a correlation matrix for all the variables in the data matrix; similar output but for only a selected subset of variables is provided by routines g02bhfandg02bjf respectively. As well as providing the Pearson product-moment correlation coefficients, these routines also calculate the means and standard deviations of the variables, and the matrix of sums of squares and cross-products of deviations from the means. For all four routines you are free to select appropriate values for consideration as missing values, bearing in mind the nature of the data and the possible range of valid values. The missing values for each variable may be either different or alike and it is not necessary to specify missing values for all the variables.
3.1.3Nonparametric correlation
There are five routines which perform nonparametric correlations, each of which is capable of producing both Spearman's rank order and Kendall's tau correlation coefficients. The basic underlying concept of both these methods is to replace each observation by its corresponding rank or order within the observations on that variable, and the correlations are then calculated using these ranks.
It is obviously more convenient to order the observations and calculate the ranks for a particular variable just once, and to store these ranks for subsequent use in calculating all coefficients involving that variable; this does however require an amount of store of the same size as the original data matrix, which in some cases might be excessive. Accordingly, some routines calculate the ranks only once, and replace the input data matrix by the matrix of ranks, which are then also made available to you on exit from the routine, while others preserve the data matrix and calculate the ranks a number of times within the routine; the ranks of the observations are not provided as output by routines which work in the latter way. If it is possible to arrange the program in such a way that the first technique can be used, then efficiency of timing is achieved with no additional storage, whereas in the second case, it is necessary to have a second matrix of the same size as the data matrix, which may not be acceptable in certain circumstances; in this case it is necessary to reach a compromise between efficiency of time and of storage, and this may well be dependent upon local conditions.
Routines g02bnfandg02bqf both calculate Kendall's tau and/or Spearman's rank order correlation coefficients taking no account of missing values; g02bnf does so by calculating the ranks of each variable only once, and replacing the data matrix by the matrix of ranks, whereas g02bqf calculates the ranks of each variable several times. Routines g02bpfandg02brf provide the same output but treat missing values in a ‘casewise’ manner (see above); g02bpf calculates the ranks of each variable only once, and overwrites the data matrix of ranks, while g02brf determines the ranks of each variable several times. For ‘pairwise’ omission of missing data (see above), the routine g02bsf provides Kendall and/or Spearman coefficients.
Since g02bnfandg02bpf order the observations and calculate the ranks of each variable only once, then if there are $M$ variables involved, there are only $M$ separate ‘ranking’ operations; this should be contrasted with the method used by routines g02bqfandg02brf which perform $M(M-1)/2+1$ similar ranking operations. These ranking operations are by far the most time-consuming parts of these nonparametric routines, so for a matrix of as few as five variables, the time taken by one of the slower routines can be expected to be at least a factor of two slower than the corresponding efficient routine; as the number of variables increases, so this relative efficiency factor increases. Only one routine, g02bsf, is provided for pairwise missing values, and this routine carries out $M(M-1)$ separate rankings; since by the very nature of the pairwise method it is necessary to treat each pair of variables separately and rank them individually, it is impossible to reduce this number of operations, and so no alternative routine is provided.
3.1.4Partial correlation
g02byf computes a matrix of partial correlation coefficients from the correlation coefficients or variance-covariance matrix returned by g02bxf.
3.1.5Robust correlation
g02hlfandg02hmf compute robust estimates of the variance-covariance matrix by solving the equations
as described in Section 2.1.4 for user-supplied functions $w$ and $u$. Two options are available for $v$, either $v\left(t\right)=1$ for all $t$ or $v\left(t\right)=u\left(t\right)$.
g02hmf requires only the function $w$ and $u$ to be supplied while g02hlf also requires their derivatives. In general, g02hlf will be considerably faster than g02hmf and should be used if derivatives are available.
g02hkf computes a robust variance-covariance matrix for the following functions:
These functions solve a minimax space problem considered by Huber (1981). The values of ${a}_{u}$, ${b}_{u}$ and ${c}_{w}$ are calculated from the fraction of gross errors; see Hampel et al. (1986) and Huber (1981).
To compute a correlation matrix from the variance-covariance matrix g02bwf may be used.
3.1.6Nearest correlation matrix
A number of routines are provided to calculate a nearest correlation matrix. The choice of routine will depend on what definition of ‘nearest’ is required and whether there is any particular structure desired in the resulting correlation matrix.
g02aaf computes the nearest correlation matrix in the Frobenius norm, using the method of Qi and Sun (2006), modified by Borsdorf and Higham (2010). An extension to this routine is g02abf which allows a row and column weighted Frobenius norm to be used as well as a bound on the minimum eigenvalue of the resulting correlation matrix to be specified. If a low-rank correlation matrix is required to constrain the number of independent random variables, g02akf can be used to find a nearest correlation matrix of maximum prescribed rank.
If fixing of individual elements is needed then g02asf can be used, which implements the alternating projection algorithm of Higham and Strabić (2016). If only elementwise weighting is required g02ajf can be used. Both of these routines again compute the nearest correlation matrix in the Frobenius norm and provide a bound on the eigenvalues. It should be noted, that these routines can be computationally expensive. If computational time needs to be minimized, you should consider a shrinking algorithm.
g02anf uses the shrinking method of Higham et al. (2014) to fix the leading block of the input. However, it does not compute the nearest correlation matrix in the Frobenius norm but finds the smallest relative perturbation to the unfixed elements to give a positive definite output. This functionality is extended in g02apf which allows an arbitrary target matrix to be specified via elementwise weights.
If a low-rank correlation matrix is required to constrain the number of independent random variables, g02akf can be used to find a nearest correlation matrix of maximum prescribed rank.
g02aef computes the factor loading matrix, allowing a correlation matrix with a $k$-factor structure to be computed.
See also the NAG optimization modelling suite in Chapter E04 which can be used to solve a variety of nearest correlation matrix problems. See for example Section 10 in e04rff.
3.2Regression
3.2.1Simple linear regression
Four routines are provided for simple linear regressions: g02cafandg02ccf perform the simple linear regression with a constant term (equation (1) above), while g02cbfandg02cdf fit the simple linear regression with no constant term (equation (2) above). Two of these routines, g02ccfandg02cdf, take account of missing values, which the others do not. In these two routines, an observation is omitted if it contains a missing value for either the dependent or the independent variable; this is equivalent to both the casewise and pairwise methods, since both are identical when there are only two variables involved. Input to these routines consists of the raw data, and output includes the coefficients, their standard errors and $t$ values for testing the significance of the coefficients; the $F$ value for testing the overall significance of the regression is also given.
3.2.2Ridge regression
g02kaf calculates a ridge regression, optimizing the ridge parameter according to one of four prediction error criteria.
g02kbf calculates ridge regressions for a given set of ridge parameters.
3.2.3Polynomial regression and nonlinear regression
No routines are currently provided in this chapter for polynomial regression. If you wish to perform polynomial regressions you have three alternatives: you can use the multiple linear regression routines, g02daf, with a set of independent variables which are in fact simply the same single variable raised to different powers, or you can use the routine g04eaf to compute orthogonal polynomials which can then be used with g02daf, or you can use the routines in Chapter E02 (Curve and Surface Fitting) which fit polynomials to sets of data points using the techniques of orthogonal polynomials. This latter course is to be preferred, since it is more efficient and liable to be more accurate, but in some cases more statistical information may be required than is provided by those routines, and it may be necessary to use the routines of this chapter.
More general nonlinear regression models may be fitted using the optimization routines in Chapter E04, which contains routines to minimize the function
$$\sum _{i=1}^{n}{e}_{i}^{2}$$
where the regression parameters are the variables of the minimization problem.
3.2.4${\mathit{l}}_{\mathit{\infty}}$ norm (the absolutely largest residual) regression
No routines are currently provided in this chapter for regression using the ${l}_{\infty}$ norm (the absolutely largest residual) regression, however, such a model can be fit using e02gcf, which calculates an ${l}_{\infty}$ solution to the overdetermined system of equations
$$X\beta =y\text{.}$$
That is to say, it calculates a vector $\beta $, with $p$ elements, which minimizes the ${l}_{\infty}$ norm of the residuals (the absolutely largest residual)
3.2.5Multiple linear regression – general linear model
g02daf fits a general linear regression model using the $QR$ method and an SVD if the model is not of full rank. The results returned include: residual sum of squares, parameter estimates, their standard errors and variance-covariance matrix, residuals and leverages. There are also several routines to modify the model fitted by g02daf and to aid in the interpretation of the model.
g02dcf adds or deletes an observation from the model.
g02ddf computes the parameter estimates, and their standard errors and variance-covariance matrix for a model that is modified by g02dcf,g02deforg02dff.
g02dgf fits the regression to a new dependent variable, i.e., keeping the same independent variables.
g02dkf calculates the estimates of the parameters for a given set of constraints, (e.g., parameters for the levels of a factor sum to zero) for a model which is not of full rank and the SVD has been used.
g02dnf calculates the estimate of an estimable function and its standard error.
Note:g02def also allows you to initialize a model building process and then to build up the model by adding variables one at a time.
If you wish to use methods based on forming the cross-products/correlation matrix (i.e., (${X}^{\mathrm{T}}X$) matrix) rather than the recommended use of g02daf then the following routines should be used.
For regression through the origin (i.e., no constant) g02chf preceded by:
g02bjf* (pairwise missing values, subset of variables)
Note that the four routines using pairwise deletion of missing value (marked with $*$) should be used with great caution as the use of this method can lead to misleading results, particularly if a significant proportion of values are missing.
Both g02cgfandg02chf require that the correlations/sums of squares involving the dependent variable must appear as the last row/column. Because the layout of the variables in your data array may not be arranged in this way, two routines, g02cefandg02cff, are provided for rearranging the rows and columns of vectors and matrices. g02cff simply reorders the rows and columns while g02cef forms smaller vectors and matrices from larger ones.
Output from g02cgfandg02chf consists of the coefficients, their standard errors, ${R}^{2}$-values, $t$ and $F$ statistics.
3.2.6Selecting regression models
To aid the selection of a regression model the following routines are available.
g02eaf computes the residual sums of squares for all possible regressions for a given set of dependent variables. The routine allows some variables to be forced into all regressions.
g02ecf computes the values of ${R}^{2}$ and ${C}_{p}$ from the residual sums of squares as provided by g02eaf.
g02eef enables you to fit a model by forward selection. You may call g02eef a number of times. At each call the routine will calculate the changes in the residual sum of squares from adding each of the variables not already included in the model, select the variable which gives the largest change and then if the change in residual sum of squares meets the given criterion will add it to the model.
g02eff uses a full stepwise selection to choose a subset of the explanatory variables. The method repeatedly applies a forward selection step followed by a backward elimination step until neither step updates the current model.
3.2.7Residuals
g02faf computes the following standardized residuals and measures of influence for the residuals and leverages produced by g02daf:
(i)Internally studentized residual;
(ii)Externally studentized residual;
(iii)Cook's $D$ statistic;
(iv)Atkinson's $T$ statistic.
g02fcf computes the Durbin–Watson test statistic and bounds for its significance to test for serial correlation in the errors, ${e}_{i}$.
3.2.8Robust regression
For robust regression using $M$-estimates instead of least squares the routine g02haf will generally be suitable. g02haf provides a choice of four $\psi $-functions (Huber's, Hampel's, Andrew's and Tukey's) plus two different weighting methods and the option not to use weights. If other weights or different $\psi $-functions are needed the routine g02hdf may be used. g02hdf requires you to supply weights, if required, and also routines to calculate the $\psi $-function and, optionally, the $\chi $-function. g02hbf can be used in calculating suitable weights. The routine g02hff can be used after a call to g02hdf in order to calculate the variance-covariance estimate of the estimated regression coefficients.
For robust regression, using least absolute deviation, e02gaf can be used.
3.2.9Generalized linear models
There are four routines for fitting generalized linear models. The output includes: the deviance, parameter estimates and their standard errors, fitted values, residuals and leverages.
While g02gaf can be used to fit linear regression models (i.e., by using an identity link) this is not recommended as g02daf will fit these models more efficiently. g02gcf can be used to fit log-linear models to contingency tables.
In addition to the routines to fit the models there is one routine to predict from the fitted model and two routines to aid interpretation when the fitted model is not of full rank, i.e., aliasing is present.
g02gpf computes a predicted value and its associated standard error based on a previously fitted generalized linear model.
g02gkf computes parameter estimates for a set of constraints, (e.g., sum of effects for a factor is zero), from the SVD solution provided by the fitting routine.
g02gnf calculates an estimate of an estimable function along with its standard error.
3.2.10Linear mixed effects regression
Fitting a linear mixed effects regression model is split into three stages: model specification, data pre-processing and model fitting.
The model is specified using the modelling language described in Chapter G22. The fixed and random parts of the model are specified via one or more calls to g22yaf.
Prior to pre-processing the data, the dataset must first be described via a call to g22ybf. The description of the model and dataset is then passed to g02jff, along with the raw data, for pre-processing. For large problems it is possible to split the dataset up into smaller subsets of data, pre-processing each one separately and then combining the results using g02jgf.
Finally the model can be fit, either via maximum likelihood (ML) or restricted maximum likelihood (REML) using g02jhf. Labels for the various parameter estimates can be obtained using g22ydf.
The model specification routine, g22yaf, data description routine, g22ybf and model fitting routine g02jhf, have a number of optional parameters which can be set via g22zmf and queried using g22znf.
As the estimates of the variance components are found using an iterative procedure initial values must be supplied for each $\sigma $. In all four routines you can either specify these initial values or allow the routine to calculate them from the data using minimum variance quadratic unbiased estimation (MIVQUE0). Setting the maximum number of iterations to zero in any of the routines will return the corresponding likelihood, parameter estimates, and standard errors based on these initial values.
The library contains a number of older routines for fitting linear mixed effects regression models, specifically g02jaf, g02jbf, g02jdf and g02jef. Whilst the algorithmic details may vary the functionality of these routines is identical to that supplied by g02jhf, however g02jhf allows the model to be specified in a more intuitive way. These older routines have been deprecated and remain in the library only for backwards compatibility, it is, therefore, recommended that you use the newer routines going forward.
3.2.11Linear quantile regression
Two routines are provided for performing linear quantile regression, g02qffandg02qgf. Of these, g02qff provides a simplified interface to g02qgf, where many of the input parameters have been given default values and the amount of output available has been reduced.
Prior to calling g02qgf the optional parameter array must be initialized by calling g02zkf with optstr set to Initialize. Once these arrays have been initialized g02zlf can be called to query the value of an optional parameter.
3.2.12Partial Least Squares (PLS)
g02laf calculates a nonlinear, iterative PLS by using singular value decomposition.
g02lbf calculates a nonlinear, iterative PLS by using Wold's method.
g02lcf calculates parameter estimates for a given number of PLS factors.
3.2.13LARS, LASSO and Forward Stagewise Regression
Two routines for fitting a LARS, LASSO or forward stagewise regression are supplied: g02mafandg02mbf. The difference between the two routines is in the way that the data, $X$ and $y$, are supplied. The first routine, g02maf takes $X$ and $y$ directly, whereas g02mbf takes the data in the form of the cross-products: ${X}^{\mathrm{T}}X$, ${X}^{\mathrm{T}}y$ and ${y}^{\mathrm{T}}y$. In most situations g02maf will be the recommended routine as the full data tends to be available. However, when there is a large number of observations (i.e., $n$ is large) it might be preferable to split the data into smaller blocks and process one block at a time. In such situations g02buf and g02bzf can be used to construct the required cross-products and g02mbf called to fit the required model.
Both g02mafandg02mbf return $K$ sets of parameter estimates, which, because of its piecewise linear nature, define the full LARS, LASSO or forward stagewise regression solution path. However, parameter estimates are sometimes required at points along the solution path that differ from those returned by g02mafandg02mbf, for example when performing a cross-validation. g02mcf will return the parameter estimates in such cases.
3.2.14Design Matrix Construction
Many of the routines in this chapter require a design matrix to be constructed. Rather than constructing this by hand routines from Chapter G22 may be used.
g22yaf can be used to specify a linear model via a formula string. This model specification, along with a description of the dataset returned from g22ybf, can then be passed to g22ycf to produce a design matrix suitable for use with many of the Chapter G02 regression routines. In addition, g22ydf can be used to obtain submodel information or labels for parameter estimates.
3.2.15Nonlinear Regression
Nonlinear regression is essentially a nonlinear optimization problem. This can be solved by the solver e04gnf from the NAG optimization modelling suite for general nonlinear data-fitting problems with constraints. This supports various forms of regression, including ${\ell}_{1}$, ${\ell}_{2}$ and ${\ell}_{\infty}$, and various forms of regularization including LASSO and ridge. As a general data fitting solver, e04gnf is also able to incorporate linear and nonlinear constraints on the model parameters.
5Auxiliary Routines Associated with Library Routine Arguments
g02efh
nagf_correg_linregm_fit_stepwise_sample_monfun See the description of the argument
monfun in g02eff.
g02hdz
nagf_correg_robustm_user_dummy_chi See the description of the argument
chi in g02hdf.
6 Withdrawn or Deprecated Routines
None.
7References
Atkinson A C (1986) Plots, Transformations and Regressions Clarendon Press, Oxford
Borsdorf R and Higham N J (2010) A preconditioned (Newton) algorithm for the nearest correlation matrix IMA Journal of Numerical Analysis30(1) 94–107
Churchman C W and Ratoosh P (1959) Measurement Definitions and Theory Wiley
Cook R D and Weisberg S (1982) Residuals and Influence in Regression Chapman and Hall
Draper N R and Smith H (1985) Applied Regression Analysis (2nd Edition) Wiley
Efron B, Hastie T, Johnstone I and Tibshirani R (2004) Least Angle Regression The Annals of Statistics (Volume 32)2 407–499
Gill P E and Murray W (1978) Numerically stable methods for quadratic programming Math. Programming14 349–372
Hammarling S (1985) The singular value decomposition in multivariate statistics SIGNUM Newsl.20(3) 2–25
Hampel F R, Ronchetti E M, Rousseeuw P J and Stahel W A (1986) Robust Statistics. The Approach Based on Influence Functions Wiley
Hays W L (1970) Statistics Holt, Rinehart and Winston
Hendricks W and Koenker R (1991) Hierarchical spline models for conditional quantiles and the demand for electricity Journal of the Maerican Statistical Association87 58–68
Higham N J and Strabić N (2016) Anderson acceleration of the alternating projections method for computing the nearest correlation matrix Numer. Algor.72 1021–1042
Higham N J, Strabić N and Šego V (2014) Restoring definiteness via shrinking, with an application to correlation matrices with a fixed block MIMS EPrint 2014.54 Manchester Institute for Mathematical Sciences, The University of Manchester, UK
Huber P J (1981) Robust Statistics Wiley
Kendall M G and Stuart A (1973) The Advanced Theory of Statistics (Volume 2) (3rd Edition) Griffin
Koenker R (2005) Quantile Regression Econometric Society Monographs, Cambridge University Press, New York
McCullagh P and Nelder J A (1983) Generalized Linear Models Chapman and Hall
Powell J L (1991) Estimation of monotonic regression models under quantile restrictions Nonparametric and Semiparametric Methods in Econometrics Cambridge University Press, Cambridge
Qi H and Sun D (2006) A quadratically convergent Newton method for computing the nearest correlation matrix SIAM J. Matrix AnalAppl29(2) 360–385
Searle S R (1971) Linear Models Wiley
Siegel S (1956) Non-parametric Statistics for the Behavioral Sciences McGraw–Hill
Tibshirani R (1996) Regression Shrinkage and Selection via the Lasso Journal of the Royal Statistics Society, Series B (Methodological) (Volume 58)1 267–288