Kernel Smoother - Nearest Neighbor Smoother

Nearest Neighbor Smoother

The idea of the nearest neighbor smoother is the following. For each point X0, take m nearest neighbors and estimate the value of Y(X0) by averaging the values of these neighbors.

Formally, where is the mth closest to X0 neighbor, and

D(t)= \begin{cases} 1/m & \text{if } |t| \le 1 \\ 0 & \text{otherwise} \end{cases}

Example:

In this example, X is one-dimensional. For each X0, the is an average value of 16 closest to X0 points (denoted by red). The result is not smooth enough.

Read more about this topic:  Kernel Smoother

Famous quotes containing the words nearest, neighbor and/or smoother:

    “The nearest the modern general or admiral comes to a small-arms encounter of any sort is at a duck hunt in the company of corporation executives at the retreat of Continental Motors, Inc.”
    —C. Wright Mills (1916–1962)

    “Mislike me not for my complexion,
    The shadowed livery of the burnished sun,
    To whom I am a neighbor and near bred.”
    —William Shakespeare (1564–1616)

    “For the lips of a loose woman drip honey, and her speech is smoother than oil; but in the end she is bitter as wormwood, sharp as a two-edged sword.”
    —Bible: Hebrew, Proverbs 5:3.