Categorizes values in a column according to a dictionary table with min/max values. The table at the first input contains a column with values to be categorized. The second table contains a column with lower bound values, a column with upper bound values and a column with label values. The latter will be used as outcome in case a given value is between the corresponding lower and upper bound. Each row in the second table represents a rule, whereby the rules are evaluated top-down, i.e. rules with low row index have higher priority than rules in the subsequent rows.
Either the lower or upper bound test can be disabled by unsetting the corresponding checkbox in the dialog. Missing values in the columns containing upper and lower bounds will always evaluate the bound check to true. That is, a missing value in the lower bound column will always be smaller and a missing value in the upper bound column will always be larger than the value. Missing values in the value column (1st input) will result in a missing cell output (no categorization).
Note: The table containing bound and label information (2nd input) will be read into memory during execution; it must be a relatively small table!
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 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.