A boosting approach to structure learning of graphs with and without prior knowledge Export

@article{citeulike:5498094, abstract = {Motivation: Identifying the network structure through which genes and their products interact can help to elucidate normal cell physiology as well as the genetic architecture of pathological phenotypes. Recently, a number of gene network inference tools have appeared based on Gaussian graphical model representations. Following this, we introduce a novel Boosting approach to learn the structure of a high-dimensional Gaussian graphical model motivated by the applications in genomics. A particular emphasis is paid to the inclusion of partial prior knowledge on the structure of the graph. With the increasing availability of pathway information and large-scale gene expression datasets, we believe that conditioning on prior knowledge will be an important aspect in raising the statistical power of structural learning algorithms to infer true conditional dependencies. Results: Our Boosting approach, termed BoostiGraph, is conceptually and algorithmically simple. It complements recent work on the network inference problem based on Lasso-type approaches. BoostiGraph is computationally cheap and is applicable to very high-dimensional graphs. For example, on graphs of order 5000 nodes, it is able to map out paths for the conditional independence structure in few minutes. Using computer simulations, we investigate the ability of our method with and without prior information to infer Gaussian graphical models from artificial as well as actual microarray datasets. The experimental results demonstrate that, using our method, it is possible to recover the true network topology with relatively high accuracy. Availability: This method and all other associated files are freely available from http://www.stats.ox.ac.uk/[\~{}]anjum/. Contact: s.anjum@har.mrc.ac.uk; cholmes@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinfomatics online. 10.1093/bioinformatics/btp485}, author = {Anjum, Shahzia and Doucet, Arnaud and Holmes, Chris C.}, citeulike-article-id = {5498094}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btp485}, citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/25/22/2929.abstract}, citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/25/22/2929.full.pdf}, citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/19696047}, citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=19696047}, day = {15}, doi = {10.1093/bioinformatics/btp485}, journal = {Bioinformatics}, keywords = {bayes, genenetworks}, month = {November}, number = {22}, pages = {2929--2936}, posted-at = {2009-11-05 08:10:56}, priority = {0}, title = {A boosting approach to structure learning of graphs with and without prior knowledge}, url = {http://dx.doi.org/10.1093/bioinformatics/btp485}, volume = {25}, year = {2009} }

TY - JOUR ID - citeulike:5498094 L3 - citeulike-article-id:5498094 N2 - Motivation: Identifying the network structure through which genes and their products interact can help to elucidate normal cell physiology as well as the genetic architecture of pathological phenotypes. Recently, a number of gene network inference tools have appeared based on Gaussian graphical model representations. Following this, we introduce a novel Boosting approach to learn the structure of a high-dimensional Gaussian graphical model motivated by the applications in genomics. A particular emphasis is paid to the inclusion of partial prior knowledge on the structure of the graph. With the increasing availability of pathway information and large-scale gene expression datasets, we believe that conditioning on prior knowledge will be an important aspect in raising the statistical power of structural learning algorithms to infer true conditional dependencies. Results: Our Boosting approach, termed BoostiGraph, is conceptually and algorithmically simple. It complements recent work on the network inference problem based on Lasso-type approaches. BoostiGraph is computationally cheap and is applicable to very high-dimensional graphs. For example, on graphs of order 5000 nodes, it is able to map out paths for the conditional independence structure in few minutes. Using computer simulations, we investigate the ability of our method with and without prior information to infer Gaussian graphical models from artificial as well as actual microarray datasets. The experimental results demonstrate that, using our method, it is possible to recover the true network topology with relatively high accuracy. Availability: This method and all other associated files are freely available from http://www.stats.ox.ac.uk/[~]anjum/. Contact: s.anjum@har.mrc.ac.uk; cholmes@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinfomatics online. 10.1093/bioinformatics/btp485 IS - 22 JF - Bioinformatics EP - 2936 TI - A boosting approach to structure learning of graphs with and without prior knowledge VL - 25 SP - 2929 KW - bayes KW - genenetworks AU - Anjum, Shahzia AU - Doucet, Arnaud AU - Holmes, Chris PY - 2009/11/15/ UR - http://dx.doi.org/10.1093/bioinformatics/btp485 ER -