k-NN and Node Splitting algorithms

  • chrisef

    chrisef - 2011-05-19

    Hello everyone,

    Which Nearest Neighbor and which Node Splitting algorithms are supported by jsi ?
    How easily can I extend the current implementations?

    Thank you in advance,

  • Aled Morris

    Aled Morris - 2011-07-20

    Hi Chrisef,

    The node splitting algorithm is the linear cost algorithm as described in Guttman's paper.

    The nearest neighbour algorithm is pretty trivial, and there is also a nearestN method that uses a priority queue.

    Personally I wouldn't try and 'extend' any of these algorithms, improving them would basically mean rewriting them.



Log in to post a comment.

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks