Web: http://arxiv.org/abs/2201.08659

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

More from arxiv.org / cs.LG updates on arXiv.org

Director, Data Engineering and Architecture

@ Chainalysis | California | New York | Washington DC | Remote - USA

Deep Learning Researcher

@ Topaz Labs | Dallas, TX

Sr Data Engineer (Contractor)

@ SADA | US - West

Senior Cloud Database Administrator

@ Findhelp | Remote

Senior Data Analyst

@ System1 | Remote

Speech Machine Learning Research Engineer

@ Samsung Research America | Mountain View, CA