Demo Data from SIGIR 2026 / reviewers in the wild / expert
Han-Yun Tsao
dblp:142/3417
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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 |
Data mining · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
causal inference |
0.2 | 1 | 2014 | An efficient framework for online advertising effectiveness measurement and comparison · WSDM 2014 |
Data mining
observational data analysis |
0.2 | 1 | 2014 | An efficient framework for online advertising effectiveness measurement and comparison · WSDM 2014 |
Parallel and multicore computing
parallel computing |
0.1 | 1 | 2014 | An efficient framework for online advertising effectiveness measurement and comparison · WSDM 2014 |
Methods — techniques the papers use, named apart from their topics
subsampling-and-backscaling · 0.4inverse propensity weighting · 0.4gradient boosting · 0.4doubly robust estimation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | An efficient framework for online advertising effectiveness measurement and comparisonabstractIn online advertising market it is crucial to provide advertisers with a reliable measurement of advertising effectiveness to make better marketing campaign planning. The basic idea for ad effectiveness measurement is to compare the performance (e.g., success rate) among users who were and who were not exposed to a certain treatment of ads. When a randomized experiment is not available, a naive comparison can be biased because exposed and unexposed populations typically have different features. One solid methodology for a fair comparison is to apply inverse propensity weighting with doubly robust estimation to the observational data. However the existing methods were not designed for the online advertising campaign, which usually suffers from huge volume of users, high dimensionality, high sparsity and imbalance. We propose an efficient framework to address these challenges in a real campaign circumstance. We utilize gradient boosting stumps for feature selection and gradient boosting trees for model fitting, and propose a subsampling-and-backscaling procedure that enables analysis on extremely sparse conversion data. The choice of features, models and feature selection scheme are validated with irrelevant conversion test. We further propose a parallel computing strategy, combined with the subsampling-and-backscaling procedure to reach computational efficiency. Our framework is applied to an online campaign involving millions of unique users, which shows substantially better model fitting and efficiency. Our framework can be further generalized to comparison of multiple treatments and more general treatment regimes, as sketched in the paper. Our framework is not limited to online advertising, but also applicable to other circumstances (e.g., social science) where a 'fair' comparison is needed with observational data. Pengyuan Wang 0001, Yechao Liu, Marsha Meytlis, Han-Yun Tsao, Jian Yang 0002, Pei Huang 0008 |
WSDM | 4 |