Estimating rates of rare events through a multidimensional dynamic hierarchical Bayesian framework
暂无分享,去创建一个
[1] Sachin Garg,et al. Response prediction using collaborative filtering with hierarchies and side-information , 2011, KDD.
[2] David B. Dunson,et al. Dependent Hierarchical Beta Process for Image Interpolation and Denoising , 2011, AISTATS.
[3] Reynold Xin,et al. GraphX: Unifying Data-Parallel and Graph-Parallel Analytics , 2014, ArXiv.
[4] John C. Duchi,et al. Distributed delayed stochastic optimization , 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[5] Reynold Xin,et al. GraphX: a resilient distributed graph system on Spark , 2013, GRADES.
[6] Wen Zhang,et al. How much can behavioral targeting help online advertising? , 2009, WWW '09.
[7] Xiangyu Wang,et al. Parallelizing MCMC via Weierstrass Sampler , 2013, 1312.4605.
[8] Edward I. George,et al. Bayes and big data: the consensus Monte Carlo algorithm , 2016, Big Data and Information Theory.
[9] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[10] Rich Caruana,et al. Predicting good probabilities with supervised learning , 2005, ICML.
[11] Vasudeva Varma,et al. Learning the click-through rate for rare/new ads from similar ads , 2010, SIGIR.
[12] Ilya Trofimov,et al. Using boosted trees for click-through rate prediction for sponsored search , 2012, ADKDD '12.
[13] Kevin P. Murphy,et al. Machine learning - a probabilistic perspective , 2012, Adaptive computation and machine learning series.
[14] Rich Caruana,et al. Obtaining Calibrated Probabilities from Boosting , 2005, UAI.
[15] Erick Cantú-Paz,et al. Personalized click prediction in sponsored search , 2010, WSDM '10.
[16] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[17] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[18] Foster J. Provost,et al. Scalable hands-free transfer learning for online advertising , 2014, KDD.
[19] Michael J. Franklin,et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.
[20] Matthew Richardson,et al. Predicting clicks: estimating the click-through rate for new ads , 2007, WWW '07.
[21] Joaquin Quiñonero Candela,et al. Practical Lessons from Predicting Clicks on Ads at Facebook , 2014, ADKDD'14.
[22] Wentong Li,et al. Estimating conversion rate in display advertising from past erformance data , 2012, KDD.
[23] David Lo,et al. Predicting response in mobile advertising with hierarchical importance-aware factorization machine , 2014, WSDM.
[24] Emily B. Fox,et al. A Bayesian Approach for Predicting the Popularity of Tweets , 2013, ArXiv.
[25] Martin Wattenberg,et al. Ad click prediction: a view from the trenches , 2013, KDD.
[26] Nikhil R. Devanur,et al. Real-time bidding algorithms for performance-based display ad allocation , 2011, KDD.
[27] Foster J. Provost,et al. Machine learning for targeted display advertising: transfer learning in action , 2013, Machine Learning.
[28] Joaquin Quiñonero Candela,et al. Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine , 2010, ICML.
[29] Yee Whye Teh,et al. Bayesian Learning via Stochastic Gradient Langevin Dynamics , 2011, ICML.
[30] Yukihiro Tagami,et al. CTR prediction for contextual advertising: learning-to-rank approach , 2013, ADKDD '13.
[31] Yang Zhou,et al. Multimedia features for click prediction of new ads in display advertising , 2012, KDD.
[32] Chong Wang,et al. Asymptotically Exact, Embarrassingly Parallel MCMC , 2013, UAI.
[33] Eric Brill,et al. Improving web search ranking by incorporating user behavior information , 2006, SIGIR.
[34] P. Damlen,et al. Gibbs sampling for Bayesian non‐conjugate and hierarchical models by using auxiliary variables , 1999 .