Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints

DOI10.1007/978-3-642-39212-2_41MaRDI QIDQ5327455zbMATH OpenOpenAlexFDO

Authors Yoram Bachrach, Ely Porat

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39212-2_41

Mathematics Subject Classification ID

Internet topics (68M11) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
• An accurate and scalable collaborative recommender
• Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data

Cited in

(5)

• Fingerprinting ratings for collaborative filtering -- theoretical and empirical analysis
• Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
• d-k-min-wise independent family of hash functions
• Fingerprints for highly similar streams
• scientific article; zbMATH DE number 7278047 (Why is no real title available?)

This page was built for publication: Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327455)