@inproceedings{ DBLP:conf/icml/GraepelCBH10,
  author    = {Thore Graepel and Joaquin Qui nonero Candela and Thomas Borchert and Ralf Herbrich},
  title     = {Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine}, 
  abstract   = {We describe a new Bayesian click-through rate (CTR) prediction algorithm used for Sponsored Search in Microsoft’s Bing search engine. The algorithm is based on a probit regression model that maps discrete or real-valued input features to probabilities. It maintains Gaussian beliefs over weights of the model and performs Gaussian online updates derived from approximate message passing. Scalability of the algorithm is ensured through a principled weight pruning procedure and an approximate parallel implementation. We discuss the challenges arising from evaluating and tuning the predictor as part of the complex system of sponsored search where the predictions made by the algorithm decide about future training sample composition. Finally, we show experimental results from the production system and compare to a calibrated Na\"{\i}ve Bayes algorithm.},
  booktitle   = {Proceedings of the 27th International Conference on Machine Learning},
  pages   = {13--20},
  url   = {http://www.herbrich.me/papers/adpredictor.pdf} ,
  year   = {2010}
}

{"_id":{"_str":"51fc6137c5b22c38760013dc"},"__v":20,"authorIDs":["5456e9a38b01c8193000005e","54576c282abc8e9f370003ae"],"author_short":["Graepel, T.","nonero Candela, J. Q.","Borchert, T.","Herbrich, R."],"bibbaseid":"graepel-nonerocandela-borchert-herbrich-webscalebayesianclickthroughratepredictionforsponsoredsearchadvertisinginmicrosoft39sbingsearchengine-2010","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Thore"],"propositions":[],"lastnames":["Graepel"],"suffixes":[]},{"firstnames":["Joaquin","Qui"],"propositions":["nonero"],"lastnames":["Candela"],"suffixes":[]},{"firstnames":["Thomas"],"propositions":[],"lastnames":["Borchert"],"suffixes":[]},{"firstnames":["Ralf"],"propositions":[],"lastnames":["Herbrich"],"suffixes":[]}],"title":"Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine","abstract":"We describe a new Bayesian click-through rate (CTR) prediction algorithm used for Sponsored Search in Microsoft’s Bing search engine. The algorithm is based on a probit regression model that maps discrete or real-valued input features to probabilities. It maintains Gaussian beliefs over weights of the model and performs Gaussian online updates derived from approximate message passing. Scalability of the algorithm is ensured through a principled weight pruning procedure and an approximate parallel implementation. We discuss the challenges arising from evaluating and tuning the predictor as part of the complex system of sponsored search where the predictions made by the algorithm decide about future training sample composition. Finally, we show experimental results from the production system and compare to a calibrated Na"\\ive Bayes algorithm.","booktitle":"Proceedings of the 27th International Conference on Machine Learning","pages":"13--20","url":"http://www.herbrich.me/papers/adpredictor.pdf","year":"2010","bibtex":"@inproceedings{ DBLP:conf/icml/GraepelCBH10,\n author = {Thore Graepel and Joaquin Qui nonero Candela and Thomas Borchert and Ralf Herbrich},\n title = {Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine}, \n abstract = {We describe a new Bayesian click-through rate (CTR) prediction algorithm used for Sponsored Search in Microsoft’s Bing search engine. The algorithm is based on a probit regression model that maps discrete or real-valued input features to probabilities. It maintains Gaussian beliefs over weights of the model and performs Gaussian online updates derived from approximate message passing. Scalability of the algorithm is ensured through a principled weight pruning procedure and an approximate parallel implementation. We discuss the challenges arising from evaluating and tuning the predictor as part of the complex system of sponsored search where the predictions made by the algorithm decide about future training sample composition. Finally, we show experimental results from the production system and compare to a calibrated Na\\"{\\i}ve Bayes algorithm.},\n booktitle = {Proceedings of the 27th International Conference on Machine Learning},\n pages = {13--20},\n url = {http://www.herbrich.me/papers/adpredictor.pdf} ,\n year = {2010}\n}\n\n\n","author_short":["Graepel, T.","nonero Candela, J. Q.","Borchert, T.","Herbrich, R."],"key":"DBLP:conf/icml/GraepelCBH10","id":"DBLP:conf/icml/GraepelCBH10","bibbaseid":"graepel-nonerocandela-borchert-herbrich-webscalebayesianclickthroughratepredictionforsponsoredsearchadvertisinginmicrosoft39sbingsearchengine-2010","role":"author","urls":{"Paper":"http://www.herbrich.me/papers/adpredictor.pdf"},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://data.bibbase.org/author/thomas-borchert/?format=bibtex","downloads":0,"keywords":[],"search_terms":["web","scale","bayesian","click","through","rate","prediction","sponsored","search","advertising","microsoft","bing","search","engine","graepel","nonero candela","borchert","herbrich"],"title":"Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine","title_words":["web","scale","bayesian","click","through","rate","prediction","sponsored","search","advertising","microsoft","bing","engine"],"year":2010,"dataSources":["7fJSRcF7oSMkdZ7HP"]}