DATASET USING A MOMENT-BASED ESTIMATOR By

We consider a particular instance of a common problem in recommender systems: using a database of book reviews to inform usertargeted recommendations. In our dataset, books are categorized into genres and sub-genres. To exploit this nested taxonomy, we use a hierarchical model that enables information pooling across across similar items at many levels within the genre hierarchy. The main challenge in deploying this model is computational: the data sizes are large, and fitting the model at scale using off-the-shelf maximum likelihood procedures is prohibitive. To get around this computational bottleneck, we extend a moment-based fitting procedure proposed for fitting single-level hierarchical models to the general case of arbitrarily deep hierarchies. This extension is an order of magnitude faster than standard maximum likelihood procedures. The fitting method can be deployed beyond recommender systems to general contexts with deeply-nested hierarchical generalized linear mixed models.

[1]  W. G. Cochran.  Problems arising in the analysis of a series of similar experiments , 1937 .

[2]  D. Firth.  Bias reduction of maximum likelihood estimates , 1993 .

[3]  Christian Posse,et al.  Bayesian Mixed-Effects Models for Recommender Systems , 1999 .

[4]  R. Kohli,et al.  Internet Recommendation Systems , 2000 .

[5]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[6]  Andrew Gelman,et al.  Sampling for Bayesian Computation with Large Datasets , 2005 .

[7]  Sean M. McNee,et al.  Improving recommendation lists through topic diversification , 2005, WWW '05.

[8]  Richi Nayak,et al.  Exploiting Item Taxonomy for Solving Cold-Start Problem in Recommendation Making , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

[9]  Deepak Agarwal.  Statistical Challenges in Internet Advertising , 2008 .

[10]  Michel Wedel,et al.  Challenges and opportunities in high-dimensional choice data analyses , 2008 .

[11]  Bin Cao,et al.  Multi-Domain Collaborative Filtering , 2010, UAI.

[12]  Deepak Agarwal,et al.  fLDA: matrix factorization through latent dirichlet allocation , 2010, WSDM '10.

[13]  Yehuda Koren,et al.  Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy , 2011, RecSys '11.

[14]  Mulugeta Gebregziabher,et al.  Fitting parametric random effects models in very large data sets with application to VHA national data , 2012, BMC Medical Research Methodology.

[15]  Alexander Felfernig,et al.  Toward the Next Generation of Recommender Systems: Applications and Research Challenges , 2013 .

[16]  Ron Kohavi,et al.  Seven rules of thumb for web site experimenters , 2014, KDD.

[17]  Jeffrey T. Hancock,et al.  Experimental evidence of massive-scale emotional contagion through social networks , 2014, Proceedings of the National Academy of Sciences.

[18]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[19]  Jure Leskovec,et al.  Inferring Networks of Substitutable and Complementary Products , 2015, KDD.

[20]  Patrick O. Perry.  Fast moment‐based estimation for hierarchical models , 2015, 1504.04941.

[21]  Deepak Agarwal,et al.  GLMix: Generalized Linear Mixed Models For Large-Scale Response Prediction , 2016, KDD.

[22]  Edward I. George,et al.  Bayes and big data: the consensus Monte Carlo algorithm , 2016, Big Data and Information Theory.

[23]  Art B. Owen,et al.  ESTIMATION AND INFERENCE FOR VERY LARGE LINEAR MIXED EFFECTS MODELS , 2016, Statistica Sinica.

[24]  A. Owen,et al.  Efficient moment calculations for variance components in large unbalanced crossed random effects models , 2016, 1602.00346.

[25]  Sayan Mukherjee,et al.  Scalable Algorithms for Learning High-Dimensional Linear Mixed Models , 2018, UAI.