Supervised reconstruction of biological networks with local models
1Institut de Mathématiques et de Modélisation de Montpellier, UMR CNRS 5149, Equipe de Probabilités et Statistique, Université Montpellier II, CC 051, Place Eugène Bataillon, 34095 Montpellier Cedex 5 and 2Centre for Computational Biology, Ecole des Mines de Paris, 35 rue Saint-Honore, 77305 Fontainebleau Cedex, France
*To whom correspondence should be addressed.
| Abstract |
|---|
Motivation: Inference and reconstruction of biological networks from heterogeneous data is currently an active research subject with several important applications in systems biology. The problem has been attacked from many different points of view with varying degrees of success. In particular, predicting new edges with a reasonable false discovery rate is highly demanded for practical applications, but remains extremely challenging due to the sparsity of the networks of interest.
Results: While most previous approaches based on the partial knowledge of the network to be inferred build global models to predict new edges over the network, we introduce here a novel method which predicts whether there is an edge from a newly added vertex to each of the vertices of a known network using local models. This involves learning individually a certain subnetwork associated with each vertex of the known network, then using the discovered classification rule associated with only that vertex to predict the edge to the new vertex. Excellent experimental results are shown in the case of metabolic and protein–protein interaction network reconstruction from a variety of genomic data.
Availability: An implementation of the proposed algorithm is available upon request from the authors.
Contact: Jean-Philippe.Vert{at}ensmp.fr
This article has been cited by other articles:
![]() |
H. Kashima, Y. Yamanishi, T. Kato, M. Sugiyama, and K. Tsuda Simultaneous inference of biological networks of multiple species from genome-wide data and evolutionary information: a semi-supervised approach Bioinformatics, November 15, 2009; 25(22): 2962 - 2968. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. Anjum, A. Doucet, and C. C. Holmes A boosting approach to structure learning of graphs with and without prior knowledge Bioinformatics, November 15, 2009; 25(22): 2929 - 2936. [Abstract] [Full Text] [PDF] |
||||
![]() |
K. Bleakley and Y. Yamanishi Supervised prediction of drug-target interactions using bipartite local models Bioinformatics, September 15, 2009; 25(18): 2397 - 2403. [Abstract] [Full Text] [PDF] |
||||
![]() |
K. Y. Yip and M. Gerstein Training set expansion: an approach to improving the reconstruction of biological networks from limited and uneven reliable interactions Bioinformatics, January 15, 2009; 25(2): 243 - 250. [Abstract] [Full Text] [PDF] |
||||
![]() |
Z. Hu, E. S. Snitkin, and C. DeLisi VisANT: an integrative framework for networks in systems biology Brief Bioinform, July 1, 2008; 9(4): 317 - 325. [Abstract] [Full Text] [PDF] |
||||

