Sciweavers

SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro