The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Training and testing of recommender systems on data missing not at random
Abstract
Users typically rate only a small fraction of all available items. We show that the absence of ratings carries useful information for improving the top-k hit rate concerning all items, a natural accuracy measure for recommendations. As to test recommender systems, we present two performance measures that can be estimated, under mild assumptions, without bias from data even when ratings are missing not at random (MNAR). As to achieve optimal test results, we present appropriate surrogate objective functions for efficient training on MNAR data. Their main property is to account for all ratings - whether observed or missing in the data. Concerning the top-k hit rate on test data, our experiments indicate dramatic improvements over even sophisticated methods that are optimized on observed ratings only.
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
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
RUBIN, D. B. (1976) · Biometrika · doi:10.1093/biomet/63.3.581 · Cited by 9,925
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
A Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems
Hand, D. J., & Till, R. J. (2001) · Machine Learning · doi:10.1023/a:1010920819831 · Cited by 2,276
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
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,216
Weighted low-rank approximations
Srebro, N., & Jaakkola, T. (2003) · International Conference on Machine Learning · Cited by 715
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
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 prediction and ranking with non-random missing data
Marlin, B. M., & Zemel, R. S. (2009) · Proceedings of the third ACM conference on Recommender systems · doi:10.1145/1639714.1639717 · Cited by 315
Advances in Neural Information Processing Systems 19 (NIPS 2006)
Girolami, M., & Zhong, M. (2007) · The MIT Press eBooks · Cited by 219
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
Landauer, T. K., & Dumais, S. (2008) · Scholarpedia · doi:10.4249/scholarpedia.4356 · Cited by 94
Hinge Rank Loss and the Area Under the ROC Curve
Steck, H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74958-5_33 · Cited by 39
Self-citationScored AUC Metrics for Classifier Evaluation and Selection
Wu, S., & Flach, P. A. (2005) · Kent Academic Repository (University of Kent) · Cited by 25
Cited by
Collaborative Denoising Auto-Encoders for Top-N Recommender Systems
Wu, Y., DuBois, C., Zheng, A. X., & Ester, M. (2016) · Proceedings of the Ninth ACM International Conference on Web Search and Data Mining · doi:10.1145/2835776.2835837 · Cited by 1,001
Fast Matrix Factorization for Online Recommendation with Implicit Feedback
He, X., Zhang, H., Kan, M.-Y., & Chua, T.-S. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911489 · Cited by 988
Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization
Hu, Y., Zhang, D., Ye, J., Li, X., & He, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.271 · Cited by 829
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
“[21], [63] directly impute the missing data with a specific value r0 and optimize the model with the following objective function:”
BackgroundMethodInfluentialA 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
Self-citation
Metadata
- Authors
- Steck, H.
- Venue
- Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2010-07-25
- Pages
- 713-722
- OpenAlex
- W1992665562
- Cited by
- 365
- References
- 17
- FWCI
- 8.99
- 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.