The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Embarrassingly Shallow Autoencoders for Sparse Data
Open accessAbstract
Combining simple elements from the literature, we define a linear model that is geared toward sparse data, in particular implicit feedback data for recommender systems. We show that its training objective has a closed-form solution, and discuss the resulting conceptual insights. Surprisingly, this simple model achieves better ranking accuracy than various state-of-the-art collaborative-filtering approaches, including deep non-linear models, on most of the publicly available data-sets used in our experiments.
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
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
The MovieLens Datasets: History and Context
Harper, F. M., & Konstan, J. A. (2016) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2827872 · Cited by 3,907
Wide & Deep Learning for Recommender Systems
Cheng, H.-T., Koc, L., Harmsen, J., Shaked, T., Chandra, T., Aradhye, H., Anderson, G., Corrado, G., Chai, W., Ispir, M., et al. (2016) · Proceedings of the 1st Workshop on Deep Learning for Recommender Systems · doi:10.1145/2988450.2988454 · Cited by 3,535
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
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 1×
“A more well-known fact (e.g., see [15]) is that the absence of an edge between the random variables x i and x j in a Markov network corresponds to the conditional independence of the random variables x i and x j given the vector of all the other variables ( x k ) k ∈I\{ i , j } , which is also…”
BackgroundStatistical Analysis of Non-Lattice Data
Besag, J. (1975) · The Statistician · doi:10.2307/2987782 · Cited by 1,559
Variational Autoencoders for Collaborative Filtering
Liang, D., Krishnan, R. G., Hoffman, M. D., & Jebara, T. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186150 · Cited by 1,338
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,216
AutoRec: Autoencoders Meet Collaborative Filtering
Sedhain, S., Menon, A. K., Sanner, S., & Xie, L. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2740908.2742726 · Cited by 1,175
One-Class Collaborative Filtering
Pan, R., Zhou, Y., Cao, B., Liu, N. N., Lukose, R., Scholz, M., & Yang, Q. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.16 · Cited by 1,015
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
Bertin-Mahieux, T., Ellis, D. P. W., Whitman, B., & Lamere, P. (2011) · Columbia University · doi:10.7916/d8nz8j07 · Cited by 944
Recurrent Neural Networks with Top-k Gains for Session-based Recommendations
Hidasi, B., & Karatzoglou, A. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271761 · Cited by 925
SLIM: Sparse Linear Methods for Top-N Recommender Systems
Ning, X., & Karypis, G. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.134 · Cited by 714
Session-based Recommendations with Recurrent Neural Networks
Hidasi, B., Karatzoglou, A., Baltrunas, L., & Tikk, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06939 · Cited by 509
BIG & QUIC: Sparse Inverse Covariance Estimation for a Million Variables
Hsieh, C., Sustik, M. A., Dhillon, I. S., Ravikumar, P., & Poldrack, R. A. (2013) · neural information processing systems · Cited by 219
A Neural Autoregressive Approach to Collaborative FilteringPreprint
Zheng, Y., Tang, B., Ding, W., & Zhou, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.09477 · Cited by 183
The million song dataset challenge
McFee, B., Bertin-Mahieux, T., Ellis, D. P. W., & Lanckriet, G. R. G. (2012) · Proceedings of the 21st International Conference on World Wide Web · doi:10.1145/2187980.2188222 · Cited by 172
Efficient top-n recommendation for very large scale binary rated datasets
Aiolli, F. (2013) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2507157.2507189 · Cited by 117
Unifying nearest neighbors collaborative filtering
Verstrepen, K., & Goethals, B. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645731 · Cited by 100
Iterative Thresholding Algorithm for Sparse Inverse Covariance EstimationPreprint
Guillot, D., Rajaratnam, B., Rolfs, B. T., Maleki, A., & Wong, I. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.2532 · Cited by 74
Effective Latent Models for Binary Feedback in Recommender Systems
Volkovs, M., & Yu, G. W. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767716 · Cited by 60
Distributed Covariance Estimation in Gaussian Graphical Models
Wiesel, A., & Hero, A. O. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2172430 · Cited by 59
On the Effectiveness of Linear Models for One-Class Collaborative Filtering
Sedhain, S., Menon, A. K., Sanner, S., & Braziunas, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.9991 · Cited by 47
Collaborative Filtering via High-Dimensional RegressionPreprint
Steck, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.13033 · Cited by 34
Self-citation
Cited by
RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms
Zhao, W. X., Mu, S., Hou, Y., Lin, Z., Chen, Y., Pan, X., Li, K., Lu, Y., Wang, H., Tian, C., et al. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482016 · Cited by 455
Advances in Collaborative Filtering
Koren, Y., Rendle, S., & Bell, R. (2022) · Recommender Systems Handbook · doi:10.1007/978-1-0716-2197-4_3 · Cited by 324
Personality Bias of Music Recommendation Algorithms
Melchiorre, A. B., Zangerle, E., & Schedl, M. (2020) · Fourteenth ACM Conference on Recommender Systems · doi:10.1145/3383313.3412223 · Cited by 48
Metadata
- Authors
- Steck, H.
- Venue
- The World Wide Web Conference
- Publisher
- ACM
- Published
- 2019-05-13
- Pages
- 3251-3257
- OpenAlex
- W2912745432
- Cited by
- 271
- References
- 30
- FWCI
- 18.65
- Type
- conference paper
- Language
- en
- Open access
- gold
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.