Performance?

You do not have permission to edit this page, for the following reasons:

• The action you have requested is limited to users in the group: Users.
• You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

---

You can view and copy the source of this page.

Yes. Now this tree in battles against [[Diamond]] in average takes 56,800 ns for RS. I know that it's not completly correctly to compare them, but yours kD-Tree do kNN with same k in about 70,000-80,000 ns. RS & kNN are performed more than 3000 times with 30 trees with 1-5 dimensions and 0- ~3200 points.<br> I plan to try use RS with dinamically calculate hypercube side in gun, which, i hope will produce pretty equal results with kNN, and in this case i will publish comparsion of RS & kNN for gun Jdev

Return to Thread:User talk:Jdev/Code/R Tree/Performance?/reply.