0 ×

CAIM Binner

KNIME Base Nodes version 4.2.2.v202009011342 by KNIME AG, Zurich, Switzerland

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".


Class Column
The class column. According to this column the binning is optimized.
Column selection
Allows to include those columns which should be included in the discretization. Just the included columns are discretized and changed to "String" type.
General Node Settings
To increase performance, select the memory policy 'Keep all in memory' at the PREVIOUS node (if possible) from the General Node Settings Tab.

Input Ports

The data table to bin (discretize).

Output Ports

The binned data table.
The model representing the binning. Contains the intervals for each bin of each column.


Binning Model
The view shows the column's binning scheme. For each column a ruler is displayed on which the bin boundaries are marked.

Best Friends (Incoming)

Best Friends (Outgoing)


To use this node in KNIME, install KNIME Base nodes from the following update site:


A zipped version of the software site can be downloaded here. Read our FAQs to get instructions about how to install nodes from a zipped update site.

Wait a sec! You want to explore and install nodes even faster? We highly recommend our NodePit for KNIME extension for your KNIME Analytics Platform.


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.