TDSM 10.11
From The Data Science Design Manual Wikia
Revision as of 04:22, 10 December 2017 by Caitaozhan (talk | contribs) (knn classification all positive.)
(a)
Impossible.
Imagine a Voronoi diagram, where every cell contains exactly one target point. Each cell will occupy an area in the total space. So, of course, the negative points will occupy some area. If the new examples fall into those area occupied by negative point cells, then the new examples will be classified as negative.
(b)
Possible.
Consider this case, where there are only three negative points. Each of the negative points is surrounded by a bunch of positive points. When new examples arrive, there is obviously no way they can be classified as negative when k=3.
