BBM: Bayesian Browsing Model from Petabyte-scale Data

Given a quarter of petabyte click log data, how can we esti- mate the relevance of each URL for a given query? In this paper, we propose the Bayesian Browsing Model (BBM), a new modeling technique with following advantages: (a) it does exact inference; (b) it is single-pass and parallelizable; (c) it is effective. We present two sets of experiments to test model effec- tiveness and efficiency. On the first set of over 50 million search instances of 1.1 million distinct queries, BBM out- performs the state-of-the-art competitor by 29.2% in log- likelihood while being 57 times faster. On the second click- log set, spanning a quarter of petabyte data, we showcase the scalability of BBM: we implemented it on a commercial MapReduce cluster, and it took only 3 hours to compute the relevance for 1.15 billion distinct query-URL pairs.

PDF file
PowerPoint presentation

In  KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining

Publisher  Association for Computing Machinery, Inc.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or The definitive version of this paper can be found at ACM’s Digital Library --


> Publications > BBM: Bayesian Browsing Model from Petabyte-scale Data