Demo Data from VLDB 2026 / reviewers in the wild / expert
Jason G. Mezey
dblp:44/8252
· DBLP profile ↗
11ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-9250-6583ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 10 · 1 since 2021Artificial intelligence and machine learning · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 67% Planning, search and constraint satisfaction · 33% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › functional genomics
eQTL mapping |
0.2 | 1 | 2014 | HEFT: eQTL analysis of many thousands of expressed genes while simultaneously controlling for hidden factors · Bioinform. 2014 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.2 | 1 | 2014 | lrgpr: interactive linear mixed model analysis of genome-wide association studies with composite hypothesis testing and regression diagnostics in R · Bioinform. 2014 |
Bioinformatics and computational biology
genomics |
0.2 | 1 | 2014 | HEFT: eQTL analysis of many thousands of expressed genes while simultaneously controlling for hidden factors · Bioinform. 2014 |
Bioinformatics and computational biology › statistical genetics
linear mixed model |
0.2 | 1 | 2014 | lrgpr: interactive linear mixed model analysis of genome-wide association studies with composite hypothesis testing and regression diagnostics in R · Bioinform. 2014 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network |
0.2 | 1 | 2013 | Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion · J. Mach. Learn. Res. 2013 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
constraint learning |
0.2 | 1 | 2013 | Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion · J. Mach. Learn. Res. 2013 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning |
0.2 | 1 | 2013 | Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion · J. Mach. Learn. Res. 2013 |
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference |
0.1 | 1 | 2012 | Empirical Bayes conditional independence graphs for regulatory network recovery · Bioinform. 2012 |
Bioinformatics and computational biology
statistical genetics |
0.1 | 1 | 2014 | lrgpr: interactive linear mixed model analysis of genome-wide association studies with composite hypothesis testing and regression diagnostics in R · Bioinform. 2014 |
Data mining › causal inference › causal modeling
causal discovery |
0.0 | 1 | 2013 | Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion · J. Mach. Learn. Res. 2013 |
Bioinformatics and computational biology
gene expression analysis |
0.0 | 1 | 2012 | Empirical Bayes conditional independence graphs for regulatory network recovery · Bioinform. 2012 |
Methods — techniques the papers use, named apart from their topics
joint dependence criterion · 0.3ridge estimator · 0.2parallel computing · 0.2out-of-core computing · 0.2multivariate regression · 0.2linear mixed model · 0.2factor analysis · 0.2graphical model · 0.1empirical bayes · 0.1conditional independence testing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Simulants: Synthetic Clinical Trial Data via Subject-Level Privacy-Preserving Synthesis
Mandis Beigi, Afrah Shafquat, Jason G. Mezey, Jacob Aptekar |
AMIA | 3 |
| 2020 | Identifying novel associations in GWAS by hierarchical Bayesian latent variable detection of differentially misclassified phenotypesabstractBACKGROUND: Heterogeneity in the definition and measurement of complex diseases in Genome-Wide Association Studies (GWAS) may lead to misdiagnoses and misclassification errors that can significantly impact discovery of disease loci. While well appreciated, almost all analyses of GWAS data consider reported disease phenotype values as is without accounting for potential misclassification. RESULTS: Here, we introduce Phenotype Latent variable Extraction of disease misdiagnosis (PheLEx), a GWAS analysis framework that learns and corrects misclassified phenotypes using structured genotype associations within a dataset. PheLEx consists of a hierarchical Bayesian latent variable model, where inference of differential misclassification is accomplished using filtered genotypes while implementing a full mixed model to account for population structure and genetic relatedness in study populations. Through simulations, we show that the PheLEx framework dramatically improves recovery of the correct disease state when considering realistic allele effect sizes compared to existing methodologies designed for Bayesian recovery of disease phenotypes. We also demonstrate the potential of PheLEx for extracting new potential loci from existing GWAS data by analyzing bipolar disorder and epilepsy phenotypes available from the UK Biobank. From the PheLEx analysis of these data, we identified new candidate disease loci not previously reported for these datasets that have value for supplemental hypothesis generation. CONCLUSION: PheLEx shows promise in reanalyzing GWAS datasets to provide supplemental candidate loci that are ignored by traditional GWAS analysis methodologies. Afrah Shafquat, Ronald G. Crystal, Jason G. Mezey |
BMC Bioinform. | 3 |
| 2017 | An independent component analysis confounding factor correction framework for identifying broad impact expression quantitative trait lociabstractGenome-wide expression Quantitative Trait Loci (eQTL) studies in humans have provided numerous insights into the genetics of both gene expression and complex diseases. While the majority of eQTL identified in genome-wide analyses impact a single gene, eQTL that impact many genes are particularly valuable for network modeling and disease analysis. To enable the identification of such broad impact eQTL, we introduce CONFETI: Confounding Factor Estimation Through Independent component analysis. CONFETI is designed to address two conflicting issues when searching for broad impact eQTL: the need to account for non-genetic confounding factors that can lower the power of the analysis or produce broad impact eQTL false positives, and the tendency of methods that account for confounding factors to model broad impact eQTL as non-genetic variation. The key advance of the CONFETI framework is the use of Independent Component Analysis (ICA) to identify variation likely caused by broad impact eQTL when constructing the sample covariance matrix used for the random effect in a mixed model. We show that CONFETI has better performance than other mixed model confounding factor methods when considering broad impact eQTL recovery from synthetic data. We also used the CONFETI framework and these same confounding factor methods to identify eQTL that replicate between matched twin pair datasets in the Multiple Tissue Human Expression Resource (MuTHER), the Depression Genes Networks study (DGN), the Netherlands Study of Depression and Anxiety (NESDA), and multiple tissue types in the Genotype-Tissue Expression (GTEx) consortium. These analyses identified both cis-eQTL and trans-eQTL impacting individual genes, and CONFETI had better or comparable performance to other mixed model confounding factor analysis methods when identifying such eQTL. In these analyses, we were able to identify and replicate a few broad impact eQTL although the overall number was small even when applying CONFETI. In light of these results, we discuss the broad impact eQTL that have been previously reported from the analysis of human data and suggest that considerable caution should be exercised when making biological inferences based on these reported eQTL. Jin Hyun Ju, Sushila A. Shenoy, Ronald G. Crystal, Jason G. Mezey |
PLoS Comput. Biol. | 4 |
| 2014 | HEFT: eQTL analysis of many thousands of expressed genes while simultaneously controlling for hidden factorsabstractMOTIVATION: Identification of expression Quantitative Trait Loci (eQTL), the genetic loci that contribute to heritable variation in gene expression, can be obstructed by factors that produce variation in expression profiles if these factors are unmeasured or hidden from direct analysis. METHODS: We have developed a method for Hidden Expression Factor analysis (HEFT) that identifies individual and pleiotropic effects of eQTL in the presence of hidden factors. The HEFT model is a combined multivariate regression and factor analysis, where the complete likelihood of the model is used to derive a ridge estimator for simultaneous factor learning and detection of eQTL. HEFT requires no pre-estimation of hidden factor effects; it provides P-values and is extremely fast, requiring just a few hours to complete an eQTL analysis of thousands of expression variables when analyzing hundreds of thousands of single nucleotide polymorphisms on a standard 8 core 2.6 G desktop. RESULTS: By analyzing simulated data, we demonstrate that HEFT can correct for an unknown number of hidden factors and significantly outperforms all related hidden factor methods for eQTL analysis when there are eQTL with univariate and multivariate (pleiotropic) effects. To demonstrate a real-world application, we applied HEFT to identify eQTL affecting gene expression in the human lung for a study that included presumptive hidden factors. HEFT identified all of the cis-eQTL found by other hidden factor methods and 91 additional cis-eQTL. HEFT also identified a number of eQTLs with direct relevance to lung disease that could not be found without a hidden factor analysis, including cis-eQTL for GTF2H1 and MTRR, genes that have been independently associated with lung cancer. AVAILABILITY: Software is available at http://mezeylab.cb.bscb.cornell.edu/Software.aspx. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Chuan Gao, Nicole L. Tignor, Jacqueline Salit, Yael Strulovici-Barel, Neil R. Hackett, Ronald G. Crystal, Jason G. Mezey |
Bioinform. | 7 |
| 2014 | lrgpr: interactive linear mixed model analysis of genome-wide association studies with composite hypothesis testing and regression diagnostics in RabstractUNLABELLED: The linear mixed model is the state-of-the-art method to account for the confounding effects of kinship and population structure in genome-wide association studies (GWAS). Current implementations test the effect of one or more genetic markers while including prespecified covariates such as sex. Here we develop an efficient implementation of the linear mixed model that allows composite hypothesis tests to consider genotype interactions with variables such as other genotypes, environment, sex or ancestry. Our R package, lrgpr, allows interactive model fitting and examination of regression diagnostics to facilitate exploratory data analysis in the context of the linear mixed model. By leveraging parallel and out-of-core computing for datasets too large to fit in main memory, lrgpr is applicable to large GWAS datasets and next-generation sequencing data. AVAILABILITY AND IMPLEMENTATION: lrgpr is an R package available from lrgpr.r-forge.r-project.org. Gabriel E. Hoffman, Jason G. Mezey, Eric E. Schadt |
Bioinform. | 2 |
| 2013 | Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion
Rami Mahdi, Jason G. Mezey |
J. Mach. Learn. Res. | 2 |
| 2013 | PUMA: A Unified Framework for Penalized Multiple Regression Analysis of GWAS DataabstractPenalized Multiple Regression (PMR) can be used to discover novel disease associations in GWAS datasets. In practice, proposed PMR methods have not been able to identify well-supported associations in GWAS that are undetectable by standard association tests and thus these methods are not widely applied. Here, we present a combined algorithmic and heuristic framework for PUMA (Penalized Unified Multiple-locus Association) analysis that solves the problems of previously proposed methods including computational speed, poor performance on genome-scale simulated data, and identification of too many associations for real data to be biologically plausible. The framework includes a new minorize-maximization (MM) algorithm for generalized linear models (GLM) combined with heuristic model selection and testing methods for identification of robust associations. The PUMA framework implements the penalized maximum likelihood penalties previously proposed for GWAS analysis (i.e. Lasso, Adaptive Lasso, NEG, MCP), as well as a penalty that has not been previously applied to GWAS (i.e. LOG). Using simulations that closely mirror real GWAS data, we show that our framework has high performance and reliably increases power to detect weak associations, while existing PMR methods can perform worse than single marker testing in overall performance. To demonstrate the empirical value of PUMA, we analyzed GWAS data for type 1 diabetes, Crohns's disease, and rheumatoid arthritis, three autoimmune diseases from the original Wellcome Trust Case Control Consortium. Our analysis replicates known associations for these diseases and we discover novel etiologically relevant susceptibility loci that are invisible to standard single marker tests, including six novel associations implicating genes involved in pancreatic function, insulin pathways and immune-cell function in type 1 diabetes; three novel associations implicating genes in pro- and anti-inflammatory pathways in Crohn's disease; and one novel association implicating a gene involved in apoptosis pathways in rheumatoid arthritis. We provide software for applying our PUMA analysis framework. Gabriel E. Hoffman, Benjamin A. Logsdon, Jason G. Mezey |
PLoS Comput. Biol. | 3 |
| 2012 | Empirical Bayes conditional independence graphs for regulatory network recoveryabstractMOTIVATION: Computational inference methods that make use of graphical models to extract regulatory networks from gene expression data can have difficulty reconstructing dense regions of a network, a consequence of both computational complexity and unreliable parameter estimation when sample size is small. As a result, identification of hub genes is of special difficulty for these methods. METHODS: We present a new algorithm, Empirical Light Mutual Min (ELMM), for large network reconstruction that has properties well suited for recovery of graphs with high-degree nodes. ELMM reconstructs the undirected graph of a regulatory network using empirical Bayes conditional independence testing with a heuristic relaxation of independence constraints in dense areas of the graph. This relaxation allows only one gene of a pair with a putative relation to be aware of the network connection, an approach that is aimed at easing multiple testing problems associated with recovering densely connected structures. RESULTS: Using in silico data, we show that ELMM has better performance than commonly used network inference algorithms including GeneNet, ARACNE, FOCI, GENIE3 and GLASSO. We also apply ELMM to reconstruct a network among 5492 genes expressed in human lung airway epithelium of healthy non-smokers, healthy smokers and individuals with chronic obstructive pulmonary disease assayed using microarrays. The analysis identifies dense sub-networks that are consistent with known regulatory relationships in the lung airway and also suggests novel hub regulatory relationships among a number of genes that play roles in oxidative stress and secretion. AVAILABILITY AND IMPLEMENTATION: Software for running ELMM is made available at http://mezeylab.cb.bscb.cornell.edu/Software.aspx. CONTACT: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Rami Mahdi, Abishek S. Madduri, Yael Strulovici-Barel, Jacqueline Salit, Neil R. Hackett, Ronald G. Crystal, Jason G. Mezey |
Bioinform. | 8 |
| 2012 | Mouse obesity network reconstruction with a variational Bayes algorithm to employ aggressive false positive controlabstractBACKGROUND: We propose a novel variational Bayes network reconstruction algorithm to extract the most relevant disease factors from high-throughput genomic data-sets. Our algorithm is the only scalable method for regularized network recovery that employs Bayesian model averaging and that can internally estimate an appropriate level of sparsity to ensure few false positives enter the model without the need for cross-validation or a model selection criterion. We use our algorithm to characterize the effect of genetic markers and liver gene expression traits on mouse obesity related phenotypes, including weight, cholesterol, glucose, and free fatty acid levels, in an experiment previously used for discovery and validation of network connections: an F2 intercross between the C57BL/6 J and C3H/HeJ mouse strains, where apolipoprotein E is null on the background. RESULTS: We identified eleven genes, Gch1, Zfp69, Dlgap1, Gna14, Yy1, Gabarapl1, Folr2, Fdft1, Cnr2, Slc24a3, and Ccl19, and a quantitative trait locus directly connected to weight, glucose, cholesterol, or free fatty acid levels in our network. None of these genes were identified by other network analyses of this mouse intercross data-set, but all have been previously associated with obesity or related pathologies in independent studies. In addition, through both simulations and data analysis we demonstrate that our algorithm achieves superior performance in terms of power and type I error control than other network recovery algorithms that use the lasso and have bounds on type I error control. CONCLUSIONS: Our final network contains 118 previously associated and novel genes affecting weight, cholesterol, glucose, and free fatty acid levels that are excellent obesity risk candidates. Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. Mezey |
BMC Bioinform. | 3 |
| 2010 | A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysisabstractBACKGROUND: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to explain the bulk of heritability. Here, we describe the algorithm V-Bay, a variational Bayes algorithm for multiple locus GWA analysis, which is designed to identify weaker associations that may contribute to this missing heritability. RESULTS: V-Bay provides a novel solution to the computational scaling constraints of most multiple locus methods and can complete a simultaneous analysis of a million genetic markers in a few hours, when using a desktop. Using a range of simulated genetic and GWA experimental scenarios, we demonstrate that V-Bay is highly accurate, and reliably identifies associations that are too weak to be discovered by single-marker testing approaches. V-Bay can also outperform a multiple locus analysis method based on the lasso, which has similar scaling properties for large numbers of genetic markers. For demonstration purposes, we also use V-Bay to confirm associations with gene expression in cell lines derived from the Phase II individuals of HapMap. CONCLUSIONS: V-Bay is a versatile, fast, and accurate multiple locus GWA analysis tool for the practitioner interested in identifying weaker associations without high false positive rates. Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. Mezey |
BMC Bioinform. | 3 |
| 2010 | Gene Expression Network Reconstruction by Convex Feature Selection when Incorporating Genetic PerturbationsabstractCellular gene expression measurements contain regulatory information that can be used to discover novel network relationships. Here, we present a new algorithm for network reconstruction powered by the adaptive lasso, a theoretically and empirically well-behaved method for selecting the regulatory features of a network. Any algorithms designed for network discovery that make use of directed probabilistic graphs require perturbations, produced by either experiments or naturally occurring genetic variation, to successfully infer unique regulatory relationships from gene expression data. Our approach makes use of appropriately selected cis-expression Quantitative Trait Loci (cis-eQTL), which provide a sufficient set of independent perturbations for maximum network resolution. We compare the performance of our network reconstruction algorithm to four other approaches: the PC-algorithm, QTLnet, the QDG algorithm, and the NEO algorithm, all of which have been used to reconstruct directed networks among phenotypes leveraging QTL. We show that the adaptive lasso can outperform these algorithms for networks of ten genes and ten cis-eQTL, and is competitive with the QDG algorithm for networks with thirty genes and thirty cis-eQTL, with rich topologies and hundreds of samples. Using this novel approach, we identify unique sets of directed relationships in Saccharomyces cerevisiae when analyzing genome-wide gene expression data for an intercross between a wild strain and a lab strain. We recover novel putative network relationships between a tyrosine biosynthesis gene (TYR1), and genes involved in endocytosis (RCY1), the spindle checkpoint (BUB2), sulfonate catabolism (JLP1), and cell-cell communication (PRM7). Our algorithm provides a synthesis of feature selection methods and graphical model theory that has the potential to reveal new directed regulatory relationships from the analysis of population level genetic and gene expression data. Benjamin A. Logsdon, Jason G. Mezey |
PLoS Comput. Biol. | 2 |