smooth.construct.mrf.smooth.spec {mgcv} | R Documentation

## Markov Random Field Smooths

### Description

For data observed over discrete spatial units, a simple Markov random field smoother is sometimes appropriate. These functions provide such a smoother class for `mgcv`.

### Usage

    ## S3 method for class 'mrf.smooth.spec'
    smooth.construct(object, data, knots)
    ## S3 method for class 'mrf.smooth'
    Predict.matrix(object, data)

### Arguments

`object` | For the `smooth.construct` method a smooth specification object, usually generated by a term `s(x,...,bs="mrf",xt=list(polys=foo))`. `x` is a factor variable giving labels for geographic districts, and the `xt` argument is obligatory: see details. For the `Predict.Matrix` method an object of class `"mrf.smooth"` produced by the `smooth.construct` method.
`data` | a list containing just the data (including any `by` variable) required by this term, with names corresponding to `object$term` (and `object$by`). The `by` variable is the last element.
`knots` | If there are more geographic areas than data were observed for, then this argument is used to provide the labels for all the areas (observed and unobserved).

### Details

A Markov random field smooth over a set of discrete areas is defined using a set of area labels, and a neighbourhood structure for the areas. The covariate of the smooth is the vector of area labels corresponding to each obervation. This covariate should be a factor, or capable of being coerced to a factor.

The neighbourhood structure is supplied in the `xt` argument to `s`. This must contain at least one of the elements `polys`, `nb` or `penalty`.

polys

  contains the polygons defining the geographic areas. It is a list with as many elements as there are geographic areas. `names(polys)` must correspond to the levels of the argument of the smooth, in any order (i.e. it gives the area labels). `polys[[i]]` is a 2 column matrix the rows of which specify the vertices of the polygon(s) defining the boundary of the ith area. A boundary may be made up of several closed loops: these must be separated by `NA` rows. A polygon within another is treated as a hole. The first polygon in any `polys[[i]]` should not be a hole. An example of the structure is provided by `columb.polys` (which contains an artificial hole in its second element, for illustration). Any list elements with duplicate names are combined into a single NA separated matrix.

  Plotting of the smooth is not possible without a `polys` object.

  If `polys` is the only element of `xt` provided, then the neighbourhood structure is computed from it automatically. To count as neigbours, polygons must exactly share one of more vertices.

nb

  is a named list defining the neighbourhood structure. `names(nb)` must correspond to the levels of the covariate of the smooth (i.e. the area labels), but can be in any order. `nb[[i]]` is a vector indexing the neighbours of the ith area. All indices are relative to `nb` itself, but can be translated using `names(nb)`.

  If no `penalty` is provided then it is computed automatically from this list. The ith row of the penalty matrix will be zero everwhere, except in the ith column, which will contain the number of neighbours of the ith geographic area, and the columns corresponding to those geographic neighbours, which will each contain -1.

penalty

  if this is supplied, then it is used as the penalty matrix. It should be positive semi-definite. Its row and column names should correspond to the levels of the covariate.

If no basis dimension is supplied then the constructor produces a full rank MRF, with a coefficient for each geographic area. Otherwise a low rank approximation is obtained based on truncation of the parameterization given in Wood (2006) Section 4.10.4.

Note that smooths of this class have a built in plot method, and that the utility function `in.out` can be useful for working with discrete area data. The plot method has two schemes, `scheme==0` is colour, `scheme==1` is grey scale.

### Value

An object of class `"mrf.smooth"` or a matrix mapping the coefficients of the MRF smooth to the predictions for the areas listed in `data`.

### Author(s)

Simon N. Wood simon.wood@r-project.org and Thomas Kneib (Fabian Scheipl prototyped the low rank MRF idea)

### References

Wood S.N. (2006) Generalized additive models: an intriduction with R CRC.

### See Also

`in.out`, `polys.plot`

### Examples

    library(mgcv)
    ## Load Columbus Ohio crime data (see ?columbus for details and credits)
    data(columb)       ## data frame
    data(columb.polys) ## district shapes list
    xt <- list(polys=columb.polys) ## neighbourhood structure info for MRF
    par(mfrow=c(2,2))
    ## First a full rank MRF...
    b <- gam(crime ~ s(district,bs="mrf",xt=xt),data=columb,method="REML")
    plot(b,scheme=1)
    ## Compare to reduced rank version...
    b <- gam(crime ~ s(district,bs="mrf",k=20,xt=xt),data=columb,method="REML")
    plot(b,scheme=1)
    ## An important covariate added...
    b <- gam(crime ~ s(district,bs="mrf",k=20,xt=xt)+s(income),
             data=columb,method="REML")
    plot(b,scheme=c(0,1))

    ## plot fitted values by district
    par(mfrow=c(1,1))
    fv <- fitted(b)
    names(fv) <- as.character(columb$district)
    polys.plot(columb.polys,fv)

[Package mgcv version 1.7-18 Index]