Department of Computer Science, Korea University, Seoul, Korea.
BMC Med Inform Decis Mak. 2013;13 Suppl 1(Suppl 1):S7. doi: 10.1186/1472-6947-13-S1-S7. Epub 2013 Apr 5.
Most previous Protein Protein Interaction (PPI) studies evaluated their algorithms' performance based on "per-instance" precision and recall, in which the instances of an interaction relation were evaluated independently. However, we argue that this standard evaluation method should be revisited. In a large corpus, the same relation can be described in various different forms and, in practice, correctly identifying not all but a small subset of them would often suffice to detect the given interaction.
In this regard, we propose a more pragmatic "per-relation" basis performance evaluation method instead of the conventional per-instance basis method. In the per-relation basis method, only a subset of a relation's instances needs to be correctly identified to make the relation positive. In this work, we also introduce a new high-precision rule-based PPI extraction algorithm. While virtually all current PPI extraction studies focus on improving F-score, aiming to balance the performance on both precision and recall, in many realistic scenarios involving large corpora, one can benefit more from a high-precision algorithm than a high-recall counterpart.
We show that our algorithm not only achieves better per-relation performance than previous solutions but also serves as a good complement to the existing PPI extraction tools. Our algorithm improves the performance of the existing tools through simple pipelining.
The significance of this research can be found in that this research brought new perspective to the performance evaluation of PPI extraction studies, which we believe is more important in practice than existing evaluation criteria. Given the new evaluation perspective, we also showed the importance of a high-precision extraction tool and validated the efficacy of our rule-based system as the high-precision tool candidate.
大多数之前的蛋白质相互作用(PPI)研究都基于“实例”精度和召回率来评估其算法的性能,其中交互关系的实例是独立评估的。然而,我们认为这种标准评估方法应该重新考虑。在一个大型语料库中,同一个关系可以用各种不同的形式来描述,而在实践中,正确识别不是所有而是其中一个小的子集通常就足以检测到给定的交互。
在这方面,我们提出了一种更务实的“关系”基础性能评估方法,而不是传统的实例基础方法。在关系基础方法中,只需要正确识别关系的一个实例子集就能使关系为正。在这项工作中,我们还引入了一种新的基于规则的高精度 PPI 提取算法。虽然当前几乎所有的 PPI 提取研究都集中在提高 F 分数上,旨在平衡精度和召回率的性能,但在涉及大型语料库的许多现实场景中,一个高精度的算法比一个高召回率的算法更有优势。
我们表明,我们的算法不仅在关系基础上的性能优于以前的解决方案,而且还可以作为现有 PPI 提取工具的良好补充。我们的算法通过简单的流水线提高了现有工具的性能。
这项研究的意义在于,它为 PPI 提取研究的性能评估带来了新的视角,我们认为这在实践中比现有的评估标准更为重要。基于新的评估视角,我们还展示了高精度提取工具的重要性,并验证了我们基于规则的系统作为高精度工具候选的有效性。