Demo Data from EDBT 2026 / reviewers in the wild / expert
Meera Vieira Machado
dblp:290/1740
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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 · 61% Computational science and engineering · 30% Medical and health informatics · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › biomarker discovery
clinical biomarker discovery |
0.6 | 1 | 2022 | Identifying interactions in omics data for clinical biomarker discovery using symbolic regression · Bioinform. 2022 |
Bioinformatics and computational biology › multi-omics data integration
omics data integration |
0.6 | 1 | 2022 | Identifying interactions in omics data for clinical biomarker discovery using symbolic regression · Bioinform. 2022 |
Computational science and engineering › scientific machine learning
symbolic regression |
0.6 | 1 | 2022 | Identifying interactions in omics data for clinical biomarker discovery using symbolic regression · Bioinform. 2022 |
Medical and health informatics
precision medicine |
0.2 | 1 | 2022 | Identifying interactions in omics data for clinical biomarker discovery using symbolic regression · Bioinform. 2022 |
Methods — techniques the papers use, named apart from their topics
symbolic regression · 0.6feature selection · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert InterpretationabstractSymbolic regression searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging sub-tasks of regression such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern symbolic regression algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of symbolic regression algorithms and highlight possible improvements for the benchmark itself. Fabrício Olivetti de França, Marco Virgolin, Michael Kommenda, Maimuna S. Majumder, Miles D. Cranmer, Guilherme Espada, Leon Ingelse, Alcides Fonseca, Mikel Landajuela, Brenden K. Petersen, Ruben Glatt, T. Nathan Mundhenk, Chak Shing Lee, Jacob D. Hochhalter, David L. Randall, P. Kamienny, Hengzhe Zhang, Grant Dick, Alessandro Simon, Bogdan Burlacu, Jaan Kasak, Meera Vieira Machado, Casper Wilstrup, William G. La Cava |
IEEE Trans. Evol. Comput. | 22 |
| 2022 | Identifying interactions in omics data for clinical biomarker discovery using symbolic regressionabstractMOTIVATION: The identification of predictive biomarker signatures from omics and multi-omics data for clinical applications is an active area of research. Recent developments in assay technologies and machine learning (ML) methods have led to significant improvements in predictive performance. However, most high-performing ML methods suffer from complex architectures and lack interpretability. RESULTS: We present the application of a novel symbolic-regression-based algorithm, the QLattice, on a selection of clinical omics datasets. This approach generates parsimonious high-performing models that can both predict disease outcomes and reveal putative disease mechanisms, demonstrating the importance of selecting maximally relevant and minimally redundant features in omics-based machine-learning applications. The simplicity and high-predictive power of these biomarker signatures make them attractive tools for high-stakes applications in areas such as primary care, clinical decision-making and patient stratification. AVAILABILITY AND IMPLEMENTATION: The QLattice is available as part of a python package (feyn), which is available at the Python Package Index (https://pypi.org/project/feyn/) and can be installed via pip. The documentation provides guides, tutorials and the API reference (https://docs.abzu.ai/). All code and data used to generate the models and plots discussed in this work can be found in https://github.com/abzu-ai/QLattice-clinical-omics. SUPPLEMENTARY INFORMATION: Supplementary material is available at Bioinformatics online. Niels Johan Christensen, Samuel Demharter, Meera Vieira Machado, Lykke Pedersen, Marco Salvatore, Valdemar Stentoft-Hansen, Miquel Triana Iglesias |
Bioinform. | 3 |