Note that for the Euclidean distance on numeric columns the other K Nearest Neighbor node performs better as it uses an efficient index structure. The implementation of this node performs an exhaustive search of all points to all potential neighbors and is therefore suited for small to medium data sets only.
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.
A zipped version of the software site can be downloaded here.
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to firstname.lastname@example.org, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.