47 search results - page 10 / 10 » Learning for Dynamic Assignments Reordering |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
SIGIR
2009
ACM
13 years 11 months ago
2009
ACM
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...