Collective inference for extraction MRFs coupled with symmetric clique potentials

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 3097-3135

  Gupta, Rahul ^a   Sarawagi, Sunita ^a   Diwan, Ajit A ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Clique potentials; Cluster graphs; Collective inference; Graphical models; Message passing

Indexed keywords

ASSOCIATIVITY; BELIEF PROPAGATION; CLIQUE POTENTIAL; CLIQUE SIZE; CLUSTER GRAPHS; COLLECTIVE INFERENCE; COMPUTATION ALGORITHM; DOMAIN ADAPTATION; ERROR REDUCTION; EXACT SOLUTION; GRAPHICAL MODEL; GRAPHICAL MODELS; INTRA-DOMAIN; LABELINGS; LAGRANGIAN RELAXATION; ORDERS OF MAGNITUDE; STRUCTURED INFORMATION;

GRAPHIC METHODS; INFERENCE ENGINES; MESSAGE PASSING; STRUCTURAL FRAMES;

CLUSTERING ALGORITHMS;

EID: 79551492523     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (62)

1. Karteek Alahari, Pushmeet Kohli, and Philip H. S. Torr. Reduce, reuse & recycle: Efficiently solving multi-label mrfs. In CVPR, 2008.
2. David Blei, Drew Bagnell, and Andrew McCallum. Learning with scope, with application to information extraction and classification. In UAI, 2002.
3. John Blitzer, Ryan McDonald, and Fernando Pereira. Domain adaptation with structural correspondence learning. In EMNLP, 2006.
4. Antoine Bordes, Léon Bottou, Patrick Gallinari, and Jason Weston. Solving multiclass support vector machines with larank. In ICML, pages 89-96, 2007.
5. Endre Boros and Peter L. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3):155-225, 2002.
6. Yuri Boykov and Vladimir Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), volume 26, no. 9, pages 1124-1137, 2004.
7. Yuri Boykov, Olga Veksler, and Ramin Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222-1239, 2001.
8. Razvan Bunescu and Raymond J.Mooney. Collective information extraction with relational markov networks. In ACL, 2004.
9. Andrew Carlson, Justin Betteridge, Richard C. Wang, Estevam R. Hruschka Jr., and Tom M. Mitchell. Coupled semi-supervised learning for information extraction. In WSDM, 2010.
10. Soumen Chakrabarti, Byron Dom, and Piotr Indyk. Enhanced hypertext categorization using hyperlinks. SIGMOD Rec., 27(2):307-318, 1998.
11. Shann-Ching Chen, Geoffrey J. Gordon, and Robert F. Murphy. Graphical models for structured classification, with an application to interpreting images of protein subcellular location patterns. JMLR, 9:651-682, 2008. ISSN 1533-7928.
12. John Duchi, Daniel Tarlow, Gal Elidan, and Daphne Koller. Using combinatorial optimization within max-product belief propagation. In Advances in Neural Information Processing Systems (NIPS 2006), 2007.
13. Hazem Elmeleegy, Jayant Madhavan, and Alon Halevy. Harvesting relational tables from lists on the web. In VLDB, 2009.
14. Jenny Rose Finkel, Trond Grenager, and Christopher D. Manning. Incorporating non-local information into information extraction systems by gibbs sampling. In ACL, 2005.
15. Rahul Gupta and Sunita Sarawagi. Answering table augmentation queries from unstructured lists on the web. In PVLDB, 2009.
16. Rahul Gupta, Ajit A. Diwan, and Sunita Sarawagi. Efficient inference with cardinality-based clique potentials. In Proceedings of the 24th International Conference on Machine Learning (ICML), USA, 2007.
17. Rahul Gupta, Sunita Sarawagi, and Ajit A. Diwan. Generalized collective inference with symmetric clique potentials, 2009. URL http://arxiv.org/abs/0907. 0589v2.
18. Hiroshi Ishikawa. Higher-order clique reduction in binary graph cut. In CVPR, pages 2993-3000, 2009.
19. Ariel Jaimovich, Ofer Meshi, and Nir Friedman. Template based inference in symmetric relational markov random fields. In UAI, 2007.
20. Jon Kleinberg and Eva Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM, 49(5):616-639, 2002. doi: http://doi.acm.org/10.1145/585265.585268.
21. Pushmeet Kohli and M. Pawan Kumar. Energy minimization for linear envelope mrfs. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2010.
22. Pushmeet Kohli, M. Pawan Kumar, and Philip H. S. Torr. P3 & beyond: Solving energies with higher order cliques. In CVPR, 2007.
23. Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rother, Vladimir Kolmogorov, and Philip H. S. Torr. On partial optimality in multi-label mrfs. In ICML, pages 480-487, 2008.
24. Pushmeet Kohli, Lubor Ladicky, and Philip H. S. Torr. Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision, 82(3):302-324, 2009.
25. Vladimir Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10):1568-1583, 2006. ISSN 0162-8828.
26. Vladimir Kolmogorov and Carsten Rother. Minimizing nonsubmodular functions with graph cuts -a review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7):1274-1279, 2007.
27. Vladimir Kolmogorov and Ramin Zabih. What energy functions can be minimized via graph cuts.IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 2004.
28. Nikos Komodakis and Nikos Paragios. Beyond loose lp-relaxations: optimizing mrfs by repairing cycles. In ECCV, 2008.
29. Nikos Komodakis and Nikos Paragios. Beyond pairwise energies: Efficient optimization for higherorder mrfs. In CVPR, 2009.
30. Nikos Komodakis and Georgios Tziritas. A new framework for approximate labeling via graph cuts. In ICCV, pages 1018-1025, 2005.
31. Nikos Komodakis and Georgios Tziritas. Approximate labeling via graph cuts based on linear programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(8):1436-1453, 2007.
32. Nikos Komodakis, Nikos Paragios, and Georgios Tziritas. Mrf optimization via dual decomposition: Message-passing revisited. In ICCV, 2007a.
33. Nikos Komodakis, Georgios Tziritas, and Nikos Paragios. Fast, approximately optimal solutions for single and dynamic mrfs. In CVPR, 2007b.
34. Nikos Komodakis, Georgios Tziritas, and Nikos Paragios. Performance vs computational efficiency for optimizing single and dynamic mrfs: Setting the state of the art with primal-dual strategies. Comput. Vis. Image Underst., 112(1):14-29, 2008.
35. Ivan Kovtun. Partial optimal labeling search for a np-hard subclass of (max, +) problems. In DAGM-Symposium, pages 402-409, 2003.
36. Vijay Krishnan and Christopher D. Manning. An effective two-stage model for exploiting non-local dependencies in named entity recognition. In ACL-COLING, 2006.
37. Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, and Soumen Chakrabarti. Collective annotation of wikipedia entities in web text. In SIGKDD, 2009.
38. M. Pawan Kumar and Philip H. S. Torr. Efficiently solving convex relaxations for map estimation. In ICML, 2008a.
39. M. Pawan Kumar and Philip H. S. Torr. Improved moves for truncated convex models. In NIPS, pages 889-896, 2008b.
40. M. Pawan Kumar, Vladimir Kolmogorov, and Philip H. S. Torr. An analysis of convex relaxations for map estimation of discrete mrfs. JMLR, 10:71-106, 2009.
41. John Lafferty, Andrew McCallum, and Fernando Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the International Conference on Machine Learning (ICML-2001), Williams, MA, 2001.
42. Victor S. Lempitsky, Carsten Rother, and Andrew Blake. Logcut -efficient graph cut optimization for markov random fields. In ICCV, pages 1-8, 2007.
43. Qing Lu and Lise Getoor. Link-based classification. In Machine Learning, ICML, pages 496-503, 2003.
44. Gideon Mann and Andrew McCallum. Simple, robust, scalable semi-supervised learning via expectation regularization. In ICML, 2007.
45. Andrew McCallum, Kamal Nigam, Jason Reed, Jason Rennie, and Kristie Seymore. Cora: computer science research paper search engine. http://cora.whizbang.com/, 2000.
46. Talya Meltzer, Amir Globerson, and Yair Weiss. Convergent message passing algorithms -a unifying view. In UAI, 2009.
47. Brian Milch, Luke S. Zettlemoyer, Kristian Kersting, Michael Haimes, and Leslie Pack Kaelbling. Lifted probabilistic inference with counting formulas. In AAAI, 2008.
48. Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity, chapter 11, pages 247-254. Prentice Hall, Englewood Cliffs, NJ., 1982.
49. Fuchun Peng and Andrew McCallum. Accurate information extraction from research papers using conditional random fields. In HLT-NAACL, pages 329-336, 2004.
50. Brian Potetz and Tai Sing Lee. Efficient belief propagation for higher-order cliques using linear constraint nodes. Computer Vision and Image Understanding, 112(1):39-54, 2008.
51. Srikumar Ramalingam, Pushmeet Kohli, Karteek Alahari, and Philip H. S. Torr. Exact inference in multi-label crfs with higher order cliques. In CVPR, 2008.
52. Pradeep Ravikumar, Alekh Agarwal, and Martin J. Wainwright. Message-passing for graphstructured linear programs: Proximal methods and rounding schemes. Journal of Machine Learning Research, 11:1043-1080, 2010.
53. Carsten Rother, Pushmeet Kohli, Wei Feng, and Jiaya Jia. Minimizing sparse higher order energy functions of discrete variables. In CVPR, 2009.
54. David Sontag, Talya Meltzer, Amir Globerson, Tommi Jaakkola, and Yair Weiss. Tightening lp relaxations for map using message passing. In UAI, 2008.
55. Charles Sutton and Andrew McCallum. Collective segmentation and labeling of distant entities in information extraction. Technical Report TR # 04-49, University of Massachusetts, 2004.
56. Rick Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall Tappen, and Carsten Rother. A comparative study of energy minimization methods for markov random fields. In ECCV 2006, volume 2, pages 16-29, 2006.
57. Daniel Tarlow, Inmar Givoni, and Richard Zemel. Hop-map: Efficient message passing with high order potentials. In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics (AI-STATS), volume 9, pages 812-819. JMLR: W&CP, 2010.
58. Ben Taskar, Vassil Chatalbashev, and Daphne Koller. Learning associative markov networks. In Twenty First International Conference on Machine Learning (ICML04), 2004.
59. Olga Veksler. Graph cut based optimization for mrfs with truncated convex priors. In CVPR, 2007.
60. Tomás Werner. High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (map-mrf). In CVPR, 2008.
61. Tomas Werner. Revisiting the linear programming relaxation approach to gibbs energy minimization and weighted constraint satisfaction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 99(PrePrints), 2009. ISSN 0162-8828.
62. Jonathan S. Yedidia, William T. Freeman, and Yair Weiss. Understanding belief propagation and its generalizations. Exploring Artificial Intelligence in the New Millenium, 239-269. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003. ISBN 1-55860-811-7.