Demo Data from EDBT 2026 / reviewers in the wild / expert
Charles K. Fisher
dblp:149/2260
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2020
0000-0002-8835-1096ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
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
1 paper |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian model selection
bayesian feature selection |
0.2 | 1 | 2015 | Bayesian feature selection for high-dimensional linear regression via the Ising approximation with applications to genomics · Bioinform. 2015 |
Bioinformatics and computational biology
feature selection |
0.2 | 1 | 2015 | Bayesian feature selection for high-dimensional linear regression via the Ising approximation with applications to genomics · Bioinform. 2015 |
Bioinformatics and computational biology
genomics |
0.2 | 1 | 2015 | Bayesian feature selection for high-dimensional linear regression via the Ising approximation with applications to genomics · Bioinform. 2015 |
Methods — techniques the papers use, named apart from their topics
mean-field approximation · 0.4l2 penalized regression · 0.4ising approximation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Standard machine learning approaches outperform deep representation learning on phenotype prediction from transcriptomics dataabstractBACKGROUND: The ability to confidently predict health outcomes from gene expression would catalyze a revolution in molecular diagnostics. Yet, the goal of developing actionable, robust, and reproducible predictive signatures of phenotypes such as clinical outcome has not been attained in almost any disease area. Here, we report a comprehensive analysis spanning prediction tasks from ulcerative colitis, atopic dermatitis, diabetes, to many cancer subtypes for a total of 24 binary and multiclass prediction problems and 26 survival analysis tasks. We systematically investigate the influence of gene subsets, normalization methods and prediction algorithms. Crucially, we also explore the novel use of deep representation learning methods on large transcriptomics compendia, such as GTEx and TCGA, to boost the performance of state-of-the-art methods. The resources and findings in this work should serve as both an up-to-date reference on attainable performance, and as a benchmarking resource for further research. RESULTS: -regularized regression methods applied to centered log-ratio transformed transcript abundances provide the best predictive analyses overall. CONCLUSIONS: Transcriptomics-based phenotype prediction benefits from proper normalization techniques and state-of-the-art regularized regression approaches. In our view, breakthrough performance is likely contingent on factors which are independent of normalization and general modeling techniques; these factors might include reduction of systematic errors in sequencing data, incorporation of other data types such as single-cell sequencing and proteomics, and improved use of prior knowledge. Aaron M. Smith, Jonathan R. Walsh, Craig B. Davis, Peter Henstock, Martin R. Hodge, Mateusz Maciejewski, Xinmeng Jasmine Mu, Stephen Ra, Shanrong Zhao, Daniel Ziemek, Charles K. Fisher |
BMC Bioinform. | 12 |
| 2019 | Generating Synthetic Control Patients Using Machine Learning for Alzheimer's Disease Clinical Trials
Charles K. Fisher, Yannick Pouliot, Aaron M. Smith, Jonathan R. Walsh |
AMIA | 1 |
| 2017 | Variable habitat conditions drive species covariation in the human microbiotaabstractTwo species with similar resource requirements respond in a characteristic way to variations in their habitat-their abundances rise and fall in concert. We use this idea to learn how bacterial populations in the microbiota respond to habitat conditions that vary from person-to-person across the human population. Our mathematical framework shows that habitat fluctuations are sufficient for explaining intra-bodysite correlations in relative species abundances from the Human Microbiome Project. We explicitly show that the relative abundances of closely related species are positively correlated and can be predicted from taxonomic relationships. We identify a small set of functional pathways related to metabolism and maintenance of the cell wall that form the basis of a common resource sharing niche space of the human microbiota. Charles K. Fisher, Thierry Mora, Aleksandra M. Walczak |
PLoS Comput. Biol. | 1 |
| 2015 | Bayesian feature selection for high-dimensional linear regression via the Ising approximation with applications to genomicsabstractMOTIVATION: Feature selection, identifying a subset of variables that are relevant for predicting a response, is an important and challenging component of many methods in statistics and machine learning. Feature selection is especially difficult and computationally intensive when the number of variables approaches or exceeds the number of samples, as is often the case for many genomic datasets. RESULTS: Here, we introduce a new approach--the Bayesian Ising Approximation (BIA)-to rapidly calculate posterior probabilities for feature relevance in L2 penalized linear regression. In the regime where the regression problem is strongly regularized by the prior, we show that computing the marginal posterior probabilities for features is equivalent to computing the magnetizations of an Ising model with weak couplings. Using a mean field approximation, we show it is possible to rapidly compute the feature selection path described by the posterior probabilities as a function of the L2 penalty. We present simulations and analytical results illustrating the accuracy of the BIA on some simple regression problems. Finally, we demonstrate the applicability of the BIA to high-dimensional regression by analyzing a gene expression dataset with nearly 30 000 features. These results also highlight the impact of correlations between features on Bayesian feature selection. AVAILABILITY AND IMPLEMENTATION: An implementation of the BIA in C++, along with data for reproducing our gene expression analyses, are freely available at http://physics.bu.edu/∼pankajm/BIACode. Charles K. Fisher, Pankaj Mehta |
Bioinform. | 1 |
| 2015 | Bayesian Feature Selection with Strongly Regularizing Priors Maps to the Ising ModelabstractIdentifying small subsets of features that are relevant for prediction and classification tasks is a central problem in machine learning and statistics. The feature selection task is especially important, and computationally difficult, for modern data sets where the number of features can be comparable to or even exceed the number of samples. Here, we show that feature selection with Bayesian inference takes a universal form and reduces to calculating the magnetizations of an Ising model under some mild conditions. Our results exploit the observation that the evidence takes a universal form for strongly regularizing priors--priors that have a large effect on the posterior probability even in the infinite data limit. We derive explicit expressions for feature selection for generalized linear models, a large class of statistical techniques that includes linear and logistic regression. We illustrate the power of our approach by analyzing feature selection in a logistic regression-based classifier trained to distinguish between the letters B and D in the notMNIST data set. Charles K. Fisher, Pankaj Mehta |
Neural Comput. | 1 |