Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
暂无分享,去创建一个
[1] John Riedl,et al. GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.
[2] M. Kendall. A NEW MEASURE OF RANK CORRELATION , 1938 .
[3] Jessica H. Fong,et al. An Approximate Lp Difference Algorithm for Massive Data Streams , 1999, Discret. Math. Theor. Comput. Sci..
[4] K. Chung,et al. Elementary Probability Theory with Stochastic Processes , 1975 .
[5] Geoffrey E. Hinton,et al. Semantic hashing , 2009, Int. J. Approx. Reason..
[6] Ely Porat,et al. Sketching Techniques for Collaborative Filtering , 2009, IJCAI.
[7] Piotr Indyk,et al. A small approximately min-wise independent family of hash functions , 1999, SODA '99.
[8] Pattie Maes,et al. Social information filtering: algorithms for automating “word of mouth” , 1995, CHI '95.
[9] Mahesh Viswanathan,et al. An Approximate L1-Difference Algorithm for Massive Data Streams , 2002, SIAM J. Comput..
[10] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[11] Dimitris Achlioptas,et al. Database-friendly random projections , 2001, PODS.
[12] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[13] Darren Gergle,et al. On the "localness" of user-generated content , 2010, CSCW '10.
[14] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.