0 ×

Backward Feature Elimination Start (2:2)

DeprecatedKNIME Base Nodes version 4.4.0.v202106241539 by KNIME AG, Zurich, Switzerland

This is the start node of a backward feature elimination loop. The first iteration of the loop is executed with all input columns. In the next n - 1 iterations each of the input columns - except the target column, that must be selected in the dialog - is left out once. Then the end node will discard the column that influenced the prediction result the least. Then n - 2 iterations follow where each of the remaining columns is left out once, and so on. The total number of iterations is therefore n * (n + 1) / 2 - 1.
The backward feature elimination loop can handle arbitrary target column, for numerical columns the squared error is taken as quality measure, for all other columns the error rate (i.e. the fraction of rows for which target and prediction column have different values).
This node differs from the 1-port node in that it has actually two ports on both sides. This makes it easier to feed training and test data into the flow.

Input Ports

Any datatable that contains at least three columns (Trainingdata)
Any datatable that contains at least three columns (Testdata)

Output Ports

The input table with some columns filtered out (Trainingdata)
The input table with some columns filtered out (Testdata)

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.

You don't know what to do with this link? Read our NodePit Product and Node Installation Guide that explains you in detail how to install nodes to your KNIME Analytics Platform.

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. Browse NodePit from within KNIME, install nodes with just one click and share your workflows with NodePit Space.


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.