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:

    “Yet do I fear thy nature,
    It is too full o’th’ milk of human kindness
    To catch the nearest way.”
    —William Shakespeare (1564–1616)

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

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