EDBT 2026 Demo / reviewers in the wild / expert
Robin Dua
dblp:240/9445
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
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 |
Information retrieval · 77% Machine learning and data management · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › search engines
web crawling |
0.4 | 1 | 2019 | Predictive Crawling for Commercial Web Content · WWW 2019 |
Methods — techniques the papers use, named apart from their topics
price change prediction · 0.4machine learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Predictive Crawling for Commercial Web ContentabstractWeb crawlers spend significant resources to maintain freshness of their crawled data. This paper describes the optimization of resources to ensure that product prices shown in ads in a context of a shopping sponsored search service are synchronized with current merchant prices. We are able to use the predictability of price changes to build a machine learned system leading to considerable resource savings for both the merchants and the crawler. We describe our solution to technical challenges due to partial observability of price history, feedback loops arising from applying machine learned models, and offers in cold start state. Empirical evaluation over large-scale product crawl data demonstrates the effectiveness of our model and confirms its robustness towards unseen data. We argue that our approach can be applicable in more general data pull settings. Shuguang Han, Bernhard Brodowsky, Przemek Gajda, Sergey Novikov, Michael Bendersky, Marc Najork, Robin Dua, Alexandrin Popescul |
WWW | 7 |