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:

    “Then with no fiery throbbing pain,
    No cold gradations of decay,
    Death broke at once the vital chain,
    And freed his soul the nearest way.”
    —Samuel Johnson (1709–1784)

    “I do not like forced integration.... I do not like forced anything.... as a youngster I lived in a white neighborhood with a white neighbor next door. We would go to them, they would go to us. If they had anything, we had it. We lived just like one. We didn’t think about no integration.”
    —Ruby Middleton Forsythe (b. 1905)

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