IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/625173.html
   My bibliography  Save this article

Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning

Author

Listed:
  • Guangyi Liu
  • Ou Li
  • Dalong Zhang
  • Tao Song

Abstract

Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues. Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper. We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network. Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.

Suggested Citation

  • Guangyi Liu & Ou Li & Dalong Zhang & Tao Song, 2014. "Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-6, November.
    • Handle: RePEc:hin:jnlmpe:625173
    DOI: 10.1155/2014/625173
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/625173.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/625173.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/625173?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
    ---><---

    More about this item

    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:hin:jnlmpe:625173. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.