Branch & Bound Algorithm with Partial Prediction for Use with Recursive and Non-recursive Criterion Forms

Authors:
Petr Somol;Pavel Pudil;Jiri Grim
Affiliations:
-;-;-
Venue:
ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Year:
2001

Citing 2
Cited 1

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
A Branch and Bound Algorithm for Feature Subset Selection

IEEE Transactions on Computers

Advances in Statistical Feature Selection

ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a novel algorithm for optimal feature selection. As opposed to our recent Fast Branch & Bound (FBB) algorithm [5] the new algorithm is well suitable for use with recursive criterion forms. Even if the new algorithm does not operate as effectively as the FBB algorithm, it is able to find the optimum significantly faster than any other Branch & Bound [1,3] algorithm.