Demo Data from EDBT 2026 / reviewers in the wild / expert
Uwe Dick
dblp:18/1368
· DBLP profile ↗
6ranked-venue papers
5as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 2 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.
| Artificial intelligence
1 paper |
Learning theory · 50% Probabilistic and Bayesian machine learning · 50% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › continuous optimization
convex optimization |
0.1 | 1 | 2010 | Throttling Poisson Processes · NIPS 2010 |
Machine learning › Learning theory › online learning › learning with partial information
learning with missing data |
0.1 | 1 | 2008 | Learning from incomplete data with infinite imputations · ICML 2008 |
Machine learning › Probabilistic and Bayesian machine learning
missing data |
0.1 | 1 | 2008 | Learning from incomplete data with infinite imputations · ICML 2008 |
Data integration and cleaning › missing data
missing value imputation |
0.1 | 1 | 2008 | Learning from incomplete data with infinite imputations · ICML 2008 |
Methods — techniques the papers use, named apart from their topics
joint optimization · 0.2imputation · 0.2poisson process modeling · 0.1convex optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Who can receive the pass? A computational model for quantifying availability in soccerabstractAbstract The paper presents a computational approach to Availability of soccer players. Availability is defined as the probability that a pass reaches the target player without being intercepted by opponents. Clearly, a computational model for this probability grounds on models for ball dynamics, player movements, and technical skills of the pass giver. Our approach aggregates these quantities for all possible passes to the target player to compute a single Availability value. Empirically, our approach outperforms state-of-the-art competitors using data from 58 professional soccer matches. Moreover, our experiments indicate that the model can even outperform soccer coaches in assessing the availability of soccer players from static images. Uwe Dick, Daniel Link 0002, Ulf Brefeld |
Data Min. Knowl. Discov. | 1 |
| 2016 | Learning to control a structured-prediction decoder for detection of HTTP-layer DDoS attackers
Uwe Dick, Tobias Scheffer |
Mach. Learn. | 1 |
| 2010 | Throttling Poisson ProcessesabstractWe study a setting in which Poisson processes generate sequences of decision-making events. The optimization goal is allowed to depend on the rate of decision outcomes; the rate may depend on a potentially long backlog of events and decisions. We model the problem as a Poisson process with a throttling policy that enforces a data-dependent rate limit and reduce the learning problem to a convex optimization problem that can be solved efficiently. This problem setting matches applications in which damage caused by an attacker grows as a function of the rate of unsuppressed hostile events. We report on experiments on abuse detection for an email service. Uwe Dick, Peter Haider, Thomas Vanck, Michael Brückner, Tobias Scheffer |
NIPS | 1 |
| 2008 | Learning from incomplete data with infinite imputationsabstractWe address the problem of learning decision functions from training data in which some attribute values are unobserved. This problem can arise, for instance, when training data is aggregated from multiple sources, and some sources record only a subset of attributes. We derive a generic joint optimization problem in which the distribution governing the missing values is a free parameter. We show that the optimal solution concentrates the density mass on finitely many imputations, and provide a corresponding algorithm for learning from incomplete data. We report on empirical results on benchmark data, and on the email spam application that motivates our work. 1. Uwe Dick, Peter Haider, Tobias Scheffer |
ICML | 1 |
| 2006 | Fisher Kernels for Relational Data
Uwe Dick, Kristian Kersting |
ECML | 1 |
| 2004 | Balios - The Engine for Bayesian Logic Programs
Kristian Kersting, Uwe Dick |
PKDD | 2 |