On Prediction Mechanisms in Fast Branch & Bound Algorithms
The idea of using the Branch & Bound search for optimal feature selection has been recently refined by introducing additional predicting heuristics that is able to considerably accelerate the search process while keeping the optimality of results unaffected. The heuristics is used most extensively in the so-called Fast Branch & Bound algorithm, where it replaces many slow criterion function computations by means of fast predictions. In this paper we investigate alternative prediction mechanisms. The alternatives are shown potentially useful for simplification and speed-up of the algorithm. We demonstrate the robustness of the prediction mechanism concept on real data experiments.
Keywordssubset search feature selection search tree optimal search subset selection dimensionality reduction
- 6.Somol, P., Pudil, P., Ferri, F.J., Kittler, J.: Fast Branch & Bound Algorithm in Feature Selection. In: Proc. 4th World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, Orlando, Florida, vol. VII, Part 1, pp. 646–651 (2000)Google Scholar
- 7.Somol, P., Pudil, P., Grim, J.: Branch & Bound Algorithm with Partial Prediction For Use with Recursive and Non-Recursive Criterion Forms. In: Singh, S., Murshed, N., Kropatsch, W.G. (eds.) ICAPR 2001. LNCS, vol. 2013, pp. 230–238. Springer, Heidelberg (2001)Google Scholar
- 8.Somol, P., Pudil, P., Kittler, J.: Fast Branch & Bound Algorithms in Feature Selection. To appear in IEEE Transactions on PAMI (July 2004)Google Scholar