This node finds (near)optimal fixed-sized subsets of rows based
one one or more criteria. It uses the
to find an approximation of the set of non-dominated solutions, i.e. the
In the dialogue you can choose which column from the input table should be optimized in which way. Each column represents an objective which - together with a function on that column, like sum of all values in the selected set or average distance of all values - can either be minimized or maximized. By default each objective is maximized , thus if you want to minimize negate the objective.
The node runs until a certain number of individuals have been evaluated. You can also stop the search manually in the node's view.
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.