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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
IEEE
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/8db894f4a89a4f99b9f59e778cd426a1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|