Sketching algorithms for approximating rank correlations in collaborative filtering systems

Yoram Bachrach, Ralf Herbrich, Ely Porat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets in CF systems, but only allows testing whether users have a high proportion of items they have both ranked. We show how to determine the correlation between the rankings of two users, using concise "sketches" of the rankings. The sketches allow approximating Kendall's Tau, a known rank correlation, with high accuracy ε and high confidence 1 - δ. The required sketch size is logarithmic in the confidence and polynomial in the accuracy.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 16th International Symposium, SPIRE 2009, Proceedings
Pages344-352
Number of pages9
DOIs
StatePublished - 2009
Event16th International Symposium on String Processing and Information Retrieval, SPIRE 2009 - Saariselka, Finland
Duration: 25 Aug 200927 Aug 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5721 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Symposium on String Processing and Information Retrieval, SPIRE 2009
Country/TerritoryFinland
CitySaariselka
Period25/08/0927/08/09

Fingerprint

Dive into the research topics of 'Sketching algorithms for approximating rank correlations in collaborative filtering systems'. Together they form a unique fingerprint.

Cite this