Jan. 24, 2022, 2:10 a.m. | Mads Lindskou, Torben Tvedebrink, Poul Svante Eriksen, Søren Højsgaard, Niels Morling

cs.LG updates on arXiv.org arxiv.org

We propose Unity Smoothing (US) for handling inconsistencies between a
Bayesian network model and new unseen observations. We show that prediction
accuracy, using the junction tree algorithm with US is comparable to that of
Laplace smoothing. Moreover, in applications were sparsity of the data
structures is utilized, US outperforms Laplace smoothing in terms of memory
usage. Furthermore, we detail how to avoid redundant calculations that must
otherwise be performed during the message passing scheme in the junction tree
algorithm which …

arxiv bayesian networks unity

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Data Analytics & Insight Specialist, Customer Success

@ Fortinet | Ottawa, ON, Canada

Account Director, ChatGPT Enterprise - Majors

@ OpenAI | Remote - Paris