A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
Bibliographic record
Abstract
We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classes, and users in a given class c have the same ranking for all items. For this situation we are interested in the following question. As a function of the number of users N in a given class c and the numbers of items IN to be ranked, how many rankings mN per user are needed in order to be able to correctly identify all user in class c This question is of interest because correctly identifying all users in a class allows to accurately predict the ranking of an item by a given user that the user has not ranked, but that was ranked by another user in the same class. This is exactly the goal recommender systems using collaborative filtering. Therefore, being able to answer the above questions allows us to characterize how much data (i.e. how many rankings per user) is required by a recommender system using collaborative filtering to accurately predict user-item ranking pairs. We study the above question using a random graph model. Even though the resulting random graph is not a Erdos-Renyi graph, this allows us to use for our analysis similar techniques that have been developed for the analysis of Erdos-Renyi graphs.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".