Demo Data from VLDB 2026 / reviewers in the wild / expert
Reena Somvanshi
dblp:223/3204
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—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 |
Information retrieval · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising › sponsored search
query-ad matching |
0.3 | 1 | 2018 | Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search · KDD 2018 |
Information retrieval › online advertising › sponsored search
query-ad relevance |
0.3 | 1 | 2018 | Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search · KDD 2018 |
Information retrieval › online advertising
sponsored search |
0.3 | 1 | 2018 | Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search · KDD 2018 |
Methods — techniques the papers use, named apart from their topics
word2vec · 0.3n-gram embedding · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored SearchabstractSponsored search has been the major source of revenue for commercial web search engines. It is crucial for a sponsored search engine to retrieve ads that are relevant to user queries to attract clicks as advertisers only pay when their ads get clicked. Retrieving relevant ads for a query typically involves in first matching related ads to the query and then filtering out irrelevant ones. Both require understanding the semantic relationship between a query and an ad. In this work, we propose a novel embedding of queries and ads in sponsored search. The query embeddings are generated from constituent word n-gram embeddings that are trained to optimize an event level word2vec objective over a large volume of search data. We show through a query rewriting task that the proposed query n-gram embedding model outperforms the state-of-the-art word embedding models for capturing query semantics. This allows us to apply the proposed query n-gram embedding model to improve query-ad matching and relevance in sponsored search. First, we use the similarity between a query and an ad derived from the query n-gram embeddings as an additional feature in the query-ad relevance model used in Yahoo Search. We show through online A/B test that using the new relevance model to filter irrelevant ads offline leads to 0.47% CTR and 0.32% revenue increase. Second, we propose a novel online query to ads matching system, built on an open-source big-data serving engine [30], using the learned query n-gram embeddings. Online A/B test shows that the new matching technique increases the search revenue by 2.32% as it significantly increases the ad coverage for tail queries. Xiao Bai 0002, Erik Ordentlich, Andy Feng, Adwait Ratnaparkhi, Reena Somvanshi, Aldi Tjahjadi |
KDD | 6 |