Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems-Reference-Cited by-同舟云学术

Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems

Published:2009 Issue: Volume: Page:344-352
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Bachrach Yoram,Herbrich Ralf,Porat Ely

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03784-9_34

Reference12 articles.

1. Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS 66 (2003)

2. Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI 2009, Pasadena, California (July 2009) (to appear)

3. Chung, K.L.: Elementary Probability Theory with Stochastic Processes. Springer, Heidelberg (1974)

4. Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate L1-difference algorithm for massive data streams. SIAM J. Comput. 32(1), 131–151 (2002)

5. Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB: International Conference on Very Large Data Bases, Morgan Kaufmann Publishers, San Francisco (1999)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sketching for sequential change-point detection;EURASIP Journal on Advances in Signal Processing;2019-09-09

2. d-k-min-wise independent family of hash functions;Journal of Computer and System Sciences;2017-03

3. Weighted Similarity Estimation in Data Streams;Proceedings of the 24th ACM International on Conference on Information and Knowledge Management;2015-10-17

4. Approximately Minwise Independence with Twisted Tabulation;Algorithm Theory – SWAT 2014;2014

5. Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints;Automata, Languages, and Programming;2013