Demo Data from VLDB 2026 / reviewers in the wild / expert
Carlos Cruchaga
dblp:261/1741
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 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 › knowledge representation in biology
biomedical knowledge graph |
1.0 | 1 | 2026 | BioMedGraphica: an all-in-one platform for joint textual biomedical prior knowledge and numeric graph generation · Bioinform. 2026 |
Bioinformatics and computational biology
data integration |
1.0 | 1 | 2026 | BioMedGraphica: an all-in-one platform for joint textual biomedical prior knowledge and numeric graph generation · Bioinform. 2026 |
Machine learning › Graph learning › graph neural network
expressive power |
0.8 | 1 | 2024 | Rethinking the Power of Graph Canonization in Graph Representation Learning with Stability · ICLR 2024 |
Machine learning › Graph learning
graph neural network |
0.8 | 1 | 2024 | Rethinking the Power of Graph Canonization in Graph Representation Learning with Stability · ICLR 2024 |
Machine learning › Graph learning
graph representation learning |
0.8 | 1 | 2024 | Rethinking the Power of Graph Canonization in Graph Representation Learning with Stability · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
large language model · 1.0graph analysis · 1.0spectral analysis · 0.8graph canonization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | BioMedGraphica: an all-in-one platform for joint textual biomedical prior knowledge and numeric graph generationabstractMOTIVATION: Multiomics data analysis is essential for scientific discovery in precision medicine. However, translating analysis results of omics data analysis into novel scientific hypotheses remains a significant challenge. Human experts must manually review analysis results and generate new hypotheses based on extensive and interconnected biomedical prior knowledge, which is subjective and not scalable. While large language models can accelerate the discovery, their reasoning improves when grounded in structured, auditable, and comprehensive biomedical prior knowledge. However, biomedical knowledge is scattered across heterogeneous databases that use diverse and inconsistent nomenclature systems, making it difficult to integrate resources into a unified format for scalable analysis. This fragmentation limits the ability of artificial intelligence systems to fully leverage biomedical data for scientific discovery. RESULTS: We developed BioMedGraphica, a novel all-in-one platform that harmonizes fragmented biomedical resources by integrating 11 entity types and 30 relation types from 43 databases into a unified textual prior knowledge graph containing 2 306 921 entities and 27 232 091 relations. In addition, we present a novel textual-numeric graph (TNG) data structure concept, where textual information captures prior biological knowledge (e.g. transcription start sites, functions, mechanisms), numeric values represent quantitative biomedical features, and the integrated relations can help uncover mechanisms. By bridging prior knowledge with user-specific data, TNG is a novel and ideal data structure for developing novel graph analysis models. AVAILABILITY AND IMPLEMENTATION: The code is available at: https://github.com/FuhaiLiAiLab/BioMedGraphica and BioMedGraphica knowledge graph database can be downloaded from huggingface dataset: https://huggingface.co/datasets/FuhaiLiAiLab/BioMedGraphica. Heming Zhang 0002, Shunning Liang, Tim Xu, Yuhan Dong, Guangfu Li, S. Peter Goedegebuure, Marco Sardiello, Jonathan Cooper, William Buchser, Patricia Dickson, Ryan C. Fields, Carlos Cruchaga, Michael A. Province, Philip R. O. Payne, Fuhai Li 0001 |
Bioinform. | 15 |
| 2024 | Rethinking the Power of Graph Canonization in Graph Representation Learning with StabilityabstractThe expressivity of Graph Neural Networks (GNNs) has been studied broadly in recent years to reveal the design principles for more powerful GNNs. Graph canonization is known as a typical approach to distinguish non-isomorphic graphs, yet rarely adopted when developing expressive GNNs. This paper proposes to maximize the expressivity of GNNs by graph canonization, then the power of such GNNs is studies from the perspective of model stability. A stable GNN will map similar graphs to close graph representations in the vectorial space, and the stability of GNNs is critical to generalize their performance to unseen graphs. We theoretically reveal the trade-off of expressivity and stability in graph-canonization-enhanced GNNs. Then we introduce a notion of universal graph canonization as the general solution to address the trade-off and characterize a widely applicable sufficient condition to solve the universal graph canonization. A comprehensive set of experiments demonstrates the effectiveness of the proposed method. In many popular graph benchmark datasets, graph canonization successfully enhances GNNs and provides highly competitive performance, indicating the capability and great potential of proposed method in general graph representation learning. In graph datasets where the sufficient condition holds, GNNs enhanced by universal graph canonization consistently outperform GNN baselines and successfully improve the SOTA performance up to $31$%, providing the optimal solution to numerous challenging real-world graph analytical tasks like gene network representation learning in bioinformatics. Zehao Dong, Muhan Zhang, Philip R. O. Payne, Michael A. Province, Carlos Cruchaga, Fuhai Li 0001, Yixin Chen 0001 |
ICLR | 5 |
| 2023 | Predicting COVID-19 Severity Using a Cut-and-Solve Feature Selection ApproachabstractIndividuals with coronavirus disease 2019 (COVID-19) infection present in a variety of ways, ranging from asymptomatic or mild cough, to organ failure or death. One of the major challenges for the medical community is the quick and accurate determination of how COVID-19 will progress in an individual. Herein, we introduce a new Cut-and-Solve based feature selection program for identifying predictive feature sets in heterogeneous data. We analyze proteomics data from Washington University to identify models ranging in size from a single feature up to five. Validation of logistic regression models using area under the curve (AUC) were applied for both a holdout data set and an independent data set from Massachusetts General Hospital. A variety of known and novel biomarkers for COVID-19 severity were identified. The best model for predicting severe (ventilation or death) vs. non-severe infection is achieved for CALCOCO2 and STC1, with an average AUC=0.81. Based on the known severity markers, several different proteomic pathways are identified. Enrichment analysis indicates activity associated with inflammatory response, as well as myelination and cardiac function. Kenneth Smith 0003, John Brandenburg, Katarina A Jones, Shawn R. Campagna, Michael Garvin, Alan R. Templeton, Daniel A. Jacobson, Carlos Cruchaga, Sharlee Climer |
BIBM | 9 |