Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dipanwita Saha

dblp:276/5278 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0004-1071-7758ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 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
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › online advertising
ad targeting
1.012026
Item-Targeting with Keyword Enhancement: A Hybrid Approach to Ads Targeting · SIGIR 2026
Information retrieval
online advertising
1.012026
Item-Targeting with Keyword Enhancement: A Hybrid Approach to Ads Targeting · SIGIR 2026
Information retrieval › query understanding
query representation
0.312026
Item-Targeting with Keyword Enhancement: A Hybrid Approach to Ads Targeting · SIGIR 2026
Information retrieval › document processing › document analysis › document representation
semantic embedding
0.312026
Item-Targeting with Keyword Enhancement: A Hybrid Approach to Ads Targeting · SIGIR 2026

Methods — techniques the papers use, named apart from their topics

semantic embedding · 1.0adaptive thresholding · 1.0a/b testing · 1.0
YearPublicationVenuePosition
2026 Item-Targeting with Keyword Enhancement: A Hybrid Approach to Ads Targeting
abstract
Modern digital advertising systems rely on two primary targeting mechanisms: keyword targeting, where advertisers manually specify search terms, and item-based targeting, which matches ads to buyer queries through semantic similarity. While both approaches are effective in isolation, they leave a coverage gap, particularly for broad queries and new items, where item-based targeting often underperforms. This paper presents a novel hybrid targeting framework that bridges this gap by transferring successful query–item associations from keyword targeting into item-based campaigns via semantic embeddings. Our method leverages historical query–item pairs to create robust query representations and applies similarity-driven transfer to expand the candidate query set for item-targeted ads. To balance coverage and quality, we introduce adaptive thresholding and evaluate multiple query selection strategies. Experimental results, including large-scale A/B tests on eBay's advertising platform, demonstrate that our approach significantly expands impression coverage for broad queries while maintaining relevance. The best-performing configuration selected a small set of high-quality queries per item combined with an adaptive relevance threshold, achieving over 5% incremental coverage while preserving click-through rate (CTR) and conversions-over-impression (CVI) performance. These findings highlight the effectiveness of combining the breadth of keyword targeting with the precision of item-based targeting, offering a scalable solution to the coverage gap in ad marketplaces.
Dipanwita Saha, Xinxin Shu, Abraham Bagherjeiran
SIGIR2