Regression on a Graph

Details Regression on a Graph Regression on a Graph

2009-11-10

arxiv.org/abs/0911.1928v1

Statistics

Methodology

Scientific paper

The `Signal plus Noise' model for nonparametric regression can be extended to the case of observations taken at the vertices of a graph. This model includes many familiar regression problems. This article discusses the use of the edges of a graph to measure roughness in penalized regression. Distance between estimate and observation is measured at every vertex in the $L_2$ norm, and roughness is penalized on every edge in the $L_1$ norm. Thus the ideas of total-variation penalization can be extended to a graph. The resulting minimization problem presents special computational challenges, so we describe a new, fast algorithm and demonstrate its use with examples. Further examples include a graphical approach that gives an improved estimate of the baseline in spectroscopic analysis, and a simulation applicable to discrete spatial variation. In our example, penalized regression outperforms kernel smoothing in terms of identifying local extreme values. In all examples we use fully automatic procedures for setting the smoothing parameters.

Affiliated with

Also associated with

No associations

Rating

Regression on a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regression on a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regression on a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51613