Andrew J Sedgewick1,2, Ivy Shi3, Rory M Donovan4,5, Panayiotis V Benos4,5. 1. Department of Computational and Systems Biology, University of Pittsburgh School of Medicine, Pittsburgh, PA, USA. ajs206@pitt.edu. 2. Joint Carnegie Mellon University-University of Pittsburgh PhD Program in Computational Biology, Pittsburgh, PA, USA. ajs206@pitt.edu. 3. Department of Bioengineering, University of Pittsburgh, Pittsburgh, PA, USA. 4. Department of Computational and Systems Biology, University of Pittsburgh School of Medicine, Pittsburgh, PA, USA. 5. Joint Carnegie Mellon University-University of Pittsburgh PhD Program in Computational Biology, Pittsburgh, PA, USA.
Abstract
BACKGROUND: Mixed graphical models (MGMs) are graphical models learned over a combination of continuous and discrete variables. Mixed variable types are common in biomedical datasets. MGMs consist of a parameterized joint probability density, which implies a network structure over these heterogeneous variables. The network structure reveals direct associations between the variables and the joint probability density allows one to ask arbitrary probabilistic questions on the data. This information can be used for feature selection, classification and other important tasks. RESULTS: We studied the properties of MGM learning and applications of MGMs to high-dimensional data (biological and simulated). Our results show that MGMs reliably uncover the underlying graph structure, and when used for classification, their performance is comparable to popular discriminative methods (lasso regression and support vector machines). We also show that imposing separate sparsity penalties for edges connecting different types of variables significantly improves edge recovery performance. To choose these sparsity parameters, we propose a new efficient model selection method, named Stable Edge-specific Penalty Selection (StEPS). StEPS is an expansion of an earlier method, StARS, to mixed variable types. In terms of edge recovery, StEPS selected MGMs outperform those models selected using standard techniques, including AIC, BIC and cross-validation. In addition, we use a heuristic search that is linear in size of the sparsity value search space as opposed to the cubic grid search required by other model selection methods. We applied our method to clinical and mRNA expression data from the Lung Genomics Research Consortium (LGRC) and the learned MGM correctly recovered connections between the diagnosis of obstructive or interstitial lung disease, two diagnostic breathing tests, and cigarette smoking history. Our model also suggested biologically relevant mRNA markers that are linked to these three clinical variables. CONCLUSIONS: MGMs are able to accurately recover dependencies between sets of continuous and discrete variables in both simulated and biomedical datasets. Separation of sparsity penalties by edge type is essential for accurate network edge recovery. Furthermore, our stability based method for model selection determines sparsity parameters faster and more accurately (in terms of edge recovery) than other model selection methods. With the ongoing availability of comprehensive clinical and biomedical datasets, MGMs are expected to become a valuable tool for investigating disease mechanisms and answering an array of critical healthcare questions.
BACKGROUND: Mixed graphical models (MGMs) are graphical models learned over a combination of continuous and discrete variables. Mixed variable types are common in biomedical datasets. MGMs consist of a parameterized joint probability density, which implies a network structure over these heterogeneous variables. The network structure reveals direct associations between the variables and the joint probability density allows one to ask arbitrary probabilistic questions on the data. This information can be used for feature selection, classification and other important tasks. RESULTS: We studied the properties of MGM learning and applications of MGMs to high-dimensional data (biological and simulated). Our results show that MGMs reliably uncover the underlying graph structure, and when used for classification, their performance is comparable to popular discriminative methods (lasso regression and support vector machines). We also show that imposing separate sparsity penalties for edges connecting different types of variables significantly improves edge recovery performance. To choose these sparsity parameters, we propose a new efficient model selection method, named Stable Edge-specific Penalty Selection (StEPS). StEPS is an expansion of an earlier method, StARS, to mixed variable types. In terms of edge recovery, StEPS selected MGMs outperform those models selected using standard techniques, including AIC, BIC and cross-validation. In addition, we use a heuristic search that is linear in size of the sparsity value search space as opposed to the cubic grid search required by other model selection methods. We applied our method to clinical and mRNA expression data from the Lung Genomics Research Consortium (LGRC) and the learned MGM correctly recovered connections between the diagnosis of obstructive or interstitial lung disease, two diagnostic breathing tests, and cigarette smoking history. Our model also suggested biologically relevant mRNA markers that are linked to these three clinical variables. CONCLUSIONS: MGMs are able to accurately recover dependencies between sets of continuous and discrete variables in both simulated and biomedical datasets. Separation of sparsity penalties by edge type is essential for accurate network edge recovery. Furthermore, our stability based method for model selection determines sparsity parameters faster and more accurately (in terms of edge recovery) than other model selection methods. With the ongoing availability of comprehensive clinical and biomedical datasets, MGMs are expected to become a valuable tool for investigating disease mechanisms and answering an array of critical healthcare questions.
Authors: Ivan O Rosas; Thomas J Richards; Kazuhisa Konishi; Yingze Zhang; Kevin Gibson; Anna E Lokshin; Kathleen O Lindell; Jose Cisneros; Sandra D Macdonald; Annie Pardo; Frank Sciurba; James Dauber; Moises Selman; Bernadette R Gochuico; Naftali Kaminski Journal: PLoS Med Date: 2008-04-29 Impact factor: 11.069
Authors: Andrew J Sedgewick; Stephen C Benz; Shahrooz Rabizadeh; Patrick Soon-Shiong; Charles J Vaske Journal: Bioinformatics Date: 2013-07-01 Impact factor: 6.937
Authors: Junru Wu; Anthony Cyr; Danielle Gruen; Tyler Lovelace; Panayiotis Benos; Tianmeng Chen; Francis Guyette; Mark Yazer; Brian Daley; Richard Miller; Brian Harbrecht; Jeffrey Claridge; Herb Phelan; Brian Zuckerbraun; Matthew Neal; Pär Johansson; Jakob Stensballe; Rami Namas; Yoram Vodovotz; Jason Sperry; Timothy Billiar; PAMPer Study Group Journal: Res Sq Date: 2021-01-08
Authors: Michael Altenbuchinger; Antoine Weihs; John Quackenbush; Hans Jörgen Grabe; Helena U Zacharias Journal: Biochim Biophys Acta Gene Regul Mech Date: 2019-10-19 Impact factor: 4.490
Authors: Vineet K Raghu; Christopher M Horvat; Patrick M Kochanek; Ericka L Fink; Robert S B Clark; Panayiotis V Benos; Alicia K Au Journal: Pediatr Crit Care Med Date: 2021-10-01 Impact factor: 3.971