Classification Systems for Bacterial Protein-Protein Interaction Document Retrieval

Abstract

Protein-protein interaction (PPI) networks are essential to understand the fundamental processes governing cell biology. Recently, studying PPI networks becomes possible due to advances in experimental high-throughput genomics and proteomics technologies. Many interactions from such high-throughput studies and most interactions from small-scale studies are reported only in the scientific literature and thus are not accessible in a readily analyzable format. This has led to the birth of manual curation initiatives such as the International Molecular Exchange Consortium (IMEx). The manual curation of PPI knowledge can be accelerated by text mining systems to retrieve PPI-relevant articles (article retrieval) and extract PPI-relevant knowledge (information extraction). In this article, the authors focus on article retrieval and define the task as binary classification where PPI-relevant articles are positives and the others are negatives. In order to build such classifier, an annotated corpus is needed. It is very expensive to obtain an annotated corpus manually but a noisy and imbalanced annotated corpus can be obtained automatically, where a collection of positive documents can be retrieved from existing PPI knowledge bases and a large number of unlabeled documents (most of them are negatives) can be retrieved from PubMed. They compared the performance of several machine learning algorithms by varying the ratio of the number of positives to the number of unlabeled documents and the number of features used. DOI: 10.4018/jcmam.2010072003 IGI PUBLISHING This paper appears in the publication, International Journal of Computational Models and Algorithms in Medicine, Volume 1, Issue 1 edited by Aryya Gangopadhyay © 2010, IGI Global 701 E. Choc late Avenue, Hersh y PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.igi-global.com ITJ 5528 International Journal of Computational Models and Algorithms in Medicine, 1(1), 34-44, January-March 2010 35 Copyright © 2010, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. ized way and to avoid duplication of efforts, IMEx1 databases such as IntAct (http://www. ebi.ac.uk/intact), DIP (Database of Interacting Proteins; http://dip.doe-mbi.ucla.edu), MINT (Molecular Interactions Database; http://mint. bio.uniroma2.it/mint) and MPIDB (Microbial Protein Interaction Database; http://www. jcvi.org/mpidb) conduct coordinated manual literature curation. Text mining system to prioritize articles for curators according to their PPI relevance can accelerate such curation processes significantly. For example, MPIDB curators scan a whole issue (20 to 50 articles) of the Journal of Bacteriology or Molecular Microbiology and find approximately 10% of these articles report interaction experiments. Thus, the curators spend roughly 90% of their time reading irrelevant articles. A text mining system to prioritize articles for curators can be developed using supervised classification algorithms that provide certain kinds of confidence scores during classification. In order to build such systems, a class-labeled corpus is needed where PPI-relevant documents are labeled as positive and those irrelevant as negative. In many real-world applications, it is common that positive instances are explicitly included in a designated database, but it is uncommon to also include negatives in the database (Elkan & Noto, 2008). In developing a PPI mining application, PPI-relevant documents can be retrieved from existing PPI knowledge bases and unlabeled documents are available in large literature repositories such as PubMed. Learning with only positively labeled documents has great importance in this application. We consider learning with only positive labeled documents as learning from a noisy and imbalanced training set where unlabeled documents are considered as negatives with some mislabeled documents. We build a document retrieval system to assist the curation of MPIDB (Goll et al., 2008) and report our investigation of the stability of two document classification algorithms with respect to the ratio of positives and unlabeled documents in the training set and also of the impact of feature selection on the classification performance. We also propose to use different subsets of unlabeled documents and form an ensemble of classifiers. In the following, we first describe the background of classification algorithms. The experimental methods are introduced next. We then present the results and discussion, and conclude our work.