This node implements the CAIM binning (discretization) algorithm according to Kurgan and Cios (2004) URL:http://citeseer.ist.psu.edu/kurgan04caim.html. The binning (discretization) is performed with respect to a selected class column. CAIM creates all possible binning boundaries and chooses those that minimize the class interdependancy measure. To reduce the runtime, this implementation creates only those boundaries where the value and the class changes. The algorithm finds a minimum number of bins (guided by the number of possible class values) and labels them "Interval_X". Only columns compatible with double values are binned and the column's type of the output table is changed to "String".
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.