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, chrisef
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.
Aled.
Log in to post a comment.
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,
chrisef
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.
Aled.