The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Collaborative prediction and ranking with non-random missing data
Abstract
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative filtering and recommender systems is founded on the assumption that missing ratings are missing at random. The statistical theory of missing data shows that incorrect assumptions about missing data can lead to biased parameter estimation and prediction. In a recent study, we demonstrated strong evidence for violations of the missing at random condition in a real recommender system. In this paper we present the first study of the effect of non-random missing data on collaborative ranking, and extend our previous results regarding the impact of non-random missing data on collaborative prediction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 1×
“We use an adjusted cosine similarity metric as shown below [12], combined with the standard nearest neighbour regression prediction rule.”
MethodEmpirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
An Algorithmic Framework for Performing Collaborative Filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130372 · Cited by 2,512
Statistical Analysis with Missing Data.
Chatfield, C., Little, R. J. A., & Rubin, D. B. (1988) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982783 · Cited by 2,202
An algorithmic framework for performing collaborative filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312682 · Cited by 2,011
Improving recommendation lists through topic diversification
Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060754 · Cited by 1,892
Restricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Explaining collaborative filtering recommendations
Herlocker, J. L., Konstan, J. A., & Riedl, J. (2000) · Proceedings of the 2000 ACM conference on Computer supported cooperative work · doi:10.1145/358916.358995 · Cited by 1,731
Proceedings of the 20th conference on Uncertainty in artificial intelligence
Meek, C., Chickering, M., & Halpern, J. Y. (2004) · Cited by 1,574
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
Avoiding monotony: improving the diversity of recommendation lists
Zhang, M., & Hurley, N. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454030 · Cited by 456
COFI RANK - Maximum margin matrix factorization for collaborative ranking
Weimer, M., Karatzoglou, A., Le, Q. V., & Smola, A. J. (2007) · HAL · Cited by 356
Collaborative Filtering and the Missing at Random Assumption
Marlin, B. M., Zemel, R. S., Roweis, S. T., & Slaney, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5267 · Cited by 178
Self-citationMatrix factorization and neighbor based algorithms for the netflix prize problem
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454049 · Cited by 160
Missing data problems in machine learning
Marlin, B. M. (2008) · TSpace (University of Toronto) · Cited by 142
Self-citationCollaborative prediction using ensembles of Maximum Margin Matrix Factorizations
DeCoste, D. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143876 · Cited by 99
Cited by
Collaborative Filtering Recommender Systems
Ekstrand, M. D. (2011) · Foundations and Trends® in Human–Computer Interaction · doi:10.1561/1100000009 · Cited by 1,037
Recommender systems: from algorithms to user experience
Konstan, J. A., & Riedl, J. (2012) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-011-9112-x · Cited by 762
Bias and Debias in Recommender System: A Survey and Future Directions
Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023) · ACM Transactions on Information Systems · doi:10.1145/3564284 · Cited by 741
A survey of collaborative filtering based social recommender systems
Yang, X., Guo, Y., Liu, Y., & Steck, H. (2014) · Computer Communications · doi:10.1016/j.comcom.2013.06.009 · Cited by 475
Making sense of recommendations
Yeomans, M., Shah, A., Mullainathan, S., & Kleinberg, J. (2019) · Journal of Behavioral Decision Making · doi:10.1002/bdm.2118 · Cited by 459
Metadata
- Authors
- Marlin, B. M., & Zemel, R. S.
- Venue
- Proceedings of the third ACM conference on Recommender systems
- Publisher
- ACM
- Published
- 2009-10-23
- Pages
- 5-12
- OpenAlex
- W2020631728
- Cited by
- 315
- References
- 22
- FWCI
- 7.97
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.