Algebraic shortcuts for leave-one-out cross-validation in supervised network inference. (16th October 2018)

• Record Type: Journal Article
• Authors: Stock, Michiel; Pahikkala, Tapio; Airola, Antti; Waegeman, Willem; De Baets, Bernard
• Is Part Of: Briefings in bioinformatics. Volume 21:Number 1(2020)
• Page Start: 262
• Page End: 271
• Publication Date: 2018-10-16
• Subjects: network inference -- biological networks -- cross-validation -- kernel methods; Genetics -- Data processing -- Periodicals; Molecular biology -- Data processing -- Periodicals; Genomes -- Data processing -- Periodicals; 572.80285
• DOI: 10.1093/bib/bby095
• Languages: English
• ISSNs: 1467-5463

Abstract

Abstract: Supervised machine learning techniques have traditionally been very successful at reconstructing biological networks, such as protein–ligand interaction, protein–protein interaction and gene regulatory networks. Many supervised techniques for network prediction use linear models on a possibly nonlinear pairwise feature representation of edges. Recently, much emphasis has been placed on the correct evaluation of such supervised models. It is vital to distinguish between using a model to either predict new interactions in a given network or to predict interactions for a new vertex not present in the original network. This distinction matters because (i) the performance might dramatically differ between the prediction settings and (ii) tuning the model hyperparameters to obtain the best possible model depends on the setting of interest. Specific cross-validation schemes need to be used to assess the performance in such different prediction settings. In this work we discuss a state-of-the-art kernel-based network inference technique called two-step kernel ridge regression. We show that this regression model can be trained efficiently, with a time complexity scaling with the number of vertices rather than the number of edges. Furthermore, this framework leads to a series of cross-validation shortcuts that allow one to rapidly estimate the model performance for any relevant network prediction setting. This allows computational biologists to fully assess the capabilities of their models. The machine learning techniques with the algebraic shortcuts are implemented in the RLScore software package: https://github.com/aatapa/RLScore .