The Nearest Neighbor Algorithm - Classes
The Nearest Neighbor Algorithm - Classes
The Nearest Neighbor Algorithm - Classes
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>The</strong> Curse of Noisy/Irrelevant Features<br />
• NN also breaks down when data contains irrelevant/noisy features.<br />
• Consider a 1-d problem where query x is at the origin, our nearest<br />
neighbor is x 1 at 0.1, and our second nearest neighbor is x 2 at 0.5.<br />
• Now add a uniformly random noisy feature.<br />
– P(||x 2 ’ - x||
Change language