Towards intent-driven bidterm suggestion

Published 20 April 2009

William I. Chang, Patrick Pantel, Ana-Maria Popescu, Evgeniy Gabrilovich

Citations15

TL;DR

A large-scale bidterm suggestion system that models an advertiser's intent and finds new bidterms consistent with that intent, and preliminary experiments show that the system significantly increases the coverage of a state of the art production system used at Yahoo while maintaining comparable precision.

Abstract

In online advertising, pervasive in commercial search engines, advertisers typically bid on few terms, and the scarcity of data makes ad matching difficult. Suggesting additional bidterms can significantly improve ad clickability and conversion rates. In this paper, we present a large-scale bidterm suggestion system that models an advertiser's intent and finds new bidterms consistent with that intent. Preliminary experiments show that our system significantly increases the coverage of a state of the art production system used at Yahoo while maintaining comparable precision.

Keywords

Computer Science

Automatic Query expansion using SMART : TREC 3

467 Citations1994Chris Buckley, Gerard Salton +2 more

This work continues the work in TREC 3, performing runs in the routing, ad-hoc, and foreign language environments, with a major focus on massive query expansion, adding from 300 to 530 terms to each query.

Learning query intent from regularized click graphs

335 Citations2008Xiao Li, Ye‐Yi Wang +1 more

This work aims at drastically increasing the amounts of training data by semi-supervised learning with click graphs by inferring class memberships of unlabeled queries from those of labeled ones according to their proximities in a click graph.

Efficient set joins on similarity predicates

327 Citations2004Sunita Sarawagi, Alok Kirpal

This paper presents an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coefficient, cosine similarity, and edit-distance that generalize to several weighted and unweighted measures of partial word overlap between sets.

Pairwise document similarity in large collections with MapReduce

204 Citations2008Tamer Elsayed, Jimmy Lin +1 more

This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections that exhibits linear growth in running time and space in terms of the number of documents.

View PDF

Keyword generation for search engine advertising using semantic similarity between terms

118 Citations2007Vibhanshu Abhishek, Kartik Hosanagar

This paper seeks to establish a mathematical formulation of this problem and suggests a method for generation of several terms from a seed keyword by using a web based kernel function to establish semantic similarity between terms.

Keyword Generation for Search Engine Advertising

110 Citations2006Amruta Joshi, Rajeev Motwani

This approach leverages search engines to determine relevance between terms and captures their semantic relationships as a directed graph, which generates the common as well as the nonobvious keywords related to a term.

Optimizing relevance and revenue in ad search

99 Citations2008Filip Radlinski, Andrei Broder +4 more

This work addresses the problem of selecting ads so that they are both relevant to the queries and profitable to the search engine, and proposes a novel two-stage approach, which conducts most of the analysis ahead of time.

SVD based Term Suggestion and Ranking System

26 Citations2005David F. Gleich, Leonid Zhukov

It is demonstrated that SVD subspace-based methods: 1) expand coverage by reordering the results, and 2) enhance the clustered structure of the data.

Similar Term Discovery using Web Search

5 Citations2008Peter Anick, V. Murthi +1 more