Uncovering protein interaction in abstracts and text using a novel linear model and word proximity networks.
BACKGROUND
We participated in three of the protein-protein interaction subtasks of the Second BioCreative Challenge: classification of abstracts relevant for protein-protein interaction (interaction article subtask [IAS]), discovery of protein pairs (interaction pair subtask [IPS]), and identification of text passages characterizing protein interaction (interaction sentences subtask [ISS]) in full-text documents. We approached the abstract classification task with a novel, lightweight linear model inspired by spam detection techniques, as well as an uncertainty-based integration scheme. We also used a support vector machine and singular value decomposition on the same features for comparison purposes. Our approach to the full-text subtasks (protein pair and passage identification) includes a feature expansion method based on word proximity networks.


RESULTS
Our approach to the abstract classification task (IAS) was among the top submissions for this task in terms of measures of performance used in the challenge evaluation (accuracy, F-score, and area under the receiver operating characteristic curve). We also report on a web tool that we produced using our approach: the Protein Interaction Abstract Relevance Evaluator (PIARE). Our approach to the full-text tasks resulted in one of the highest recall rates as well as mean reciprocal rank of correct passages.


CONCLUSIONS
Our approach to abstract classification shows that a simple linear model, using relatively few features, can generalize and uncover the conceptual nature of protein-protein interactions from the bibliome. Because the novel approach is based on a rather lightweight linear model, it can easily be ported and applied to similar problems. In full-text problems, the expansion of word features with word proximity networks is shown to be useful, although the need for some improvements is discussed.
Abi-Haidar
Alaa
A
School of Informatics, Indiana University, Bloomington, IN 47405, USA.
Kaur
Jasleen
J
Maguitman
Ana
A
Radivojac
Predrag
P
Rechtsteiner
Andreas
A
Verspoor
Karin
K
Wang
Zhiping
Z
Rocha
Luis M
LM
D000043:Abstracting and Indexing; D000465:Algorithms; D019540:Area Under Curve; D016206:Databases, Bibliographic; D016014:Linear Models; D011485:Protein Binding; D012660:Semantics