I have a problem to solve with k nearest neighbor (kNN).
12 points are given in two dimensions, which belong to one of the two classes - and + as shown below. Which is the minimum value that k can...
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Search:Type: Posts; User: skalix Search: Search took 0.02 seconds.
Results 1 to 1 of 1
|
Click Here to Expand Forum to Full Width |