IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Optimal structure identification with greedy search
The Journal of Machine Learning Research
A Bayesian Network Framework for Relational Shape Matching
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Monitoring and diagnosis of a multistage manufacturing process using Bayesian networks
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
IEEE Transactions on Knowledge and Data Engineering
A reconstruction algorithm for the essential graph
International Journal of Approximate Reasoning
Learning Bayesian network equivalence classes with Ant Colony optimization
Journal of Artificial Intelligence Research
Using a local discovery ant algorithm for Bayesian network structure learning
IEEE Transactions on Evolutionary Computation
ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 06
A Stable Stochastic Optimization Algorithm for Triangulation of Bayesian Networks
WKDD '10 Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data Mining
Improving algorithms for structure learning in Bayesian Networks using a new implicit score
Expert Systems with Applications: An International Journal
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
The Journal of Machine Learning Research
A transformational characterization of equivalent Bayesian network structures
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Learning Bayesian network structures by searching for the best ordering with genetic algorithms
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
As is well known, greedy algorithm is usually used as local optimization method in many heuristic algorithms such as ant colony optimization, taboo search, and genetic algorithms, and it is significant to increase the convergence speed and learning accuracy of greedy search in the space of equivalence classes of Bayesian network structures. An improved algorithm, I-GREEDY-E is presented based on mutual information and conditional independence tests to firstly make a draft about the real network, and then greedily explore the optimal structure in the space of equivalence classes starting from the draft. Numerical experiments show that both the BIC score and structure error have some improvement, and the number of iterations and running time are greatly reduced. Therefore the structure with highest degree of data matching can be relatively faster determined by the improved algorithm.