Positive unlabeled learning for deriving protein interaction networks

Abstract

Binary classification is the process of labeling the members of a given data set on the basis of whether they have some property or not. To train a binary classifier, normally one needs two sets of examples from each group, usually named as positive and negative examples. However, in some domains, negative examples are either hard to obtain or even not available at all. In these problems, data consist of positive and unlabeled examples. This paper first presents a survey of algorithms which can handle such problems, and then it provides a comparison of some of these algorithms on the protein-protein interaction derivation problem by using the available (positive) interaction information. © 2012 Springer-Verlag.