IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4419-1630-3_3.html
   My bibliography  Save this book chapter

A Revised Branch-and-Bound Approach for Inferring a Boolean Function from Examples

In: Data Mining and Knowledge Discovery via Logic-Based Methods

Author

Listed:
  • Evangelos Triantaphyllou

    (Louisiana State University)

Abstract

This chapter discusses a revised sub branch-and-bound (B&B) branch-and-bound (B&B) algorithm for inferring a single clause (in CNF or DNF) from two disjoint sets of binary training examples. This algorithm is an extension of the B&B algorithm described in the previous chapter. Now the states of the search space are described by using more information and this seems to be critical in leading to good search results faster. This chapter is based on the developments first presented in [ aut Triantaphyllou, E. Triantaphyllou, 1994].

Suggested Citation

  • Evangelos Triantaphyllou, 2010. "A Revised Branch-and-Bound Approach for Inferring a Boolean Function from Examples," Springer Optimization and Its Applications, in: Data Mining and Knowledge Discovery via Logic-Based Methods, chapter 0, pages 57-72, Springer.
    • Handle: RePEc:spr:spochp:978-1-4419-1630-3_3
    DOI: 10.1007/978-1-4419-1630-3_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4419-1630-3_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.