Demo Data from EDBT 2026 / reviewers in the wild / expert
Saumya Gaurang Shah
dblp:421/0458
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 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 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 |
Data mining · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
anomaly detection |
0.9 | 1 | 2025 | SEAD: Unsupervised Ensemble of Streaming Anomaly Detectors · ICML 2025 |
Data mining › anomaly detection
streaming anomaly detection |
0.9 | 1 | 2025 | SEAD: Unsupervised Ensemble of Streaming Anomaly Detectors · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
ensemble selection · 0.9drift adaptation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SEAD: Unsupervised Ensemble of Streaming Anomaly DetectorsabstractCan we efficiently choose the best Anomaly Detection (AD) algorithm for a data-stream without requiring anomaly labels? Streaming anomaly detection is hard. SOTA AD algorithms are sensitive to their hyperparameters and no single method works well on all datasets. The best algorithm/hyper-parameter combination for a given data-stream can change over time with data drift.
'What is an anomaly?' is often application, context and dataset dependent.
We propose SEAD (Streaming Ensemble of Anomaly Detectors), the first model selection algorithm for streaming, unsupervised AD. All prior AD model selection algorithms are either supervised, or only work in the offline setting when all data from the test set is available upfront. We show that SEAD is {\em(i)} unsupervised, i.e., requires no true anomaly labels, {\em(ii)} efficiently implementable in a streaming setting, {\em (iii)} agnostic to the choice of the base algorithms among which it chooses from, and {\em (iv)} adaptive to non-stationarity in the data-stream. Experiments on 14 non-trivial public datasets and an internal dataset corroborate our claims. Saumya Gaurang Shah, Abishek Sankararaman, Balakrishnan Narayanaswamy, Vikramank Y. Singh |
ICML | 1 |