0
$\begingroup$

If I were to construct a KD tree representing a sufficiently dense space, could it be used as a decision tree by querying it for the nearest neighbor to the point to classify?

$\endgroup$
2
$\begingroup$

Yes, you can. The scheme you are thinking of is called the nearest-neighbors classifier. Read the link for more details. In many settings it turns out to be a quite effective classification algorithm.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.