title: Learning gene regulatory networks from only positive and unlabeled data.
abstract: BACKGROUND
  Recently, supervised learning methods have been exploited to reconstruct gene regulatory networks from gene expression data. The reconstruction of a network is modeled as a binary classification problem for each pair of genes. A statistical classifier is trained to recognize the relationships between the activation profiles of gene pairs. This approach has been proven to outperform previous unsupervised methods. However, the supervised approach raises open questions. In particular, although known regulatory connections can safely be assumed to be positive training examples, obtaining negative examples is not straightforward, because definite knowledge is typically not available that a given pair of genes do not interact.
  
  
  RESULTS
  A recent advance in research on data mining is a method capable of learning a classifier from only positive and unlabeled examples, that does not need labeled negative examples. Applied to the reconstruction of gene regulatory networks, we show that this method significantly outperforms the current state of the art of machine learning methods. We assess the new method using both simulated and experimental data, and obtain major performance improvement.
  
  
  CONCLUSIONS
  Compared to unsupervised methods for gene network inference, supervised methods are potentially more accurate, but for training they need a complete set of known regulatory connections. A supervised method that can be trained using only positive and unlabeled data, as presented in this paper, is especially beneficial for the task of inferring gene regulatory networks, because only an incomplete set of known regulatory connections is available in public databases such as RegulonDB, TRRD, KEGG, Transfac, and IPA.
authors.affiliation: Department of Biological and Environmental Studies, University of Sannio, Benevento, Italy. lcerulo@unisannio.it
authors.forename: Luigi
authors.initials: L
authors.lastname: Cerulo
authors.forename: Charles
authors.initials: C
authors.lastname: Elkan
authors.forename: Michele
authors.initials: M
authors.lastname: Ceccarelli
mesh_terms: D001185:Artificial Intelligence; D057225:Data Mining; D030541:Databases, Genetic; D020869:Gene Expression Profiling / Q000379:methods*; D053263:Gene Regulatory Networks / Q000235:genetics*
references.citation: J Comput Biol. 2002;9(1):67-103
references.pmid: 11911796
references.citation: Pac Symp Biocomput. 1998;:18-29
references.pmid: 9697168
references.citation: BMC Bioinformatics. 2006 Mar 20;7 Suppl 1:S7
references.pmid: 16723010
references.citation: Stat Appl Genet Mol Biol. 2007;6:Article15
references.pmid: 17542777
references.citation: Ann N Y Acad Sci. 2007 Dec;1115:1-22
references.pmid: 17925349
references.citation: Bioinformatics. 2007 Dec 1;23(23):3147-54
references.pmid: 17942444
references.citation: Bioinformatics. 2008 Aug 15;24(16):i76-82
references.pmid: 18689844
references.citation: PLoS Biol. 2007 Jan;5(1):e8
references.pmid: 17214507
references.citation: Bioinformatics. 2007 May 15;23(10):1211-6
references.pmid: 17344232
references.citation: Nucleic Acids Res. 2006 Jan 1;34(Database issue):D394-7
references.pmid: 16381895
references.citation: BMC Bioinformatics. 2010 Mar 25;11:154
references.pmid: 20338053
references.citation: J Comput Biol. 2009 Feb;16(2):229-39
references.pmid: 19183003
references.citation: Bioinformatics. 2006 Nov 1;22(21):2590-6
references.pmid: 16945945
references.citation: BMC Bioinformatics. 2009 Dec 23;10:444
references.pmid: 20030818
references.citation: Biosystems. 2009 Apr;96(1):86-103
references.pmid: 19150482
references.citation: Bioinformatics. 2005 Jun;21 Suppl 1:i38-46
references.pmid: 15961482