Generalized Branch and Bound Algorithm for Feature Subset Selection

摘要

Branch and bound algorithm is a good method for feature selection which finds the optimal subset of features of a given cardinality when the criterion function satisfies the monotonicity property. To find an optimal feature subset of a different cardinali