The proposed Fibonacci and \(k\) -Subsecting Recursive Feature Elimination (FRFE, \(k\) -SRFE) algorithms are inspired by line search methods [1]}. The main goal of FRFE and \(k\) -SRFE is to find the best number of attributes to select, without having to remove one feature at a time. The basic iterative process of Recursive Feature Elimination (RFE) [2]} remains the same, however, the feature subset and the number of features to remove change with each step.
