• DocumentCode
    526832
  • Title

    A hybrid discrete PSO-SA algorithm to find optimal elimination orderings for Bayesian networks

  • Author

    Dong, Xuchu ; Ouyang, Dantong ; Cai, Dianbo ; Zhang, Yonggang ; Ye, Yuxin

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
  • Volume
    1
  • fYear
    2010
  • fDate
    10-11 July 2010
  • Firstpage
    510
  • Lastpage
    513
  • Abstract
    In this paper, a hybrid algorithm named DPSOSA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing. Computational tests show that this hybrid method is very effective and robust for the elimination ordering problem.
  • Keywords
    belief networks; graph theory; particle swarm optimisation; simulated annealing; Bayesian network; discrete PSO-SA algorithm; optimal elimination ordering; Adaptation model; Computational modeling; Bayesian networks; elimination ordering; particle swarm optimization; simulated annealing; triangulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial and Information Systems (IIS), 2010 2nd International Conference on
  • Conference_Location
    Dalian
  • Print_ISBN
    978-1-4244-7860-6
  • Type

    conf

  • DOI
    10.1109/INDUSIS.2010.5565797
  • Filename
    5565797
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=526832