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:

    “This avidity alone, of acquiring goods and possessions for ourselves and our nearest friends, is insatiable, perpetual, universal, and directly destructive of society.”
    —David Hume (1711–1776)

    “Seducing one’s neighbor to a good opinion and then afterwards believing devoutly in this neighbor’s opinion—who can match women in this clever ploy?”
    —Friedrich Nietzsche (1844–1900)

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