Creates a density model of a n-dimensional vector space, based on a kNN graph. The kNN graph is created by connecting each row with k rows closest (in terms of Euclidean distance) to it in the feature space (k is the specified number of neighbors). This way each row has at least k edges in the kNN graph, however there are two cases in which a row may have more than k edges:
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.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
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 email@example.com, 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.