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)

    “Do what you know you ought to do. Why should we ever go abroad, even across the way, to ask a neighbor’s advice? There is a nearer neighbor within us incessantly telling us how we should behave. But we wait for the neighbor without to tell us of some false, easier way.”
    —Henry David Thoreau (1817–1862)

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