Supervised Graph Inference

We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learning of a mapping of the vertices to a Euclidean space where the graph is easy to infer, and can be formu- lated as an optimization problem in a reproducing kernel Hilbert space. We report encouraging results on the problem of metabolic network re- construction from genomic data.

Authors

• Jean-Philippe Vert
• Yoshihiro Yamanishi Graduate School of Informatics, Nagoya University, Chikusa, Nagoya, 464-8601, Japan

Keywords

No keywords are indexed for this paper.