BENEDICT

swMATH35868MaRDI QIDQ51570FDOQ51570

Author name not available (Why is that?)

Official website: https://www.sciencedirect.com/science/article/pii/S0888613X0100041X

Described by source

• A hybrid methodology for learning belief networks: BENEDICT

Cited In (19)

• AMP chain graphs: minimal separators and structure learning algorithms
• Learning Bayesian networks from data: An information-theory based approach
• Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
• Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
• AgenaRisk
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• TETRAD
• MLC++
• Netica
• gRapHD
• Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
• NARROMI
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Hailfinder
• Ant colony optimization for learning Bayesian networks.
• A new approach for learning belief networks using independence criteria
• A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• Methods of constructing Bayesian networks based on scoring functions

This page was built for software: BENEDICT