### Abstract

Original language | English |
---|---|

Title of host publication | German Conference on Bioinformatics |

Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |

Pages | 46-55 |

ISBN (Print) | 9783939897590 |

DOIs | |

Publication status | Published - 2013 |

### Fingerprint

### Cite this

*German Conference on Bioinformatics*(pp. 46-55). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/OASIcs.GCB.2013.46

}

*German Conference on Bioinformatics.*Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 46-55. https://doi.org/10.4230/OASIcs.GCB.2013.46

**Reconstructing consensus Bayesian network structures with application to learning molecular interaction networks.** / Fröhlich, H.; Klau, G.W.

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Reconstructing consensus Bayesian network structures with application to learning molecular interaction networks

AU - Fröhlich, H.

AU - Klau, G.W.

PY - 2013

Y1 - 2013

N2 - Bayesian Networks are an established computational approach for data driven network inference. However, experimental data is limited in its availability and corrupted by noise. This leads to an unavoidable uncertainty about the correct network structure. Thus sampling or bootstrap based strategies are applied to obtain edge frequencies. In a more general sense edge frequencies can also result from integrating networks learned on different datasets or via different inference algorithms. Subsequently one typically wants to derive a biological interpretation from the results in terms of a consensus network. We here propose a log odds based edge score on the basis of the expected false positive rate and thus avoid the selection of a subjective edge frequency cutoff. Computing a score optimal consensus network in our new model amounts to solving the maximum weight acyclic subdigraph problem. We use a branch-and-cut algorithm based on integer linear programming for this task. Our empirical studies on simulated and real data demonstrate a consistently improved network reconstruction accuracy compared to two threshold based strategies.

AB - Bayesian Networks are an established computational approach for data driven network inference. However, experimental data is limited in its availability and corrupted by noise. This leads to an unavoidable uncertainty about the correct network structure. Thus sampling or bootstrap based strategies are applied to obtain edge frequencies. In a more general sense edge frequencies can also result from integrating networks learned on different datasets or via different inference algorithms. Subsequently one typically wants to derive a biological interpretation from the results in terms of a consensus network. We here propose a log odds based edge score on the basis of the expected false positive rate and thus avoid the selection of a subjective edge frequency cutoff. Computing a score optimal consensus network in our new model amounts to solving the maximum weight acyclic subdigraph problem. We use a branch-and-cut algorithm based on integer linear programming for this task. Our empirical studies on simulated and real data demonstrate a consistently improved network reconstruction accuracy compared to two threshold based strategies.

U2 - 10.4230/OASIcs.GCB.2013.46

DO - 10.4230/OASIcs.GCB.2013.46

M3 - Conference contribution

SN - 9783939897590

SP - 46

EP - 55

BT - German Conference on Bioinformatics

PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

ER -