Probably Approximately Correct Learning of Regulatory Networks from Time-Series Data

Abstract : Automating the process of model building from experimental data is a very desirable goal to palliate the lack of modellers for many applications. However, despite the spectacular progress of machine learning techniques in data analytics, classification, clustering and prediction making, learning dynamical models from data time-series is still challenging. In this paper we investigate the use of the Probably Approximately Correct (PAC) learning framework of Leslie Valiant as a method for the automated discovery of influence models of biochemical processes from Boolean and stochastic traces. We show that Thomas' Boolean influence systems can be naturally represented by k-CNF formulae and learned from time-series data with a quasi linear number of Boolean activation samples per species, and that positive Boolean influence systems can be represented by monotone DNF formulae and learned actively with both activation samples and oracle calls. We evaluate the performance of this approach on a model of T-lymphocyte differentiation, with and without prior knowledge, and discuss its merits as well as its limitations with respect to realistic experiments.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01519826
Contributor : François Fages <>
Submitted on : Tuesday, May 9, 2017 - 1:15:03 PM
Last modification on : Monday, September 24, 2018 - 2:00:04 PM
Long-term archiving on : Thursday, August 10, 2017 - 1:02:43 PM

File

CF17cmsb.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01519826, version 1

Citation

Arthur Carcano, François Fages, Sylvain Soliman. Probably Approximately Correct Learning of Regulatory Networks from Time-Series Data. 2017. ⟨hal-01519826v1⟩

Share

Metrics

Record views

180

Files downloads

68