The following algorithms have been comparatively analysed in the framework. The code is freely available on github.
Algorithm | Reference | Type | |
PMI – Partial Mutual Information (R) | Sharma, 2000; Bowden et al., 2005 | Filter | |
IIS – Iterative Input Selection (MatLab/C) | Galelli and Castelletti, 2013 | Filter | |
PCIS – Partial Correlation Input Selection (R) | May et al., 2008 | Filter | |
GA-ANN (R) | Bowden et al., 2005 | Wrapper |
Thanks for your posting. It’s very helpful. May I share this?
Hello
I am interested in the IIS algorithm. I like the MATLAB code. Could you please tell me what is the best way to select the parameters below
M = ?; % Number of trees in the ensemble
nmin = ?; % Number of points per leaf
ns = ?; % number of folds
p =?; % number of SISO models evaluated at each iteration (this number must be smaller than the
% number of candidate inputs.
Hello
I have a question.
I am interested in the PMIS algorithm.
the row of input variable is about 60000
So, this algorithm is not computed.
Could you please tell me what is problem about that and how to run this algorithm.
thank you
best regards
nice post