scientific article; zbMATH DE number 3585466

zbMATH Open0376.05031MaRDI QIDQ4154580FDOQ4154580

R. W. Robinson

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cited In (38)

• The asymptotic number of acyclic digraphs. II
• The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
• Quantum approximate optimization algorithm for Bayesian network structure learning
• Title not available (Why is that?)
• A review on evolutionary algorithms in Bayesian network learning and inference tasks
• Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
• Graphical methods, inductive causal inference, and econometrics: a literature review
• Structure learning of Bayesian networks by continuous particle swarm optimization algorithms
• Asymptotic enumeration of compacted binary trees of bounded right height
• A hybrid random field model for scalable statistical learning
• Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks
• Partitioned hybrid learning of Bayesian network structures
• Uniform random generation of large acyclic digraphs
• The chromatic polynomial of an unlabeled graph
• Learning Bayesian network classifiers by risk minimization
• Bayesian networks for sex-related homicides: structure learning and prediction
• Exact enumeration of satisfiable 2-SAT formulae
• Belief graphical models for uncertainty representation and reasoning
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• The number of small covers over cubes
• Formulas for counting acyclic digraph Markov equivalence classes
• Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
• Symbolic method and directed graph enumeration
• Robust Causal Structure Learning with Some Hidden Variables
• Reducing the structure space of Bayesian classifiers using some general algorithms
• Generating functions of some families of directed uniform hypergraphs
• Causal discoveries for high dimensional mixed data
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Acyclic Digraphs
• Continuity approximation in hybrid Bayesian networks structure learning
• A decomposition algorithm for learning Bayesian networks based on scoring function
• Classification of real Bott manifolds and acyclic digraphs
• Generating connected acyclic digraphs uniformly at random
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• An optimization-based approach for the design of Bayesian networks
• A characterization of Markov equivalence classes for acyclic digraphs
• Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154580)