Learning Associative Markov Networks

Learning Associative Markov Networks (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ben Taskar , Vassil Chatalbashev , Daphne Koller

Venue:	Proc. ICML
Citations:	55 - 7 self

BibTeX

@INPROCEEDINGS{Taskar04learningassociative,
    author = {Ben Taskar and Vassil Chatalbashev and Daphne Koller},
    title = {Learning Associative Markov Networks},
    booktitle = {Proc. ICML},
    year = {2004},
    pages = {102},
    publisher = {ACM Press}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bioinformatics.

Citations

1548	F: Conditional Random Fields: Probabilistic models for segmenting and labeling sequence data - Lafferty, McCallum, et al. - 2001
907	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
736	On the statistical analysis of dirty pictures - Besag - 1986
326	Enhanced hypertext categorization using hyperlinks - Chakrabarti, Dom, et al. - 1998
315	BMaximum-margin Markov networks - Taskar, Guestrin, et al. - 2003
290	DiPasquo,“Learning to extract Symbolic Knowledge from the World Wide Web - Craven, Freitag, et al. - 1998
276	D: Discriminative probabilistic models for relational data - Taskar, Abbeel, et al. - 2002
233	Exact maximum a posteriori estimation for binary images - Greig, Porteous, et al. - 1989
199	A multiscale random field model for Bayesian image segmentation - Bouman, Shapiro - 1994
131	Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields - Kleinberg, Tardos - 1999
123	Markov Random Fields with efficient approximations - BOYKOV, VEKSLER, et al. - 1998
97	RB: Some generalized order-disorder transformations - Potts - 1953
77	Map estimation via agreement on (hyper)trees: Message-passing and linear programming approaches - Wainwright, Jaakkola, et al.
50	Global protein function prediction from protein-protein interaction networks - Vazquez, Flammini, et al. - 2003
41	Thin junction trees - Bach, Jordan
12	Learning on the test data: Leveraging unseen features - Taskar, Wong, et al.
7	Markov random fields with e#cient approximations - Boykov, Veksler, et al. - 1998
5	What energy functions can be minimized using graph cuts - Kolmogorov, Zabih - 2002
4	Introduction to Linear Programming. Athena Scientific - Bertsimas, Tsitsiklis - 1997
1	Generalized belief propagation. NIPS. A. Binary AMNs Proof (For Theorem 3.1) Consider any fractional, feasible y. We show that we can construct a new feasible assignment z which increases the objective (or leaves it unchanged) and furthermore has fewer fr - Yedidia, Freeman, et al. - 2000
1	AMNs For K > 2, we use the randomized rounding procedure of Kleinberg and Tardos - Multi-class - 1999