VLDB 2026 Research / reviewers in the wild / expert
Ellen Visscher
dblp:430/1586
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| 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 |
|---|---|---|---|---|
Recommender systems › collaborative filtering › matrix factorization
boolean matrix factorization |
1.0 | 1 | 2026 | Hybrid Restricted Master Problem for Boolean Matrix Factorisation · AAAI 2026 |
Recommender systems › collaborative filtering
matrix factorization |
1.0 | 1 | 2026 | Hybrid Restricted Master Problem for Boolean Matrix Factorisation · AAAI 2026 |
Mathematical optimization
combinatorial optimization |
1.0 | 1 | 2026 | Hybrid Restricted Master Problem for Boolean Matrix Factorisation · AAAI 2026 |
Bioinformatics and computational biology › single-cell analysis
single-cell RNA sequencing |
0.3 | 1 | 2026 | Hybrid Restricted Master Problem for Boolean Matrix Factorisation · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
heuristic algorithm · 3.0combinatorial optimization · 3.0clustering · 3.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hybrid Restricted Master Problem for Boolean Matrix FactorisationabstractWe present bfact, a Python package for performing accurate low-rank Boolean matrix factorisation (BMF). bfact uses a hybrid combinatorial optimisation approach based on a priori candidate factors generated from clustering algorithms. It selects the best disjoint factors before performing either a second combinatorial or heuristic algorithm to recover the BMF. We show that bfact does particularly well at estimating the true rank of matrices in simulated settings. In real benchmarks, using a collation of single-cell RNA-sequencing datasets from the Human Lung Cell Atlas, we show that bfact achieves strong signal recovery, with a much lower rank. Ellen Visscher, Christopher Yau |
AAAI | 1 |