Functional Genomics, Genetics, and Bioinformatics 2016View this Special Issue
Research Article | Open Access
Lei Hua, Chanqin Quan, "A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction", BioMed Research International, vol. 2016, Article ID 8479587, 9 pages, 2016. https://doi.org/10.1155/2016/8479587
A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction
The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method only takes the sdp and word embedding as input and could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task.
Biomedical relations play an important role in biologic processes and are widely researched in the field of biomedical natural language processing (BioNLP). PPI task aims to extract protein interactions; for example, in sentence “The distribution of actin filaments is altered by profilin overexpression,” the interaction between protein entities “actin” and “profilin” would be extracted. A number of databases, such as BIND , MINT , and IntAct , had been created to store structured interactions. However, the biomedical literature regarding protein interactions is expanding rapidly, making it difficult for these databases to keep up with the latest protein-protein interactions. Consequently, effective and automatic protein-protein relation extraction systems become more significant.
Previous researches have illustrated the effectiveness of the shortest dependency path (sdp) between entities for relation extraction in many fields [4–7]. For example, in PPI task,  proposed an edit-distance kernel based on sdp and classified the relations by SVM. Reference  has made a detailed investigation into the relevant work of relation extraction and elaborated the important role of sdp in relation extraction. However, how to preprocess the sdp (e.g., using a variety of kernels) and how to combine different features (e.g., part-of-speech, -grams, and parser tree) still are open problems. In this work, the proposed approach takes raw sdp as the only input, and it can learn features automatically. And thus, different from previous researches, manual feature selection and feature combination are not necessary in our approach.
Many efforts have been done on PPI task, especially the kernel based methods. Most of these methods take the PPI task as a binary classification problem by determining whether there is an interaction between the two entities. The kernels include bag-of-words kernel , all-path kernel , subset-tree kernel , edit-distance kernel , and graph kernel , and they have shown effectiveness in PPI task. Considering that single kernel partly calculates the similarity of two instances, hybrid kernel [14–17] has been proposed and demonstrated much better performance than single kernel. Kernel methods are effective, because they integrate a large amount of manually selected features. The problem of existing kernel based method is how to combine different features; in most cases, sophisticated design is required.
Deep learning methods have achieved remarkable results in computer vision  and speech recognition , and due to much of the effective work involved in neural network language models (NNLM) [20, 21], recently, some work has focused on neural network especially CNN for natural language processing (NLP) problem. Using CNN to extract features for NLP was previously researched by the authors in ; they considered the tasks including part-of-speech (POS), chunking, name entity recognition (NER), and semantic role labeling (SRL) as sequential labeling problems. In recent years, researches have proposed the use of CNN to extract features for relation extraction. Reference  combined the word representation, lexical level features, and word features and used the CNN model to learn the sentence-level features; the features were then concatenated into a vector and fed to a Softmax layer to classify the relationship. Reference  shared a similar idea to ; the authors proposed a new logistic loss function and a pairwise method to train their CNN model.
However, the CNN based methods described by [23, 24] usually take whole sentence or the context between two target entities as input. The problem of these methods is that such representations fail to describe the relationships of two target entities far in sentence distance, and the irrelevant information may also be considered due to the long distance. Considering the described problems and the complexity of PPI task, in this work, we use dependency parsing to analyze the sentence for generating the sdp at first to capture semantical and syntactical features and then send sdp to sdpCNN for classification.
Comparing with the prior work, the contributions of our work can be concluded as follows:(1)We propose a new model (sdpCNN) to tackle PPI task and show that sdpCNN model built on word embedding is effective in extracting protein-protein relations.(2)We demonstrate that sdpCNN with pretrained word embedding performs much better than randomly generated word embedding and state-of-the-art kernel based methods. It could be concluded that the well pretrained word embedding is important in PPI task.(3)The proposed model is able to extract key features automatically such that the manual feature selection procedure can be avoided.
2. Material and Methods
In this section, we firstly introduce word embedding, and then we describe the proposed sdpCNN model in detail. The proposed model consists of three parts: the sdp extraction, sdpCNN based feature extraction, and multilayer perceptron (MLP) based classification.
2.1. Introduction for Word Embedding
Word embedding is a feature learning technique in NLP where words or phrases from the vocabulary are mapped to vectors of real numbers in a low-dimensional space relative to the vocabulary size. Many methods have been proposed to train the word embedding, but most of the methods are based on the distributional hypothesis: words that occur in similar contexts tend to have similar meanings. Given this hypothesis, the trained word embeddings would be close to each other in vector space when the words contain similar meanings (Figure 1 shows visualization of word embedding by t-SNE ).
In this work, we use public available pretrained word embedding (300-dimension), trained on 100 billion words from Google News by word2vec  (https://code.google.com/archive/p/word2vec/), to build the proposed sdpCNN model.
Compared with traditional “one-hot” representation, pretrained word embedding brings about three advantages. It could capture semantic information and weaken word gap problem; for example, in Figure 1, interaction verbs (interaction verbs usually indicate the relation among entities and thus they are important in PPI task) “affects” and “enhance” are clustered together; however, in traditional “one-hot” representation, the verbs “affects” and “enhance” are completely different. Data sparseness problem could be avoided since all words are mapped into low-dimensional vectors. Pretrained word embedding is trained on large unlabeled corpora, and thus it could enlarge the coverage of vocabulary and decrease the number of unknown words.
2.2. Shortest Dependency Path (sdp) Extraction
Semantic dependency parsing had been frequently used to dissect sentence and to capture word semantic information close in context but far in sentence distance. To extract the relationship between two entities, the most direct approach is to use sdp. The motivation of using sdp is based on the observation that the sdp between entities usually contains necessary information to identify their relationship . For example, in Figure 2, the word “affects” in sdp provides useful information for classifying two target proteins, and the dependency relationship such as “nsubj” (the dependency relation “nsubj” represents “nominal subject,” and the governor of this relation is always a verb, because interaction verbs are crucial in PPI task; thus, this dependency relation is important in PPI task; more detailed descriptions for relation “nsubj” can be found in ) between words “profilin” and “affects” also adds supplemental information for classification.
To reduce the sparseness and ensure the generalization of features, we replace two target proteins with special symbols “Protein1” and “Protein2,” respectively, and thus we can get a sdp “Protein1-nsubj-affects-dobj-properties-prep-of-Protein2” from Figure 2.
2.3. sdpCNN Model for Feature Extraction
Figure 3 shows the architecture of the proposed sdpCNN model. In the first step, the model transforms a sdp into a matrix representation by looking up pretrained word embedding; and then, a convolution layer is applied to this matrix to automatically extract the features. The following max-pooling operation generates the most useful local features. At last, the extracted features are fed to a multilayer perceptron (MLP) with a hidden layer and a Softmax classifier.
For notation, we use to represent pretrained word embedding, where is the vocabulary of corpora and is the dimension of word embedding. Suppose is an input sdp with length (we fix the length of input path as by truncating or padding special symbol “PADDING”). When we assign each word in sdp with a corresponding row vector from , we would get a matrix representation for input sdp (yellow part in Figure 3).
The convolutional operation would be considered to apply filter to the -word window in input sdp . An -word window in input sdp can be represented as (yellow part surrounded with red rectangle in Figure 3) by connecting row to in . A feature can be generated bywhere is an activation function such as hyperbolic tangent (tanh), is the bias term, and is element-wise multiplication. By applying filter to each word window of the input sdp, the model will produce a new feature which we call feature map in
Max-pooling operation (see (3)) takes the maximum value over all the word windows in feature map which brings about two advantages: it could extract the most important local features and it reduces the computational complexity by reducing the feature dimension. Hence,
As each filter produces a feature , multiple filters will generate multiple features. Suppose is the number of the filters; the model would get fixed-size distributed features , where is the th feature generated by th filter.
2.4. MLP for Classification
A MLP model is employed to calculate the probability of each class. Given the distributed representation , the full-connection weight matrix , the number of hidden layers , and the bias term , the output of full-connection layer is calculated by
Before applying Softmax layer for classification, the original feature space is transformed into confidence space. The input for Softmax layer is described bywhere is a transformation matrix and is the number of classes. This task is binary classification, so is 2.
Each value in represents the confidence of the current sample that belongs to each class. A Softmax layer normalizes the confidence to . Given , the output of Softmax layer . The Softmax operation can be calculated by (6). Both and represent probability of sdp that belongs to class . Hence,
2.5. Training Procedure
There are several parameters that need to be updated during the training: the multifilter , the full-connection weight , the transformation matrix , and the bias terms and . All of the parameters are represented by . We apply Negative Log-Likelihood (NLL) in (7) ( is annotated label for the input sdp ) as loss function. In order to minimize the loss function, we use gradient descent (GD) based method to learn the network parameters. For each input pair , we calculate the gradient (using the chain rules) of each parameter relative to loss and update each parameter with learning rate by (8). It is notable that fixed learning rate would lead to unstable loss in training. In this work, we use an improved GD based algorithm, Adadelta , to update the parameters in each training step. Adadelta is able to dynamically adjust the learning rate. Hence,
3.1. Experimental Setup
Two standard datasets (both datasets are available at http://corpora.informatik.hu-berlin.de/), Aimed and BioInfer , are used to evaluate our model. Aimed was manually tagged by  which included about 200 medical abstracts with around 1900 sentences and was considered as a standard dataset for PPI task. BioInfer was developed by Turku BioNLP group (see details at http://bionlp.utu.fi/) which contained about 1100 sentences. If there is an interaction between the two entities, we consider this instance as a positive one; otherwise, we consider it as a negative one (in Table 1). Text preprocessing includes sentence splitting, word segmentation, and dependency parsing (Stanford parser was utilized).
3.1.2. Word Embedding Initialization
In experiments, we compare the performances of pretrained embedding with randomly initialized word embedding. When the words that appeared in the datasets are not included in the pretrained word embedding, we follow  and initialize word embedding by randomly sampling from , where is the variance of pretrained word embedding trained by word2vec. For random part, all of the words are initialized by sampling from .
3.1.3. Model Hyperparameters Settings
We experimentally choose the hyperparameters for the model on BioInfer and Aimed datasets shown in Table 2. The Discussion gives details on parameter selection as well as the impact of the parameters.
3.1.4. Evaluation Metrics
We use precision (), recall (), and -score () to evaluate the performances of our sdpCNN model. is the harmonic mean of recall and precision which is defined by (9). 10-cross-validation (10-fold CV) method is used to calculate the average -scores. Hence,
3.2. Performance Comparison
We evaluate our system and compare the performance with state-of-the-art kernel based methods. We start from a baseline model with randomly initialized word embedding, and then we evaluate our model with the pretrained word embedding. Table 3 shows the comparison results in detail.
We firstly compare the performance with other sdp based methods, and then we compare the results with hybrid kernels based methods. The descriptions for methods in Table 3 are as follows: Walk-Weighted Subsequence Kernel . Generating sdp at first and then integrating the proposed e-walk and v-walk kernels for classification. Graph Kernel . Encoding the dependency parser results into a graph, proposing an all-path graph kernel by leveraging sdp; at last, least squares support vector machine is used for classification. SDP-CPT . Using both sdp and directed constituent parser tree for classification. Tree Kernel . On the bias of SDP-CPT, considering the modal verb phrases and appositive dependency features. Edit-Distance Kernel . A semisupervised machine learning approach (TSVM) with edit-distance kernel based on sdp. Hybrid Kernel . A combination of bag-of-words (BOW) kernel, subset-tree (ST) kernel, and graph kernel. Multiple Features and Parser . A combination of rich features including bag-of-words features, sdp features, and graph features. Multiple Kernel . A weighted multiple kernel by combining parser tree, graph features, POS, and sdp.
As we can see, kernel methods listed in Table 3 usually require sophisticated design and complex feature combination, and feature engineering still accounts for a large proportion of these systems. In this work, we avoid manual features selection and features combination by using CNN. In addition, the features used in these kernel based methods are all discrete; therefore, the “word gap” problem is inevitable, while, by leveraging word embedding and CNN, we can train our model in continuous space and avoid hard assignment.
The main differences of the sdp based methods listed in Table 3 are how sdps were used and how similarity functions were calculated. For example, the most direct way is to encode sdp into “one-hot” representation and use SVM for classification [4, 6]. Another way is by using edit-distance kernel  to calculate the similarity of two sdps through Levenshtein distance. Compared with these sdp based methods in Table 3, even the baseline model achieved competitive results. Furthermore, pretrained sdpCNN model improved the -scores by 12.4 and 6.4 compared with tree kernel  and edit-distance kernel  on BioInfer and Aimed datasets, respectively.
It has been verified that a combination of multiple kernels could improve the effectiveness of kernel based PPI extraction methods. Kernels such as tree kernel, graph kernel, and bag-of-words kernel are commonly used in hybrid kernel based methods. Compared with the methods listed in Table 3, the baseline model alone yielded competitive results and improved the -scores by 5.3 on BioInfer dataset when compared with . By integrating pretrained word embedding, our pretrained sdpCNN model exceeded 7.1 and 1.6 compared with [14, 32] on BioInfer and Aimed datasets in Table 3. The experimental results showed that, with the appropriate expression (the sdp in this work) of the relationship, the sdpCNN model built on word embedding can get much better results than the combination of a variety of features (or kernels).
For better understanding extracted features by sdpCNN, Figure 3 illustrates the way of generating a feature map in sdpCNN model. By following the negative direction of the red arrows in Figure 3, we can find which word window contributes most to the final classifier. Considering the example in Figure 3, the 3-word window (“Proteins nsubj affects”) circled with a red rectangle is key item. We define the word in the middle of the key word window as key-word, and thus the word “nsubj” in the middle of the 3-word window “Proteins nsubj affects” in Figure 3 is key-word. Each filter produces a key-word; consequently, filters will generate key-words. In our experiments, we noticed that interaction verbs such as “inhibits,” “cause,” and “bind” were often chosen as key-words by sdpCNN model. Generally, the construction of an interaction verbs dictionary manually requires a great deal of time and effort, but our model can extract these verbs automatically.
Moreover, the experimental results also showed that the proposed method achieved considerably higher precision (73.4 on BioInfer dataset and 64.8 on Aimed dataset) than the existing approaches.
3.3. Evaluation on Different Scales of Training Data
In order to investigate the effect of different scales of training data, we split the original datasets by different ratios. Figure 4 shows the changes of performance on different scales of training data. As we can see, the performance varied significantly depending on the size of training and test corpus, and -scores changed from 75.1 to 48.2 on BioInfer dataset and 71.1 to 36.2 on Aimed dataset when proportion of test data ranged from 0.1 to 0.9; too few training data would have the risk of loss of data information; as a result, the trained sdpCNN model cannot well generalize the original data which would lead to poor performance.
In this section, we firstly investigate the impact of hyperparameters and provide general parameters settings for sdpCNN. After that, we compare the performances among the four proposed methods in Table 5. At last, we manually analyze the errors of sdpCNN alone with the possible solutions to errors.
3.4.1. The Influence of Different Hyperparameters Settings
Consider the following:(1)Window size : a 3-word window is commonly used in many related works [22–24]; we tested a 2-word window on both Aimed and BioInfer datasets. On Aimed dataset, the results remained essentially unchanged; however, when tested on BioInfer dataset, -scores reduced by 5. We also tested a 4-word window, while, in this experiment, performances are markedly inferior on both datasets, which means a 4-word window is too long to capture the structure information.(2)The length of fixed-size sdp : the lengths of most paths (more than 95%) in Aimed dataset are less than 20, while, in BioInfer dataset, most of the path lengths (more than 95%) are less than 30. And thus we set with 20 and 30 on Aimed and BioInfer datasets, respectively.(3)The filters size : due to the limited size of corpora, when the filters size is too big, the model is prone to overfitting; we heuristically choose as 100 in our experiments.(4)The number of full-connection layer units : based on the idea of , the appropriate increment of full-connection layer units could improve the performance. But too many units also suffer from overfitting, so we set with 500 in this experiment.
3.4.2. Comparisons among the Four Proposed Models
Random sdpCNN Model versus Pretrained sdpCNN Model. From Table 3, we can find that the pretrained sdpCNN model performed much better than random sdpCNN model and improved the -scores by 1.8 and 3.3 on BioInfer and Aimed datasets, respectively. Intuitively, the pretrained word embedding could capture the semantic information of words, which means words with similar semantics are clustered together in the vector space (Figure 1). Table 4 shows the examples of neighboring words of target words based on cosine similarity; we can see that word, for example, “affect,” shares a similar meaning with words “impacting,” “jeopardize,” and so forth. However, when we randomly allocated the word embedding, semantic information among words would be discarded; as a result, random sdpCNN model might correctly classify the sentence “Protein1 affects Protein2” but fails on the sentence “Protein1 impacts Protein2” although both sentences indicate interactions. Random sdpCNN model is somewhat similar to the “one-hot” model; the trained random sdpCNN model can be well applied to the test data only when train and test instances contain common words which means this model is too dependent on cooccurrence of words and lacks good generalization ability. However, as a benefit from sdp and CNN, the structure information could be well preserved; therefore, random sdpCNN model still achieved comparable results. More specifically, it could be concluded that pretrained sdpCNN model can capture both semantic information and structural information, while the random sdpCNN model could only keep structural information. Both semantic information and structural information play important roles in PPI task.
Random sdpCNN Model versus Random (Update) sdpCNN Model. In random (update) sdpCNN model, we considered word embedding as hyperparameters and updated it in the training procedure. The experimental results showed that the random (update) sdpCNN model had a slight improvement (0.7 and 0.6 -scores improvements on BioInfer and Aimed datasets, resp.) compared with the random sdpCNN model. Intuitively, the random (update) sdpCNN model can adapt to the specific task by fine-tuning word embedding which means word embedding can learn task specific patterns. However, when compared with pretrained sdpCNN model, the model’s performances reduced by 1.1 and 2.7 on BioInfer and Aimed datasets. The good performance on pretrained sdpCNN model is understandable due to the fact that the pretrained word embedding is trained on large corpora which ensures that the pretrained sdpCNN model could obtain abundant semantic information. Moreover, because the pretrained sdpCNN model does not need to update word embedding, the training time consumption could be reduced.
Combined Model versus Pretrained sdpCNN Model. To better learn the representation of the raw sdp input, we also proposed a model that combined the pretrained and random word embedding (see details in Table 5). The combined model improved the -scores by 0.6 on Aimed corpus and kept the performance on BioInfer corpus when compared with pretrained sdpCNN model. However, it is also notable that the combined model would take more than two times the cost on training time. There is always a trade-off between time and performance.
Among these four models, pretrained sdpCNN model is more time-saving (relative to combined model and random (update) sdpCNN model), robust (relative to random (update) sdpCNN model), and effective (relative to random (update) sdpCNN model and random sdpCNN model). In conclusion, a CNN model built on high-quality pretrained word embedding could be considered as an effective alternative in PPI task.
3.4.3. Errors Analysis
Confined to the complexity and diversity of the biomedical expressions, extracting relations from biological articles remains a big challenge. In this subsection, we carefully analyze the errors of sdpCNN and list the three typical errors as follows:(1)When an input sentence is too long, the Stanford dependency analysis tool is prone to errors, and because our model is built on sdp the propagation of errors would lead to poor performance of sdpCNN.(2)When irrelevant interaction verbs are included in sdp, as mentioned before, interaction verbs strongly suggest interactions; as a result, the model would make a mistake.(3)Randomly initialized word embedding would also hurt the system’s performance. In our system, the dependency relations such as “nsubj” and “prep-of” are all considered as input words, and such words are not likely to be included in pretrained word embedding, and thus these words are randomly assigned with vectors. As a result, “nsubj” and “prep-of” might be far from each other in vector space. For example, for two input paths “Protein1-nsubj-bind-nsubj-Protein2” and “Protein1-nsubj-bind-prep-of-Protein2,” both paths indicate interactions; however, the sdpCNN model could only distinguish the first one.
The possible solutions for the mentioned errors are described as follows: the first error could be weakened by integrating the context between two target entities, because the context could provide supplementary information when standard tools fail to capture dependency relations among words. As for the second error, a possible solution is to introduce position information, because, in most of the time, the relevant interaction verbs locate in the middle of two target entities. For randomly initialized word embedding problem, we might take word embedding as hyperparameter and update it during the training. Meanwhile, word embedding used in this work is trained on large unlabeled Google News; it would be better to train word embedding on large biological articles to enrich semantic information.
In this paper, we have described a sdpCNN model built on word embedding for PPI task. Experiments demonstrated that our method outperformed the state-of-the-art kernel based methods. The main contribution of the proposed method is the integration of word embedding, sdp, and CNN. Word embedding is able to capture semantic information and effectively weaken word gap problem. By applying sdp and CNN, the proposed model could make full use of structure information and avoid manual feature selection. Our experimental results also indicated that the raw sdp input is crucial to describe protein-protein relationship in PPI task; the CNN model is useful to capture the local features and structure information; high-quality pretrained word embedding is important in PPI task. Through error analysis, we notice that there still is room for improvement. In our future work, we would like to train our own word embedding and design our PPI system by making full use of context information, position information, and sdp.
The authors declare that they have no competing interests.
This research has been partially supported by the National Natural Science Foundation of China under Grant no. 61472117 and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.
- G. D. Bader, D. Betel, and C. W. V. Hogue, “BIND: the biomolecular interaction network database,” Nucleic Acids Research, vol. 31, no. 1, pp. 248–250, 2003.
- A. Zanzoni, L. Montecchi-Palazzi, M. Quondam, G. Ausiello, M. Helmer-Citterich, and G. Cesareni, “MINT: a molecular interaction database,” FEBS Letters, vol. 513, no. 1, pp. 135–140, 2002.
- S. Kerrien, B. Aranda, L. Breuza, and A. Bridge, “The intact molecular interaction database in 2012,” Nucleic Acids Research, vol. 38, article D525, 2012.
- L. Qian and G. Zhou, “Tree kernel-based protein-protein interaction extraction from biomedical literature,” Journal of Biomedical Informatics, vol. 45, no. 3, pp. 535–543, 2012.
- C. Quan, M. Wang, and F. Ren, “An unsupervised text mining method for relation extraction from biomedical literature,” PLoS ONE, vol. 9, no. 7, Article ID e102039, 2014.
- C. Ma, Y. Zhang, and M. Zhang, “Tree Kernel-based protein-protein interaction extraction considering both modal verb phrases and appositive dependency features,” in Proceedings of the 24th International Conference on World Wide Web Companion, pp. 655–660, International World Wide Web Conferences Steering Committee, Florence, Italy, May 2015.
- R. C. Bunescu, R. Ge, R. J. Kate et al., “Comparative experiments on learning information extractors for proteins and their interactions,” Artificial Intelligence in Medicine, vol. 33, no. 2, pp. 139–155, 2005.
- G. Erkan, A. Özgür, and D. R. Radev, “Semi-supervised classification for extracting protein interaction sentences using dependency parsing,” in Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL '07), vol. 7, pp. 228–237, Prague, Czech Republic, June 2007.
- R. C. Bunescu and R. J. Mooney, “A shortest path dependency kernel for relation extraction,” in Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 724–731, Association for Computational Linguistics, Vancouver, Canada, October 2005.
- R. Sætrea, K. Sagae, and J. Tsujii, “Syntactic features for protein-protein interaction extraction,” in Proceedings of the 2nd International Symposium on Languages in Biology and Medicine (LBM '07), Singapore, January 2008.
- A. Airola, S. Pyysalo, J. Björne, T. Pahikkala, F. Ginter, and T. Salakoski, “A graph kernel for protein-protein interaction extraction,” in Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing (BioNLP '08), pp. 1–9, Association for Computational Linguistics, 2008.
- A. Moschitti, “Making tree kernels practical for natural language learning,” in Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL '06), pp. 113–120, 2006.
- A. Airola, S. Pyysalo, J. Björne, T. Pahikkala, F. Ginter, and T. Salakoski, “All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning,” BMC Bioinformatics, vol. 9, article 52, 2008.
- M. Miwa, R. Sætre, Y. Miyao, and J. Tsujii, “Protein-protein interaction extraction by leveraging multiple kernels and parsers,” International Journal of Medical Informatics, vol. 78, no. 12, pp. e39–e46, 2009.
- Md. F. M. Chowdhury and A. Lavelli, “Combining tree structures, flat features and patterns for biomedical relation extraction,” in Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL '12), pp. 420–429, Association for Computational Linguistics, 2012.
- A. W. Muzaffar, F. Azam, and U. Qamar, “A relation extraction framework for biomedical text using hybrid feature set,” Computational and Mathematical Methods in Medicine, vol. 2015, Article ID 910423, 12 pages, 2015.
- D. Zhou, D. Zhong, and Y. He, “Biomedical relation extraction: from binary to complex,” Computational and Mathematical Methods in Medicine, vol. 2014, Article ID 298473, 18 pages, 2014.
- A. Krizhevsky, I. Sutskever, and G. E. Hinton, “ImageNet classification with deep convolutional neural networks,” in Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS '12), pp. 1097–1105, Lake Tahoe, Nev, USA, December 2012.
- A. Graves, A.-R. Mohamed, and G. Hinton, “Speech recognition with deep recurrent neural networks,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '13), pp. 6645–6649, IEEE, Vancouver, Canada, May 2013.
- Y. Bengio, H. Schwenk, J.-S. Senécal, F. Morin, and J.-L. Gauvain, “Neural probabilistic language models,” in Innovations in Machine Learning, pp. 137–186, Springer, Berlin, Germany, 2006.
- T. Mikolov, I. Sutskever, K. Chen, and S. Greg, “Distributed representations of words and phrases and their compositionality,” in Advances in Neural Information Processing Systems, pp. 3111–3119, Curran Associates, 2013.
- R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa, “Natural language processing (almost) from scratch,” The Journal of Machine Learning Research, vol. 12, pp. 2493–2537, 2011.
- D. Zeng, K. Liu, S. Lai, and G. Zhou, “Relation classification via convolutional deep neural network,” in Proceedings of the 25th International Conference on Computational Linguistics: Technical Papers (COLING '14), pp. 2335–2344, Dublin, Ireland, August 2014.
- C. N. dos Santos, B. Xiang, and B. Zhou, “Classifying relations by ranking with convolutional neural networks,” http://arxiv.org/abs/1504.06580.
- L. Van Der Maaten and G. Hinton, “Visualizing data using t-SNE,” Journal of Machine Learning Research, vol. 9, pp. 2579–2625, 2008.
- K. Fundel, R. Küffner, and R. Zimmer, “RelEx-relation extraction using dependency parse trees,” Bioinformatics, vol. 23, no. 3, pp. 365–371, 2007.
- M. D. Zeiler, “ADADELTA: an adaptive learning rate method,” https://arxiv.org/abs/1212.5701.
- M. Miwa, R. Sætre, Y. Miyao, and J. Tsujii, “A rich feature vector for protein-protein interaction extraction from multiple corpora,” in Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing (EMNLP '09), vol. 1, pp. 121–130, Association for Computational Linguistics, 2009.
- Y. Kim, “Convolutional neural networks for sentence classification,” 2014, https://arxiv.org/abs/1408.5882.
- S. Kim, J. Yoon, J. Yang, and S. Park, “Walk-weighted subsequence kernels for protein-protein interaction extraction,” BMC Bioinformatics, vol. 11, article 107, 2010.
- M. Miwa, R. Sætre, Y. Miyao, and J. Tsujii, “A rich feature vector for protein-protein interaction extraction from multiple corpora,” in Proceedings of the Conference on Empirical Methods in Natural Language Processing, vol. 1, pp. 121–130, Association for Computational Linguistics, August 2009.
- Z. Yang, N. Tang, X. Zhang, H. Lin, Y. Li, and Z. Yang, “Multiple kernel learning in protein-protein interaction extraction from biomedical literature,” Artificial Intelligence in Medicine, vol. 51, no. 3, pp. 163–173, 2011.
- Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2323, 1998.
Copyright © 2016 Lei Hua and Chanqin Quan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.