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:

    “I never liked bananas much anyway. Two-thirds of the way down even one banana I am willing to concede defeat smilingly and give the rest to the nearest monkey.”
    —Robert Benchley (1889–1945)

    “A good neighbor is a very desireable thing.”
    —Thomas Jefferson (1743–1826)

    “The words of his mouth were smoother than butter, but war was in his heart: his words were softer than oil, yet were they drawn swords.
    Cast thy burden upon the Lord, and he shall sustain thee: he shall never suffer the righteous to be moved.”
    —Bible: Hebrew Psalm LV (l. LV, 21–22)