Efficient inference with cardinality-based clique potentials

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 329-336

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

^a IBM RESEARCH INDIA   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; PARAMETERIZATION; TREES (MATHEMATICS);

COLLECTIVE LABELING TASKS; GRAPH CUT ALGORITHMS; INFERENCE ALGORITHMS;

BINARY CODES;

EID: 34547982899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273538     Document Type: Conference Paper

References (19)

1. Boykov, Y., & Kolmogorov, V. (September 2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) (pp. 1124-1137).
2. Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell., 23, 1222-1239.
3. Bunescu, R., & Mooney, R. J. (2004). Collective information extraction with relational markov networks. Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (pp. 439-446).
4. Chakrabarti, S., Dom, B., & Indyk, P. (1998). Enhanced hypertext categorization using hyperlinks. SIGMOD Rec., 27, 307-318.
5. Duchi, J., Tarlow, D., Elidan, G., & Koller, D. (2007). Using combinatorial optimization within max-product belief propagation. Advances in Neural Information Processing Systems (NIPS 2006).
6. Finkel, J. R., Grenager, T., & Manning, C. D. (2005). Incorporating non-local information into information extraction systems by gibbs sampling. ACL.
7. Jensen, D., Neville, J., & Gallagher, B. (2004). Why collective inference improves relational classification. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
8. Kleinberg, J., & Tardos, E. (2002). Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM, 49, 616-639.
9. Kolmogorov, V. (2004). Convergent tree-reweighted message passing for energy minimization (Technical Report MSR-TR.-2004-90). Microsoft Research (MSR).
10. Kolmogorov, V., & Wainwright, M. J. (2005). On the optimally of tree-reweighted max-product message passing. UAI.
11. Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26.
12. Krishnan, V., & Manning, C. D. (2006). An effective two-stage model for exploiting non-local dependencies in named entity recognition. ACL-COLING.
13. Lu, Q., & Getoor, L. (2003). Link-based classification. Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), August 21-24, 2003, Washington, DC, USA (pp. 496-503).
14. Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity, chapter 11, 247-254. Prentice Hall, Englewood Cliffs, NJ.
15. Ravikumar, P., & Lafferty, J. (2006). Quadratic programming relaxations for metric labeling and markov random field map estimation. ICML.
16. Sutton, C., & McCallum, A. (2004). Collective segmentation and labeling of distant entities in information extraction (Technical Report TR # 04-49). University of Massachusetts. Presented at ICML Workshop on Statistical Relational Learning and Its Connections to Other Fields.
17. Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006). A comparative study of energy minimization methods for markov random fields. In Ninth European Conference on Computer Vision (ECCV 2006) (pp. 16-29).
18. Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI02), Edmonton, Canada.
19. Taskar, B., Chatalbashev, V., & Koller, D. (2004). Learning associative markov networks. Twenty First International Conference on Machine Learning (ICML04), Banff, Canada..