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:

    “It is curious how there seems to be an instinctive disgust in Man for his nearest ancestors and relations. If only Darwin could conscientiously have traced man back to the Elephant or the Lion or the Antelope, how much ridicule and prejudice would have been spared to the doctrine of Evolution.”
    —Havelock Ellis (1859–1939)

    “The remarkable thing is that we really love our neighbor as ourselves: we do unto others as we do unto ourselves. We hate others when we hate ourselves. We are tolerant toward others when we tolerate ourselves. We forgive others when we forgive ourselves. We are prone to sacrifice others when we are ready to sacrifice ourselves.”
    —Eric Hoffer (1902–1983)

    “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.