Collaborative Clustering: Sample Complexity and Efficient Algorithms


We study the problem of collaborative clustering. This problem is concerned with a set of items grouped into clusters that we wish to recover from ratings provided by users. The latter are also clustered, and each user rates a random but typical small number of items. The observed ratings are random variables whose distributions depend on the item and user… (More)

1 Figure or Table


  • Presentations referencing similar topics