Two-phase learning for biological event extraction and verification

ABSTRACT

Many previous biological event-extraction systems were based on hand-crafted rules which were specifically tuned to a specific biological application domain. But manually constructing and tuning the rules are time-consuming processes and make the systems less portable. So supervised machine-learning methods were developed to generate the extraction rules automatically, but accepting the trade-off between precision and recall (high recall with low precision, and vice versa) is a barrier to improving performance. To make matters worse, a text in the biological domain is more complex because it often contains more than two biological events in a sentence, and one event in a noun chunk can be an entity for the other event. As a result, there are as yet no systems that give a good performance in extracting events in biological domains by using supervised machine learning.To overcome the limitations of previous systems and the complexity of biological texts, we present the following new ideas. First, we adopted a supervised machine-learning method to reduce the human effort in making extraction rules in order to obtain a highly domain-portable system. Second, we overcame the classical trade-off between precision and recall by using an event component verification method. Thus, machine learning occurs in two phases in our architecture. In the first phase, the system focuses on improving recall in extracting events between biological entities during a supervised machine-learning period. After extracting the biological events with automatically learned rules, in the second phase the system removes incorrect biological events by verifying the extracted event components with a maximum entropy (ME) classification method. In other words, the system targets for high recall in the first phase and tries to achieve high precision with a classifier in the second phase. Finally, we improved a supervised machine-learning algorithm so that it could learn a rule in a noun chunk and a rule extending throughout a sentence at two different levels, separately, for nested biological events.

REFERENCES

• 1: Christian Blaschke , Miguel A. Andrade , Christos Ouzounis , Alfonso Valencia, Automatic Extraction of Biological Information from Scientific Text: Protein-Protein Interactions, Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, p.60-67, August 06-10, 1999
• 2: Bunescu, R., Ge, R., Kate, R. J., Marcotte, E. M., Mooney, R. J., Ramani. A. K., and Wong, Y. W. 2004. Comparative experiments on learning information extractors for proteins and their interactions. J. Artif. Intell. Medicine (Dec. 2004). Available online: http://www.sciencedirect.com/.
• 3: Nikolai Daraselia , Anton Yuryev , Sergei Egorov , Svetalana Novichkova , Alexander Nikitin , Ilya Mazo, Extracting human protein interactions from MEDLINE using a full-sentence parser, Bioinformatics, v.20 n.5, p.604-611, March 2004 [doi>10.1093/bioinformatics/btg452]
• 4: Gildea, D. 2001. Corpus variation and parser performance. In Proceedings of the Conference on Empirical Methods in Natural Language Processing.
• 5: Park, J. C., Kim, H. S., and Kim, J. J. 2001. Bidirectional incremental parsing for automatic pathway identification with combinatory categorical grammar. Pac. Symp. Biocomput.
• 6: Pustejovsky, J., Castano, J., Kotechi, M., and Cochran, B. 2002. Robust relational parsing over biomedical literature: Extracting inhibit relations. Pac. Symp. Biocomput. 362--373.
• 7: Thomas C. Rindflesch , Jayant V. Rajan , Lawrence Hunter, Extracting molecular binding relationships from biomedical text, Proceedings of the sixth conference on Applied natural language processing, p.188-195, April 29-May 04, 2000, Seattle, Washington [doi>10.3115/974147.974173]
• 8: Rosenfeld, R. 1996. A maximum entropy approach to adaptive statistical language modeling. Computer, Speech and Language 10, 187--228.
• 9: Sekimizu, T., Park, H. S., and Tsuijii, J. 1998. Identifying the interaction between genes and gene products based on frequently seen verbs in Medline abstracts. In Proceedings of the Genome Informatics Workshop, 62--71.
• 10: Stephen Soderland, Learning Information Extraction Rules for Semi-Structured and Free Text, Machine Learning, v.34 n.1-3, p.233-272, Feb. 1999
• 11: Thomas, J., Milward, D., Ousounis, C., Pulman, S., and Carroll, M. 2000. Automatic extraction of protein interactions from scientific abstracts. Pac. Symp. Biocomput. 5, 541--552.
• 12: Jun Wu , Sanjeev Khudanpur, Maximum entropy language modeling with non-local dependencies, 2003
• 13: Yakushiji, A., Tateisi, Y., and Miyao, Y. 2001. Event extraction from biomedical papers using a full parser. Pac. Symp. Biocomput.
• 14: Tong Zhang , Fred Damerau , David Johnson, Text chunking using regularized Winnow, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, p.539-546, July 06-11, 2001, Toulouse, France [doi>10.3115/1073012.1073081]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.7 Natural Language Processing
          Subjects: Text analysis

General Terms:
Algorithms, Design, Experimentation

Keywords:
Biological event extraction, event component verification, two-level supervised machine learning