Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Advances in Pattern Recognition — ICAPR 2001 (ICAPR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2013))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Narendra P. M., Fukunaga K. (1977) A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers, C-26, 917–922

    Article  Google Scholar 

  2. Devijver P. A., Kittler J. (1982) Pattern Recognition: A Statistical Approach. Prentice-Hall

    Google Scholar 

  3. Fukunaga K. (1990) Introduction to Statistical Pattern Recognition: 2nd edition. Academic Press, Inc.

    Google Scholar 

  4. Yu B., Yuan B. (1993) A more efficient branch and bound algorithm for feature selection. Pattern Recognition, 26, 883–889

    Article  Google Scholar 

  5. Somol P., Pudil P., Ferri F. J., Kittler J. (2000) Fast Branch & Bound Algorithm in Feature Selection. Proc 4th World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, Orlando, Florida, Vol VII, Part 1, 646–651

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Pattern Recognition, Inst. of Information Theory and Automation, Academy of Sciences of the Czech Republic, 182 08, Prague 8, Czech Republic

    Petr Somol, Pavel Pudil & JiYí Grim

Authors
  1. Petr Somol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Pudil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. JiYí Grim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Exeter, EX4 4PT, Exeter, UK

    Sameer Singh

  2. Computational Intelligence Group, Tuiuti University of Parana, Curitiba, Brazil

    Nabeel Murshed

  3. Institute of Computer Aided Automation PRIP-Group 1832, Vienna University of Technology, Favoritenstr. 9/2/4, 1040, Wien, Austria

    Walter Kropatsch

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Somol, P., Pudil, P., Grim, J. (2001). Branch & Bound Algorithm with Partial Prediction for Use with Recursive and Non-Recursive Criterion Forms. In: Singh, S., Murshed, N., Kropatsch, W. (eds) Advances in Pattern Recognition — ICAPR 2001. ICAPR 2001. Lecture Notes in Computer Science, vol 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44732-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-44732-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41767-5

  • Online ISBN: 978-3-540-44732-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation