Evaluating Bayesian Networks via Data Streams
From MaRDI portal
Publication:3196429
DOI10.1007/978-3-319-21398-9_57zbMath1466.68037OpenAlexW2296656794MaRDI QIDQ3196429
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
Database theory (68P15) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Probabilistic graphical models (62H22)
Cites Work
- Measuring independence of datasets
- A near-optimal algorithm for estimating the entropy of a stream
- Bayesian Networks and Decision Graphs
- The Probabilistic Communication Complexity of Set Intersection
- An improved data stream summary: the count-min sketch and its applications
- Fast moment estimation in data streams in optimal space
- Approximating discrete probability distributions with dependence trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item