Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning
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. W...
Main Authors: | Guangyi Liu, Ou Li, Dalong Zhang, Tao Song |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2014/625173 |
Similar Items
-
Upper and Lower Bounds for Text
Upper and Lower Bounds for Text Indexing Data Structures
by: Golynski, Alexander
Published: (2008) -
Upper and Lower Bounds for Text
Upper and Lower Bounds for Text Indexing Data Structures
by: Golynski, Alexander
Published: (2008) -
An Efficient Hybrid Algorithm for Multiobjective Optimization Problems with Upper and Lower Bounds in Engineering
by: Guang Yang, et al.
Published: (2015-01-01) -
Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
by: Shah, Julie A., et al.
Published: (2015) -
A Novel Approach for Searching the Upper/Lower Bounds of Uncertainty Parameters in Microgrids
by: Xiaojun Ding, et al.
Published: (2018-04-01)