Representing sentence structure in Hidden Markov Models for information extraction

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 1273-1279

  Ray, Soumya ^a   Craven, Mark ^b  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF WISCONSIN SCHOOL OF MEDICINE AND PUBLIC HEALTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATION; BIOMEDICAL DOMAIN; FREE TEXTS; GRAMMATICAL STRUCTURE; HIDDEN MARKOV MODELS (HMMS); HMM TRAINING; OBJECTIVE FUNCTIONS; SENTENCE STRUCTURES;

ARTIFICIAL INTELLIGENCE;

HIDDEN MARKOV MODELS;

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

References (15)

1. L. E. Baum. An equality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. Inequalities, 3:1-8, 1972.
2. Center for Medical Genetics, Johns Hopkins University and National Center for Biotechnology Information. Online Mendelian inheritance in man, OMIM (TM), 2001. http://www.ncbi.nlm.nih.gov/omim/.
3. B. Cestnik. Estimating probabilities: A crucial task in machine learning. In Proceedings of the Ninth European Conference on Artificial Intelligence, pages 147-150, Stockholm, Sweden, 1990. Pitman.
4. D. Freitag and A. McCallum. Information extraction with HMMs and shrinkage. In Working Notes of the AAAI-99 Workshop on Machine Learning for Information Extraction, Orlando, FL, 1999. AAAI Press.
5. D. Freitag and A. McCallum. Information extraction with HMM structures learned by stochastic optimization. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, TX, 2000. AAAI Press.
6. P. E. Hodges, W. E. Payne, and J. I. Garrels. Yeast protein database (YPD): A database for the complete proteome of saccharomyces cerevisiae. Nucleic Acids Research, 26:68-72, 1998.
7. A. Krogh. Hidden Markov models for labeled sequences. In Proceedings of the Twelfth International Conference on Pattern Recognition, pages 140-144, Jerusalem, Israel, 1994. IEEE Computer Society Press.
8. T. Leek. Information extraction using hidden Markov models. Master's thesis, Department of Computer Science and Engineering, University of California, San Diego, CA, 1997.
9. A. McCallum, D. Freitag, and F. Pereira. Maximum entropy Markov models for information extraction and segmentation. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 591-598, Stanford, CA, 2000. Morgan Kaufmann.
10. National Library of Medicine. The MEDLINE database, 2001. http://www.ncbi.nlm.nih.gov/PubMed/.
11. M. F. Porter. An algorithm for suffix stripping. Program, 14(3):127-130, 1980.
12. L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-286, 1989.
13. E. Riloff. An empirical study of automated dictionary construction for information extraction in three domains. Artificial Intelligence, 85:101-134, 1996. (Pubitemid 126363728)
14. E. Riloff. The Sundance sentence analyzer, 1998. http://www.cs.utah.edu/ projects/nlp/.
15. K. Seymore, A. McCallum, and R. Rosenfeld. Learning hidden Markov model structure for information extraction. In Working Notes of the AAAI Workshop on Machine Learning for Information Extraction, pages 37-42. AAAI Press, 1999.