A
Andrei Z. Broder
Researcher at Google
Publications - 241
Citations - 28441
Andrei Z. Broder is an academic researcher from Google. The author has contributed to research in topics: Web search query & Web page. The author has an hindex of 67, co-authored 241 publications receiving 27310 citations. Previous affiliations of Andrei Z. Broder include AmeriCorps VISTA & IBM.
Papers
More filters
Proceedings ArticleDOI
Search advertising using web relevance feedback
Andrei Z. Broder,Peter Ciccolo,Marcus Fontoura,Evgeniy Gabrilovich,Vanja Josifovski,Lance Riedel +5 more
TL;DR: Empirical evaluation based on over 9,000 query-ad pairwise judgments confirms that using augmented queries produces highly relevant ads.
Proceedings ArticleDOI
Online expansion of rare queries for sponsored search
Andrei Z. Broder,Peter Ciccolo,Evgeniy Gabrilovich,Vanja Josifovski,Donald Metzler,Lance Riedel,Jeffrey Yuan +6 more
TL;DR: This paper describes an efficient and effective approach for matching ads against rare queries that were not processed offline, and shows that the approach significantly improves the effectiveness of advertising on rare queries with only a negligible increase in computational cost.
Proceedings ArticleDOI
Optimizing relevance and revenue in ad search: a query substitution approach
Filip Radlinski,Andrei Z. Broder,Peter Ciccolo,Evgeniy Gabrilovich,Vanja Josifovski,Lance Riedel +5 more
TL;DR: 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.
Balanced Allocations (Extended abstract)
TL;DR: It is shown that with high probability, the fullest box contains only lnlnn/ln2 + O(1) balls - exponentially less than before - and that a similar gap exists in the infinite process, where at each step one ball, chosen uniformly at random, is deleted, and one ball is added.
Proceedings ArticleDOI
Sampling search-engine results
TL;DR: This work presents and analyzes an efficient algorithm for obtaining uniform random samples applicable to any search engine based on posting lists and document-at-a-time evaluation and shows how to construct next(p) methods for Boolean operators (AND, OR, WAND) from primitive methods.