The R Project SVN R

/*
 *  R : A Computer Langage for Statistical Data Analysis
 *  Copyright (C) 1996  Robert Gentleman and Ross Ihaka
 *  Copyright (C) 1999-2002   Robert Gentleman, Ross Ihaka and the
 *                            R Development Core Team
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA
 */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

#include <Rmath.h>      /* fmax2, imin2, imax2 */
#include <R_ext/Applic.h>   /* prototypes for lowess and clowess */
#include <R_ext/Boolean.h>
#include <R_ext/Utils.h>    /* rPsort() */
#ifdef DEBUG_lowess
# include <R_ext/Print.h>
#endif

static double fsquare(double x)
{
    return x * x;
}

static double fcube(double x)
{
    return x * x * x;
}

static void lowest(double *x, double *y, int n, double *xs, double *ys,
    int nleft, int nright, double *w,
    Rboolean userw, double *rw, Rboolean *ok)
{
    int nrt, j;
    double a, b, c, h, h1, h9, r, range;

    x--;
    y--;
    w--;
    rw--;

    range = x[n]-x[1];
    h = fmax2(*xs-x[nleft], x[nright]-*xs);
    h9 = 0.999*h;
    h1 = 0.001*h;

    /* sum of weights */

    a = 0.;
    j = nleft;
    while (j <= n) {

    /* compute weights */
    /* (pick up all ties on right) */

    w[j] = 0.;
    r = fabs(x[j] - *xs);
    if (r <= h9) {
        if (r <= h1)
        w[j] = 1.;
        else
        w[j] = fcube(1.-fcube(r/h));
        if (userw)
        w[j] *= rw[j];
        a += w[j];
    }
    else if (x[j] > *xs)
        break;
    j = j+1;
    }

    /* rightmost pt (may be greater */
    /* than nright because of ties) */

    nrt = j-1;
    if (a <= 0.)
    *ok = FALSE;
    else {
    *ok = TRUE;

    /* weighted least squares */
    /* make sum of w[j] == 1 */

    for(j=nleft ; j<=nrt ; j++)
        w[j] /= a;
    if (h > 0.) {
        a = 0.;

        /*  use linear fit */
        /* weighted center of x values */

        for(j=nleft ; j<=nrt ; j++)
        a += w[j] * x[j];
        b = *xs - a;
        c = 0.;
        for(j=nleft ; j<=nrt ; j++)
        c += w[j]*fsquare(x[j]-a);
        if (sqrt(c) > 0.001*range) {
        b /= c;

        /* points are spread out */
        /* enough to compute slope */

        for(j=nleft; j <= nrt; j++)
            w[j] *= (b*(x[j]-a) + 1.);
        }
    }
    *ys = 0.;
    for(j=nleft; j <= nrt; j++)
        *ys += w[j] * y[j];
    }
}

static
void clowess(double *x, double *y, int n,
         double f, int nsteps, double delta,
         double *ys, double *rw, double *res)
{
    int i, iter, j, last, m1, m2, nleft, nright, ns;
    Rboolean ok;
    double alpha, c1, c9, cmad, cut, d1, d2, denom, r;

    if (n < 2) {
    ys[0] = y[0]; return;
    }

    /* nleft, nright, last, etc. must all be shifted to get rid of these: */
    x--;
    y--;
    ys--;


    /* at least two, at most n points */
    ns = imax2(2, imin2(n, (int)(f*n + 1e-7)));
#ifdef DEBUG_lowess
    REprintf("lowess(): ns = %d\n", ns);
#endif

    /* robustness iterations */

    iter = 1;
    while (iter <= nsteps+1) {
    nleft = 1;
    nright = ns;
    last = 0;   /* index of prev estimated point */
    i = 1;      /* index of current point */

    for(;;) {
        if (nright < n) {

        /* move nleft,  nright to right */
        /* if radius decreases */

        d1 = x[i] - x[nleft];
        d2 = x[nright+1] - x[i];

        /* if d1 <= d2 with */
        /* x[nright+1] == x[nright], */
        /* lowest fixes */

        if (d1 > d2) {

            /* radius will not */
            /* decrease by */
            /* move right */

            nleft++;
            nright++;
            continue;
        }
        }

        /* fitted value at x[i] */

        lowest(&x[1], &y[1], n, &x[i], &ys[i],
           nleft, nright, res, iter>1, rw, &ok);
        if (!ok) ys[i] = y[i];

        /* all weights zero */
        /* copy over value (all rw==0) */

        if (last < i-1) {
        denom = x[i]-x[last];

        /* skipped points -- interpolate */
        /* non-zero - proof? */

        for(j = last+1; j < i; j++) {
            alpha = (x[j]-x[last])/denom;
            ys[j] = alpha*ys[i] + (1.-alpha)*ys[last];
        }
        }

        /* last point actually estimated */
        last = i;

        /* x coord of close points */
        cut = x[last]+delta;
        for (i = last+1; i <= n; i++) {
        if (x[i] > cut)
            break;
        if (x[i] == x[last]) {
            ys[i] = ys[last];
            last = i;
        }
        }
        i = imax2(last+1, i-1);
        if (last >= n)
        break;
    }
    /* residuals */
    for(i=0; i < n; i++)
        res[i] = y[i+1] - ys[i+1];

    /* compute robustness weights */
    /* except last time */

    if (iter > nsteps)
        break;
    /* Note: The following code, biweight_{6 MAD|Ri|} 
       is also used in stl(), loess and several other places.
       --> should provide API here (MM) */
    for(i=0 ; i<n ; i++)
        rw[i] = fabs(res[i]);

    /* Compute   cmad := 6 * median(rw[], n)  ---- */
    /* FIXME: We need C API in R for Median ! */
    m1 = n/2;
    /* partial sort, for m1 & m2 */
    rPsort(rw, n, m1);
    if(n % 2 == 0) {
        m2 = n-m1-1;
        rPsort(rw, n, m2);
        cmad = 3.*(rw[m1]+rw[m2]);
    } 
    else { /* n odd */
        cmad = 6.*rw[m1];
    }
#ifdef DEBUG_lowess
    REprintf("   cmad = %12g\n", cmad);
#endif
    c9 = 0.999*cmad;
    c1 = 0.001*cmad;
    for(i=0 ; i<n ; i++) {
        r = fabs(res[i]);
        if (r <= c1)
        rw[i] = 1.;
        else if (r <= c9)
        rw[i] = fsquare(1.-fsquare(r/cmad));
        else
        rw[i] = 0.;
    }
    iter++;
    }
}

void lowess(double *x, double *y, int *n,
        double *f, int *nsteps, double *delta,
        double *ys, double *rw, double *res)
{
    clowess(x, y, *n, *f, *nsteps, *delta, ys, rw, res);
}