ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1706.00061
  4. Cited By
The Sample Complexity of Online One-Class Collaborative Filtering

The Sample Complexity of Online One-Class Collaborative Filtering

31 May 2017
Reinhard Heckel
Kannan Ramchandran
ArXiv (abs)PDFHTML

Papers citing "The Sample Complexity of Online One-Class Collaborative Filtering"

5 / 5 papers shown
Title
Cascading Bandits: Learning to Rank in the Cascade Model
Cascading Bandits: Learning to Rank in the Cascade Model
Branislav Kveton
Csaba Szepesvári
Zheng Wen
Azin Ashkan
187
284
0
10 Feb 2015
A Latent Source Model for Online Collaborative Filtering
A Latent Source Model for Online Collaborative Filtering
Guy Bresler
George H. Chen
Devavrat Shah
FedML
232
59
0
31 Oct 2014
Concentration inequalities for sampling without replacement
Concentration inequalities for sampling without replacement
Rémi Bardenet
Odalric-Ambrym Maillard
71
167
0
16 Sep 2013
Linear Bandits in High Dimension and Recommendation Systems
Linear Bandits in High Dimension and Recommendation Systems
Y. Deshpande
Andrea Montanari
OffRL
129
71
0
08 Jan 2013
A Stochastic Model for Collaborative Recommendation
A Stochastic Model for Collaborative Recommendation
Gérard Biau
B. Cadre
L. Rouviere
110
29
0
13 Oct 2009
1