Piecewise training for undirected models

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 568-575

  Sutton, Charles ^a   McCallum, Andrew ^a  

^a The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; LOG PARTITION FUNCTION; MARGINAL DISTRIBUTION; NATURAL LANGUAGES; PARTITION FUNCTIONS; PIECEWISE METHODS; PSEUDO-LIKELIHOOD; TRAINING EXAMPLE;

ARTIFICIAL INTELLIGENCE;

EID: 80053230819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Julian Besag. Statistical analysis of non-lattice data. The Statistician, 24(3):179-195, 1975.
2. Julian Besag. Efficiency of pseudolikelihood estimation for simple gaussian fields. Biometrika, 64(3):616-618, 1977. (Pubitemid 8238543)
3. Razvan Bunescu and Raymond J. Mooney. Collective information extraction with relational Markov networks. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004.
4. W.T. Freeman, E.C. Pasztor, and O.T. Carmichael. Learning low-level vision. International Journal of Computer Vision, 40(1):24-57, 2000.
5. Dayne Freitag. Machine Learning for Information Extraction in Informal Domains. PhD thesis, Carnegie Mellon University, 1998.
6. Zoubin Ghahramani and Michael I. Jordan. Factorial hidden Markov models. Machine Learning, (29):245-273, 1997. (Pubitemid 127510040)
7. Russ Greiner, Yuhong Guo, and Dale Schuurmans. Learning coordination classifiers. In Nineteenth International Joint Conference on Artificial Intelligence, 2005. To appear.
8. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. Proc. 18th International Conf. on Machine Learning, 2001.
9. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330, 1993.
10. Andrew McCallum and Wei Li. Early results for named entity recognition with conditional random fields, feature induction and web-enhanced lexicons. In Seventh Conference on Natural Language Learning (CoNLL), 2003.
11. Erik F. Tjong Kim Sang and Sabine Buchholz. Introduction to the CoNLL-2000 shared task: Chunking. In Proceedings of CoNLL-2000 and LLL-2000, 2000. See http://lcg-www.uia.ac.be/~erikt/research/np-chunking.html.
12. Charles Sutton and Andrew McCallum. Collective segmentation and labeling of distant entities in information extraction. Technical Report TR # 04-49, University of Massachusetts, July 2004. Presented at ICML Workshop on Statistical Relational Learning and Its Connections to Other Fields.
13. Charles Sutton, Khashayar Rohanimanesh, and AndrewMcCallum. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML), 2004.
14. Ben Taskar, Pieter Abbeel, and Daphne Koller. Discriminative probabilistic models for relational data. In Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI02), 2002.
15. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. A new class of upper bounds on the log partition function. In Uncertainty in Artificial Intelligence, 2002.
16. Ben Wellner, Andrew McCallum, Fuchun Peng, and Michael Hay. An integrated, conditional model of information extraction and coreference with application to citation graph construction. In 20th Conference on Uncertainty in Artificial Intelligence (UAI), 2004.