An Alternative Proof That Exact Inference Problem in Bayesian Belief Networks Is NP-Hard

An Alternative Proof That Exact Inference Problem in Bayesian Belief Networks Is NP-Hard

Exact inference problem in belief networks has been well studied in the literature and has various application areas. It is known that this problem and its approximation version are NP-hard. In this study, an alternative polynomial time transformation is provided from the well-known vertex cover pro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tacettin, Mustafa, Ünlüyurt, Tonguç
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Parent Node
Probabilistic Inference
Probability Table
State Node
Theoretical computing
Vertex Cover
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Exact inference problem in belief networks has been well studied in the literature and has various application areas. It is known that this problem and its approximation version are NP-hard. In this study, an alternative polynomial time transformation is provided from the well-known vertex cover problem. This new transformation may lead to new insights and polynomially solvable classes of the exact inference problem in Bayesian belief networks.
ISSN:0302-9743
1611-3349
DOI:10.1007/11569596_96