Strengthening Probabilistic Graphical Models: The Purge-and-Merge Algorithm
Probabilistic graphical models (PGMs) are powerful tools for solving systems of complex relationships over a variety of probability distributions. However, while tree-structured PGMs always result in efficient and exact solutions, inference on graph (or loopy) structured PGMs is not guaranteed to di...
Enregistré dans:
Auteurs principaux: | , |
---|---|
Format: | article |
Langue: | EN |
Publié: |
IEEE
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/8db894f4a89a4f99b9f59e778cd426a1 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!