In this work, we study the performance of different structure learning algorithms in the context of inferring gene networks from transcription data. We consider representatives of different structure learning approaches, some of which perform unrestricted searches, such as the PC algorithm and the Gobnilp method, and some of which introduce prior information on the structure, such as the K2 algorithm. Competing methods are evaluated both in terms of their predictive accuracy and their ability to reconstruct the true underlying network. A real data application based on an experiment performed by the University of Padova is also considered.
Djordjilovic V. [Writing – Original Draft Preparation] (Corresponding)
|Data di pubblicazione:||2017|
|Titolo:||An empirical comparison of popular structure learning algorithms with a view to gene network inference|
|Rivista:||INTERNATIONAL JOURNAL OF APPROXIMATE REASONING|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.ijar.2016.12.012|
|Appare nelle tipologie:||2.1 Articolo su rivista |