Tie breaking in kNN

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view

Tie breaking in kNN


I have a confusion regarding the tie breaking condition implemented in Weka. Suppose we have taken k=3 and now the minimum distances from the predicted instance is same for four neighboring instances(for example d1, d2, d3, d4). Which three of them to choose? How it is decided in Weka?In which class/package the code for tie breaking condition has been implemented?
It would be nice if someone can answer this!

Thanks and Regards,
Arnab Sharma 

Sent with Mailtrack

Wekalist mailing list
Send posts to: [hidden email]
List info and subscription status: https://list.waikato.ac.nz/mailman/listinfo/wekalist
List etiquette: http://www.cs.waikato.ac.nz/~ml/weka/mailinglist_etiquette.html