World Library  
Flag as Inappropriate
Email this Article

Nonparametric regression

Article Id: WHEBN0004536068
Reproduction Date:

Title: Nonparametric regression  
Author: World Heritage Encyclopedia
Language: English
Subject: Polynomial regression, Errors and residuals, Nonlinear regression, Semiparametric regression, Regression analysis
Collection: Nonparametric Regression, Nonparametric Statistics, Regression Analysis
Publisher: World Heritage Encyclopedia

Nonparametric regression

Nonparametric regression is a form of regression analysis in which the predictor does not take a predetermined form but is constructed according to information derived from the data. Nonparametric regression requires larger sample sizes than regression based on parametric models because the data must supply the model structure as well as the model estimates.


  • Gaussian process regression or Kriging 1
  • Penalized least squares 2
    • Quadratic penalties 2.1
    • Lasso 2.2
  • Kernel regression 3
  • Nonparametric multiplicative regression 4
  • Regression trees 5
  • See also 6
  • References 7
  • Further reading 8
  • External links 9

Gaussian process regression or Kriging

In Gaussian process regression, also known as Kriging, a Gaussian prior is assumed for the regression curve. The errors are assumed to have a multivariate normal distribution and the regression curve is estimated by its posterior mode. The Gaussian prior may depend on unknown hyperparameters, which are usually estimated via empirical Bayes.

Smoothing splines have an interpretation as the posterior mode of a Gaussian process regression.

Penalized least squares

Quadratic penalties

Here the penalty term is proportional to the RKHS norm of the vector of regression coefficients.


The lasso is a form of penalized least squares, where the penalty term is proportional to the L1 norm of the vector of regression coefficients.

Kernel regression

Example of a curve (red line) fit to a small data set (black points) with nonparametric regression using a Gaussian kernel smoother. The pink shaded area illustrates the kernel function applied to obtain an estimate of y for a given value of x. The kernel function defines the weight given to each data point in producing the estimate for a target point.

Kernel regression estimates the continuous dependent variable from a limited set of data points by convolving the data points' locations with a kernel function—approximately speaking, the kernel function specifies how to "blur" the influence of the data points so that their values can be used to predict the value for nearby locations.

Nonparametric multiplicative regression

Two kinds of kernels used with kernel smoothers for nonparametric regression.
Use of Gaussian kernels for nonparametric multiplicative regression with two predictors. The weights from the kernel function for each predictor are multiplied to obtain a weight for a given data point in estimating a response variable (dependent variable) at a target point in the predictor space.
Two commonly used forms of a local model used in nonparametric regression, contrasted with a simple linear model.

Nonparametric multiplicative regression (NPMR) is a form of nonparametric regression based on multiplicative kernel estimation. Like other regression methods, the goal is to estimate a response (dependent variable) based on one or more predictors (independent variables). NPMR can be a good choice for a regression method if the following are true:

  1. The shape of the response surface is unknown.
  2. The predictors are likely to interact in producing the response; in other words, the shape of the response to one predictor is likely to depend on other predictors.
  3. The response is either a quantitative or binary (0/1) variable.

This is a smoothing technique that can be cross-validated and applied in a predictive way.

NPMR behaves like an organism

NPMR has been useful for modeling the response of an organism to its environment. Organismal response to environment tend to be nonlinear and have complex interactions among predictors. NPMR allows you to model automatically the complex interactions among predictors in much the same way that organisms integrate the numerous factors affecting their performance.[1]

A key biological feature of an NPMR model is that failure of an organism to tolerate any single dimension of the predictor space results in overall failure of the organism. For example, assume that a plant needs a certain range of moisture in a particular temperature range. If either temperature or moisture fall outside the tolerance of the organism, then the organism dies. If it is too hot, then no amount of moisture can compensate to result in survival of the plant. Mathematically this works with NPMR because the product of the weights for the target point is zero or near zero if any of the weights for individual predictors (moisture or temperature) are zero or near zero. Note further that in this simple example, the second condition listed above is probably true: the response of the plant to moisture probably depends on temperature and vice-versa.

Optimizing the selection of predictors and their smoothing parameters in a multiplicative model is computationally intensive. With a large pool of predictors, the computer must search through huge number of potential models in search for the best model. The best model has the best fit, subject to overfitting constraints or penalties (see below).[2][3]

The local model

NPMR can be applied with several different kinds of local models. By "local model" we mean the way that data points near a target point in the predictor space are combined to produce an estimate for the target point. The most common choices for the local models are the local mean estimator, a local linear estimator, or a local logistic estimator. In each case the weights can be extended multiplicatively to multiple dimensions.

In words, the estimate of the response is a local estimate (for example a local mean) of the observed values, each value weighted by its proximity to the target point in the predictor space, the weights being the product of weights for individual predictors. The model allows interactions, because weights for individual predictors are combined by multiplication rather than addition.

Overfitting Controls

Understanding and using these controls on overfitting is essential to effective modeling with nonparametric regression. Nonparametric regression models can become overfit either by including too many predictors or by using small smoothing parameters (also known as bandwidth or tolerance). This can make a big difference with special problems, such as small data sets or clumped distributions along predictor variables.

The methods for controlling overfitting differ between NPMR and the generalized linear modeling (GLMs). The most popular overfitting controls for GLMs are the AIC (Akaike Information Criterion) and the BIC (Bayesian Information Criterion) for model selection. The AIC and BIC depend on the number of parameters in a model. Because NPMR models do not have explicit parameters as such, these are not directly applicable to NPMR models. Instead, one can control overfitting by setting a minimum average neighborhood size, minimum data:predictor ratio, and a minimum improvement required to add a predictor to a model.

Nonparametric regression models sometimes use an AIC based on the "effective number of parameters".[4] This penalizes a measure of fit by the trace of the smoothing matrix—essentially how much each data point contributes to estimating itself, summed across all data points. If, however, you use leave-one-out cross validation in the model fitting phase, the trace of the smoothing matrix is always zero, corresponding to zero parameters for the AIC. Thus, NPMR with cross-validation in the model fitting phase already penalizes the measure of fit, such that the error rate of the training data set is expected to approximate the error rate in a validation data set. In other words, the training error rate approximates the prediction (extra-sample) error rate.

Related techniques

NPMR is essentially a smoothing technique that can be cross-validated and applied in a predictive way. Many other smoothing techniques are well known, for example smoothing splines and wavelets. Optimum choice of a smoothing method depends on the specific application.

Regression trees

Decision tree learning algorithms can be applied to learn to predict a dependent variable from data.[5] Although the original CART formulation applied only to predicting univariate data, the framework can be used to predict multivariate data including time series.[6]

See also


  1. ^ McCune, B. (2006). "Non-parametric habitat models with automatic interactions". Journal of Vegetation Science 17 (6): 819–830.  
  2. ^ Grundel, R.; Pavlovic, N. B. (2007). "Response of bird species densities to habitat structure and fire history along a Midwestern open–forest Gradient".  
  3. ^ DeBano, S. J.; Hamm, P. B.; Jensen, A.; Rondon, S. I.; Landolt, P. J. (2010). "Spatial and temporal dynamics of potato tuberworm (Lepidoptera: Gelechiidae) in the Columbia Basin of the Pacific Northwest". Environmental Entomology 39 (1): 1–14.  
  4. ^ Hastie, T.; Tibsharani, R.; Friedman, J. (2001). The Elements of Statistical Learning. New York: Springer. p. 205.  
  5. ^ Breiman, Leo; Friedman, J. H.; Olshen, R. A.; Stone, C. J. (1984). Classification and regression trees. Monterey, CA: Wadsworth & Brooks/Cole Advanced Books & Software.  
  6. ^ Segal, M.R. (1992). "Tree-structured methods for longitudinal data". Journal of the American Statistical Association 87 (418): 407–418.  

Further reading

  • Bowman, A. W.; Azzalini, A. (1997). Applied Smoothing Techniques for Data Analysis. Oxford: Clarendon Press.  
  • McCune, B. and M. J. Mefford (2009). HyperNiche. Nonparametric Multiplicative Habitat Modeling. Version 2. MjM Software, Gleneden Beach, Oregon, U.S.A.

External links

  • HyperNiche, software for nonparametric multiplicative regression.
  • Scale-adaptive nonparametric regression (with Matlab software).
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.