http://scikit-learn.org/0.11/auto_examples/cluster/plot_dbscan.html I think u should go for any clustering Algorithm. Above is the link to one such Algorithm named DBSCAN.
On 10 March 2013 17:12, Registered user <[email protected]> wrote: > Problem statement : > Given N points of 2d Plane . you are required to find the k nearest > point to a given point. > > After some search i came to know that i need to implement KD tree , > but cannot understand how ?? > Note: Efficient algorithm required , not Brute force . > so if anyone can help me plz .. > > Thanks in advance :D > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
