Sketching techniques for collaborative filtering

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 2016-2021

  Bachrach, Yoram ^a   Porat, Ely ^b   Rosenschein, Jeffrey S ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

COLLABORATIVE FILTERING SYSTEMS; HIGH PROBABILITY; MULTIPLE USER; SPACE AND TIME; STRONG CORRELATION;

COLLABORATIVE FILTERING;

EID: 77957061059     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Dimitris Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS: Journal of Computer and System Sciences, 66, 2003.
2. Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, 51(1):117-122, 2008.
3. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations. JCSS: Journal of Computer and System Sciences, 60(3):630-659, 2000.
4. Graham Cormode, Mayur Datar, Piotr Indyk, and S. Muthukrishnan. Comparing data streams using Hamming norms (how to zero in). IEEE Trans. Knowl. Data Eng, 15(3):529-540, 2003.
5. Mayur Datar and S. Muthukrishnan. Estimating rarity and similarity over data stream windows. In Rolf H. Móhring and Rajeev Raman, editors, Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, volume 2461 of Lecture Notes in Computer Science, pages 323-334. Springer, 2002.
6. Joan Feigenbaum, Sampath Kannan, Martin Strauss, and Mahesh Viswanathan. An approximate L1-difference algorithm for massive data streams. SIAM J. Comput, 32(1):131-151, 2002.
7. Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Similarity search in high dimensions via hashing. In VLDB: International Conference on Very Large Data Bases. Morgan Kaufmann Publishers, 1999.
8. David Goldberg, David Nichols, Brian M. Oki, and Douglas Terry. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 35(12), 1992.
9. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
10. Piotr Indyk. A small approximately min-wise independent family of hash functions. Journal of Algorithms, 38(1):84-90, January 2001.
11. Ketan Mulmuley. Randomized geometric algorithms and pseudorandom generators. Algorithmica, 16(4/5):450-463, 1996.
12. Paul Resnick, Neophytos Iacovou, Mitesh Suchak, Peter Bergstorm, and John Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, pages 175-186, Chapel Hill, North Carolina, 1994. ACM.
13. Ruslan Salakhutdinov and Geoffrey Hinton. Semantic hashing. International Journal of Approximate Reasoning, December 2008.
14. Upendra Shardan and Pattie Maes. Social information filtering: Algorithms for automating "word of mouth". In Proceedings of ACM CHI'95 Conference on Human Factors in Computing Systems, volume 1 of Papers: Using the Information of Others, pages 210-217, 1995.
15. Yair Weiss, Antonio Torralba, and Rob Fergus. Spectral hashing. In Advances in Neural Processing Systems, 2008.