Demo Data from VLDB 2026 / reviewers in the wild / expert
Ali Azizpour
dblp:368/8407
· DBLP profile ↗
2ranked-venue papers
2as 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 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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% |
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
metagenomics |
0.8 | 1 | 2024 | GraSSRep: Graph-Based Self-supervised Learning for Repeat Detection in Metagenomic Assembly · RECOMB 2024 |
Bioinformatics and computational biology › metagenomics
metagenomic assembly |
0.8 | 1 | 2024 | GraSSRep: Graph-Based Self-supervised Learning for Repeat Detection in Metagenomic Assembly · RECOMB 2024 |
Bioinformatics and computational biology › sequence analysis
repeat detection |
0.8 | 1 | 2024 | GraSSRep: Graph-Based Self-supervised Learning for Repeat Detection in Metagenomic Assembly · RECOMB 2024 |
Bioinformatics and computational biology
sequence analysis |
0.8 | 1 | 2024 | GraSSRep: Graph-Based Self-supervised Learning for Repeat Detection in Metagenomic Assembly · RECOMB 2024 |
Methods — techniques the papers use, named apart from their topics
self-supervised learning · 0.8graph neural network · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Scalable Implicit Graphon LearningabstractGraphons are continuous models that represent the structure of graphs and allow the generation of graphs of varying sizes. We propose Scalable Implicit Graphon Learning (SIGL), a scalable method that combines implicit neural representations (INRs) and graph neural networks (GNNs) to estimate a graphon from observed graphs. Unlike existing methods, which face important limitations like fixed resolution and scalability issues, SIGL learns a continuous graphon at arbitrary resolutions. GNNs are used to determine the correct node ordering, improving graph alignment. Furthermore, we characterize the asymptotic consistency of our estimator, showing that more expressive INRs and GNNs lead to consistent estimators. We evaluate SIGL in synthetic and real-world graphs, showing that it outperforms existing methods and scales effectively to larger graphs, making it ideal for tasks like graph data augmentation. Ali Azizpour, Nicolas Zilberstein, Santiago Segarra |
AISTATS | 1 |
| 2024 | GraSSRep: Graph-Based Self-supervised Learning for Repeat Detection in Metagenomic Assembly
Ali Azizpour, Advait Balaji, Todd J. Treangen, Santiago Segarra |
RECOMB | 1 |