IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v16y2001i3d10.1007_s001800100071.html
   My bibliography  Save this article

Combining statistical and reinforcement learning in rule-based classification

Author

Listed:
  • Jorge Muruzábal

    (University Rey Juan Carlos)

Abstract

Summary BYPASS is a rule-based learning algorithm designed loosely after John Holland’s Classifier System (CS) idea. In essence, CSs are incremental data processors that attempt to (self-)organize a population of rules under the guidance of certain reinforcement policy. BYPASS uses a reinforcement scheme based on predictive scoring and handles conditions similar to those in standard classification trees. However, these conditions are allowed to overlap; this makes it possible to base individual predictions on several rules (just like in committees of trees). Moreover, conditions are supplied with simple bayesian predictive distributions that evolve as data are processed. The paper presents the details of the algorithm and discusses empirical results suggesting that statistical and reinforcement-based learning blend together in interesting and useful ways.

Suggested Citation

  • Jorge Muruzábal, 2001. "Combining statistical and reinforcement learning in rule-based classification," Computational Statistics, Springer, vol. 16(3), pages 341-359, September.
    • Handle: RePEc:spr:compst:v:16:y:2001:i:3:d:10.1007_s001800100071
    DOI: 10.1007/s001800100071
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s001800100071
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s001800100071?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:compst:v:16:y:2001:i:3:d:10.1007_s001800100071. 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.