Methods and Experiments With Bounded Tree-width Markov Networks
Markov trees generalize naturally to bounded tree-width Markov networks, onwhich exact computations can still be done efficiently. However, learning themaximum likelihood Markov network with tree-width greater than 1 is NP-hard, sowe discuss a few algorithms for approximating the optimal Markov net...
Main Authors: | Liang, Percy, Srebro, Nathan |
---|---|
Language: | en_US |
Published: |
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/30511 |
Similar Items
-
Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
by: Szabó Péter G.N.
Published: (2016-05-01) -
Corrigendum to: Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and l-Hypertrees [Discussiones Mathematicae Graph Theory 36 (2016) 259–278]
by: Szabó Péter G.N.
Published: (2022-02-01) -
Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering
by: Tianxiang He, et al.
Published: (2023-01-01) -
Asymptotic Sharpness of Bounds on Hypertrees
by: Lin Yi, et al.
Published: (2017-08-01) -
Hypertree-Width and Related Hypergraph Invariants
by: Isolde Adler, et al.
Published: (2005-01-01)