Demo Data from EDBT 2026 / reviewers in the wild / expert
Maja Trebacz
dblp:276/1122
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, 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 · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
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
cancer genomics |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Bioinformatics and computational biology
gene expression analysis |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Bioinformatics and computational biology › statistical genetics
phenotype prediction |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Machine learning › Graph learning
graph neural network |
0.2 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Methods — techniques the papers use, named apart from their topics
topological clustering · 1.1protein-protein interaction network · 1.1inductive bias · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biasesabstractMOTIVATION: Gene expression data are commonly used at the intersection of cancer research and machine learning for better understanding of the molecular status of tumour tissue. Deep learning predictive models have been employed for gene expression data due to their ability to scale and remove the need for manual feature engineering. However, gene expression data are often very high dimensional, noisy and presented with a low number of samples. This poses significant problems for learning algorithms: models often overfit, learn noise and struggle to capture biologically relevant information. In this article, we utilize external biological knowledge embedded within structures of gene interaction graphs such as protein-protein interaction (PPI) networks to guide the construction of predictive models. RESULTS: We present Gene Interaction Network Constrained Construction (GINCCo), an unsupervised method for automated construction of computational graph models for gene expression data that are structurally constrained by prior knowledge of gene interaction networks. We employ this methodology in a case study on incorporating a PPI network in cancer phenotype prediction tasks. Our computational graphs are structurally constructed using topological clustering algorithms on the PPI networks which incorporate inductive biases stemming from network biology research on protein complex discovery. Each of the entities in the GINCCo computational graph represents biological entities such as genes, candidate protein complexes and phenotypes instead of arbitrary hidden nodes of a neural network. This provides a biologically relevant mechanism for model regularization yielding strong predictive performance while drastically reducing the number of model parameters and enabling guided post-hoc enrichment analyses of influential gene sets with respect to target phenotypes. Our experiments analysing a variety of cancer phenotypes show that GINCCo often outperforms support vector machine, Fully Connected Multi-layer Perceptrons (MLP) and Randomly Connected MLPs despite greatly reduced model complexity. AVAILABILITY AND IMPLEMENTATION: https://github.com/paulmorio/gincco contains the source code for our approach. We also release a library with algorithms for protein complex discovery within PPI networks at https://github.com/paulmorio/protclus. This repository contains implementations of the clustering algorithms used in this article. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Paul Scherer, Maja Trebacz, Nikola Simidjievski, Ramón Viñas 0001, Zohreh Shams, Helena Andrés-Terré, Mateja Jamnik, Pietro Liò |
Bioinform. | 2 |