IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i15p3344-d1206759.html
   My bibliography  Save this article

Bayesian Network Structure Learning Using Improved A* with Constraints from Potential Optimal Parent Sets

Author

Listed:
  • Chuchao He

    (School of Electronics and Information Engineering, Xi’an Technological University, Xi’an 710021, China)

  • Ruohai Di

    (School of Electronics and Information Engineering, Xi’an Technological University, Xi’an 710021, China)

  • Xiangyuan Tan

    (School of Electronic Information, Northwestern Polytechnical University, Xi’an 710192, China)

Abstract

Learning the structure of a Bayesian network and considering the efficiency and accuracy of learning has always been a hot topic for researchers. This paper proposes two constraints to solve the problem that the A* algorithm, an exact learning algorithm, is not efficient enough to search larger networks. On the one hand, the parent–child set constraints reduce the number of potential optimal parent sets. On the other hand, the path constraints are obtained from the potential optimal parent sets to constrain the search process of the A* algorithm. Both constraints are proposed based on the potential optimal parent sets. Experiments show that the time efficiency of the A* algorithm can be significantly improved, and the ability of the A* algorithm to search larger Bayesian networks can be improved by the two constraints. In addition, compared with the globally optimal Bayesian network learning using integer linear programming (GOBNILP) algorithm and the max–min hill-climbing (MMHC) algorithm, which are state of the art, the A* algorithm enhanced by constraints still performs well in most cases.

Suggested Citation

  • Chuchao He & Ruohai Di & Xiangyuan Tan, 2023. "Bayesian Network Structure Learning Using Improved A* with Constraints from Potential Optimal Parent Sets," Mathematics, MDPI, vol. 11(15), pages 1-18, July.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:15:p:3344-:d:1206759
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/15/3344/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/15/3344/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jmathe:v:11:y:2023:i:15:p:3344-:d:1206759. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.