Demo Data from EDBT 2026 / reviewers in the wild / expert
Luis Pérez-Breva
dblp:20/1774
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Learning theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein function prediction › protein classification
DNA-binding protein prediction |
0.1 | 1 | 2006 | Game Theoretic Algorithms for Protein-DNA binding · NIPS 2006 |
Algorithmic game theory and mechanism design › computational game theory
game-theoretic algorithms |
0.1 | 1 | 2006 | Game Theoretic Algorithms for Protein-DNA binding · NIPS 2006 |
Algorithmic game theory and mechanism design
resource allocation |
0.1 | 1 | 2006 | Game Theoretic Algorithms for Protein-DNA binding · NIPS 2006 |
Machine learning › Learning theory
generalization bounds |
0.0 | 1 | 2000 | Bounds on the Generalization Performance of Kernel Machine Ensembles · ICML 2000 |
Bioinformatics and computational biology › gene regulation
gene regulatory network |
0.0 | 1 | 2006 | Game Theoretic Algorithms for Protein-DNA binding · NIPS 2006 |
Methods — techniques the papers use, named apart from their topics
resource constraints · 0.1game theory · 0.1kernel methods · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Learning disease relationships from clinical drug trialsabstractOBJECTIVE: Our objective is to test the limits of the assumption that better learning from data in medicine requires more granular data. We hypothesize that clinical trial metadata contains latent scientific, clinical, and regulatory expert knowledge that can be accessed to draw conclusions about the underlying biology of diseases. We seek to demonstrate that this latent information can be uncovered from the whole body of clinical trials. MATERIALS AND METHODS: We extract free-text metadata from 93 654 clinical drug trials and introduce a representation that allows us to compare different trials. We then construct a network of diseases using only the trial metadata. We view each trial as the summation of expert knowledge of biological mechanisms and medical evidence linking a disease to a drug believed to modulate the pathways of that disease. Our network representation allows us to visualize disease relationships based on this underlying information. RESULTS: Our disease network shows surprising agreement with another disease network based on genetic data and on the Medical Subject Headings (MeSH) taxonomy, yet also contains unique disease similarities. DISCUSSION AND CONCLUSION: The agreement of our results with other sources indicates that our premise regarding latent expert knowledge holds. The disease relationships unique to our network may be used to generate hypotheses for future biological and clinical research as well as drug repurposing and design. Our results provide an example of using experimental data on humans to generate biologically useful information and point to a set of new and promising strategies to link clinical outcomes data back to biological research. Bryan Haslam, Luis Pérez-Breva |
J. Am. Medical Informatics Assoc. | 2 |
| 2006 | Game Theoretic Algorithms for Protein-DNA bindingabstractWe develop and analyze game-theoretic algorithms for predicting coordinate binding of multiple DNA binding regulators. The allocation of proteins to local neighborhoods and to sites is carried out with resource constraints while explicating competing and coordinate binding relations among proteins with affinity to the site or region. The focus of this paper is on mathematical foundations of the approach. We also briefly demonstrate the approach in the context of the -phage switch. Luis Pérez-Breva, Luis E. Ortiz, Chen-Hsiang Yeang, Tommi S. Jaakkola |
NIPS | 1 |
| 2000 | Bounds on the Generalization Performance of Kernel Machine Ensembles
Theodoros Evgeniou, Luis Pérez-Breva, Massimiliano Pontil, Tomaso A. Poggio |
ICML | 2 |