Evaluating Bayesian networks via data streams

DOI10.1007/978-3-319-21398-9_57MaRDI QIDQ3196429zbMATH OpenOpenAlexFDO

Authors Andrew McGregor, Hoa T. Vu

Publication date 29 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21398-9_57

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Database theory (68P15) Randomized algorithms (68W20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Measuring independence of datasets
• Bayesian network structure learning: hybridizing complete search with independence tests
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Exact Bayesian structure discovery in Bayesian networks
• Identifying independence in bayesian networks

Cites work

• A near-optimal algorithm for estimating the entropy of a stream
• AMS without 4-wise independence on product domains
• An improved data stream summary: the count-min sketch and its applications
• Approximating discrete probability distributions with dependence trees
• Bayesian Networks and Decision Graphs
• Fast moment estimation in data streams in optimal space
• scientific article; zbMATH DE number 5764818 (Why is no real title available?)
• scientific article; zbMATH DE number 1222283 (Why is no real title available?)
• scientific article; zbMATH DE number 2087711 (Why is no real title available?)
• Measuring independence of datasets
• The Probabilistic Communication Complexity of Set Intersection

Cited in

(1)

• Learning discrete Bayesian network parameters from continuous data streams: what is the best strategy?

This page was built for publication: Evaluating Bayesian networks via data streams

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