Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel globally optimal structure learning of Bayesian networks

From MaRDI portal
Publication:897373
Jump to:navigation, search

DOI10.1016/j.jpdc.2013.04.001zbMath1327.68198OpenAlexW2021368287MaRDI QIDQ897373

Srinivas Aluru, Olga Nikolova, Jaroslaw Zola

Publication date: 18 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2013.04.001


zbMATH Keywords

Bayesian networksparallel algorithmmachine learninggraphical modelsstructure learning


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)


Related Items (1)

Optimal Boolean lattice-based algorithms for the U-curve optimization problem


Uses Software

  • SynTReN


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
  • A Bayesian method for the induction of probabilistic networks from data
  • Estimating the dimension of a model
  • Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
  • Learning Bayesian networks: The combination of knowledge and statistical data
  • Elements of Information Theory


This page was built for publication: Parallel globally optimal structure learning of Bayesian networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:897373&oldid=12857796"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 16:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki