Factorization meets the neighborhood: a multifaceted collaborative filtering model
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are analyzed in order to establish connections between users and products. The two more successful approaches to CF are latent factor models, which directly profile both users and products, and neighborhood models, which analyze similarities between products or users. In this work we introduce some innovations to both approaches. The factor and neighborhood models can now be smoothly merged, thereby building a more accurate combined model. Further accuracy improvements are achieved by extending the models to exploit both explicit and implicit feedback by the users. The methods are tested on the Netflix data. Results are better than those previously published on that dataset. In addition, we suggest a new evaluation metric, which highlights the differences among methods, based on their performance at a top-K recommendation task.
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
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 3×
“Notice that the literature suggests additional alternatives for a similarity measure [21, 22].”
BackgroundAmazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
Using collaborative filtering to weave an information tapestry
Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992) · Communications of the ACM · doi:10.1145/138859.138867 · Cited by 4,066
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
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
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 · cited 5×
“Some prior techniques, such as Conditional RBMs [18], also capitalized on the same binary view of the data.”
BackgroundMethodInfluential
Cited by
Items 101–169 of 169
Neural Rating Regression with Abstractive Tips Generation for Recommendation
Li, P., Wang, Z., Ren, Z., Bing, L., & Lam, W. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080822 · Cited by 313
“RMR Ratings meet reviews model [21] CTR Collaborative topic regression model [40] NMF Non-negative matrix factorization [18] PMF Probabilistic matrix factorization [31] LRMF List-wise learning to rank for item ranking [35] SVD++ Factorization meets the neighborhood [14] URP User rating profile modeling using LDA [22]”
BackgroundMethodInfluentialLatent Cross: Making Use of Context in Recurrent Recommender Systems
Beutel, A., Covington, P., Jain, S., Xu, C., Li, J., Gatto, V., & Chi, E. H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159727 · Cited by 313
Novelty and Diversity in Top-N Recommendation -- Analysis and Evaluation
Hurley, N., & Zhang, M. (2011) · ACM Transactions on Internet Technology · doi:10.1145/1944339.1944341 · Cited by 312
A federated graph neural network framework for privacy-preserving personalization
Wu, C., Wu, F., Lyu, L., Qi, T., Huang, Y., & Xie, X. (2022) · Nature Communications · doi:10.1038/s41467-022-30714-9 · Cited by 311
Content-Aware Point of Interest Recommendation on Location-Based Social Networks
Gao, H., Tang, J., Hu, X., & Liu, H. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9462 · Cited by 306
Exploiting homophily effect for trust prediction
Tang, J., Gao, H., Hu, X., & Liu, H. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433405 · Cited by 303
Attention, please! A survey of neural attention models in deep learning
de Santana Correia, A., & Colombini, E. L. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-022-10148-x · Cited by 298
Collaborative personalized tweet recommendation
Chen, K., Chen, T., Zheng, G., Jin, O., Yao, E., & Yu, Y. (2012) · Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2348283.2348372 · Cited by 296
A survey of active learning in collaborative filtering recommender systems
Elahi, M., Ricci, F., & Rubens, N. (2016) · Computer Science Review · doi:10.1016/j.cosrev.2016.05.002 · Cited by 292
Denoising Implicit Feedback for Recommendation
Wang, W., Feng, F., He, X., Nie, L., & Chua, T.-S. (2021) · Proceedings of the 14th ACM International Conference on Web Search and Data Mining · doi:10.1145/3437963.3441800 · Cited by 290
Yang, C., Bai, L., Zhang, C., Yuan, Q., & Han, J. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098094 · Cited by 286
Challenging the long tail recommendation
Yin, H., Cui, B., Li, J., Yao, J., & Chen, C. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2311906.2311916 · Cited by 283
TransNets: Learning to Transform for Recommendation
Catherine, R., & Cohen, W. (2017) · Proceedings of the Eleventh ACM Conference on Recommender Systems · doi:10.1145/3109859.3109878 · Cited by 280
Collaborative Memory Network for Recommendation Systems
Ebesu, T., Shen, B., & Fang, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209991 · Cited by 275
Yahoo! music recommendations: modeling music ratings with temporal dynamics and item taxonomy
Koenigstein, N., Dror, G., & Koren, Y. (2011) · Proceedings of the fifth ACM conference on Recommender systems · doi:10.1145/2043932.2043964 · Cited by 273
Self-citationWu, Q., Zhang, H., Gao, X., He, P., Weng, P., Gao, H., & Chen, G. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313442 · Cited by 271
A new similarity measure using Bhattacharyya coefficient for collaborative filtering in sparse data
Patra, B. K., Launonen, R., Ollikainen, V., & Nandi, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.03.001 · Cited by 269
A Collaborative Session-based Recommendation Approach with Parallel Memory Modules
Wang, M., Ren, P., Mei, L., Chen, Z., Ma, J., & de Rijke, M. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331210 · Cited by 269
Ricci, F. (2010) · Information Technology & Tourism · doi:10.3727/109830511x12978702284390 · Cited by 267
Link Prediction Based on Graph Neural Networks
Zhang, M., & Chen, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.09691 · Cited by 263
Perez-Vega, R., Kaartemo, V., Lages, C. R., Borghei Razavi, N., & Männistö, J. (2021) · Journal of Business Research · doi:10.1016/j.jbusres.2020.11.002 · Cited by 263
Context relevance assessment and exploitation in mobile recommender systems
Baltrunas, L., Ludwig, B., Peer, S., & Ricci, F. (2012) · Personal and Ubiquitous Computing · doi:10.1007/s00779-011-0417-x · Cited by 261
Li, X., & Chen, H. (2013) · Decision Support Systems · doi:10.1016/j.dss.2012.09.019 · Cited by 260
Social contextual recommendation
Jiang, M., Cui, P., Liu, R., Yang, Q., Wang, F., Zhu, W., & Yang, S. (2012) · Proceedings of the 21st ACM international conference on Information and knowledge management · doi:10.1145/2396761.2396771 · Cited by 260
Self-Supervised Learning for Multimedia Recommendation
Tao, Z., Liu, X., Xia, Y., Wang, X., Yang, L., Huang, X., & Chua, T.-S. (2023) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2022.3187556 · Cited by 259
fLDA: matrix factorization through latent dirichlet allocation
Agarwal, D., & Chen, B.-C. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718499 · Cited by 256
Evaluation of recommendations: rating-prediction and ranking
Steck, H. (2013) · Proceedings of the 7th ACM conference on Recommender systems · doi:10.1145/2507157.2507160 · Cited by 256
Federated Meta-Learning with Fast Convergence and Efficient Communication
Chen, F., Luo, M., Dong, Z., Li, Z., & He, X. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.07876 · Cited by 254
Context-Aware Recommender Systems
Adomavicius, G., & Tuzhilin, A. (2015) · Recommender Systems Handbook · doi:10.1007/978-1-4899-7637-6_6 · Cited by 254
MMALFM: Explainable Recommendation by Leveraging Reviews and Images
Cheng, Z., Chang, X., Zhu, L., Kanjirathinkal, R. C., & Kankanhalli, M. (2019) · ACM Transactions on Information Systems · doi:10.1145/3291060 · Cited by 235
“zedratingpredictionhasbeenraisedasanimportantresearchprobleminrecommender systems since the Netflix Prize contest [5]. As demonstrated in the contest, latent factor models (e.g., matrix factorization [37, 38]) are the most widely used and successful techniques for rating prediction. These methods characterize user’s i…”
MethodTensor Completion Algorithms in Big Data Analytics
Song, Q., Ge, H., Caverlee, J., & Hu, X. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3278607 · Cited by 229
A Graph Neural Network Framework for Social Recommendations
Fan, W., Ma, Y., Li, Q., Wang, J., Cai, G., Tang, J., & Yin, D. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3008732 · Cited by 229
Dual Channel Hypergraph Collaborative Filtering
Ji, S., Feng, Y., Ji, R., Zhao, X., Tang, W., & Gao, Y. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403253 · Cited by 224
“There are several modelbased CF algorithms, including association algorithms [15], clustering approaches [23], Bayesian networks [27], and latent factor models like singular value decomposition (SVD) [13, 17].”
MethodImproving Recommender Systems by Incorporating Social Contextual Information
Ma, H., Zhou, T. C., Lyu, M. R., & King, I. (2011) · ACM Transactions on Information Systems · doi:10.1145/1961209.1961212 · Cited by 217
“…potential commercial value and the great research challenges, recommendation techniques have drawn much attention in data mining [Bell et al. 2007; Koren 2008], information retrieval [Banerjee and Ramanathan 2008; Das et al. 2007; Herlocker et al. 2004; Huang et al. 2004; Koren et al. 2008;…”
BackgroundPersonalized Travel Package Recommendation
Liu, Q., Ge, Y., Li, Z., Chen, E., & Xiong, H. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.118 · Cited by 202
Incremental Collaborative Filtering recommender based on Regularized Matrix Factorization
Luo, X., Xia, Y., & Zhu, Q. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.09.006 · Cited by 199
“For simplicity, we choose to estimate the linear biases via the unbiased linear estimator [16,18], which enables convenient updates.”
MethodOne Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Prediction
Sheng, X.-R., Zhao, L., Zhou, G., Ding, X., Dai, B., Luo, Q., Yang, S., Lv, J., Zhang, C., Deng, H., et al. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3481941 · Cited by 197
The Connection Between Popularity Bias, Calibration, and Fairness in Recommendation
Abdollahpouri, H., Mansoury, M., Burke, R., & Mobasher, B. (2020) · Fourteenth ACM Conference on Recommender Systems · doi:10.1145/3383313.3418487 · Cited by 183
A scientometric review of emerging trends and new developments in recommendation systems
Kim, M. C., & Chen, C. (2015) · Scientometrics · doi:10.1007/s11192-015-1595-5 · Cited by 180
Multi-Rate Deep Learning for Temporal Recommendation
Song, Y., Elkahky, A. M., & He, X. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2914726 · Cited by 167
“Those include SVD++ and RegSVD [18], WRMF [10], CF-KNN [13] and AoBPR [19].”
MethodFast als-based matrix factorization for explicit and implicit feedback datasets
Pilászy, I., Zibriczky, D., & Tikk, D. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864726 · Cited by 166
“We remark that a very similar measure was proposed in [7, 8], indeed ARP can be seen as the formal definition of the rank measure proposed in these works.”
BackgroundRicardo: integrating R and Hadoop
Das, S., Sismanis, Y., Beyer, K. S., Gemulla, R., Haas, P. J., & McPherson, J. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807275 · Cited by 164
“For illustrative purposes, we use the dataset provided for the Net-flix movie-recommendation competition [16].”
BackgroundMethodImpact of data characteristics on recommender systems performance
Adomavicius, G., & Zhang, J. (2012) · ACM Transactions on Management Information Systems · doi:10.1145/2151163.2151166 · Cited by 164
“Prediction is done by taking the inner product of userpreference and item-feature vectors [Funk 2006; Koren 2008, 2009; Koren et al. 2009; Paterek 2007].”
MethodA survey of autoencoder-based recommender systems
Zhang, G., Liu, Y., & Jin, X. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-018-8052-6 · Cited by 164
“AutoSVD++ also models content information to achieve efficient and compact representations, and uses implicit user feedback to provide an accurate recommendation.”
BackgroundInfluentialA Reinforcement Learning Framework for Explainable Recommendation
Wang, X., Chen, Y., Yang, J., Wu, L., Wu, Z., & Xie, X. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00074 · Cited by 163
Generate Neural Template Explanations for Recommendation
Li, L., Zhang, Y., & Chen, L. (2020) · Proceedings of the 29th ACM International Conference on Information & Knowledge Management · doi:10.1145/3340531.3411992 · Cited by 149
Explainable Recommendation through Attentive Multi-View Learning
Gao, J., Wang, X., Wang, Y., & Xie, X. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013622 · Cited by 127
Personalized Transformer for Explainable Recommendation
Li, L., Zhang, Y., & Chen, L. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.383 · Cited by 124
U-BERT: Pre-training User Representations for Improved Recommendation
Qiu, Z., Wu, X., Gao, J., & Fan, W. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16557 · Cited by 112
Chen, C., Sun, F., Zhang, M., & Ding, B. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3511997 · Cited by 110
Personalized Mobile App Recommendation: Reconciling App Functionality and User Privacy Preference
Liu, B., Kong, D., Cen, L., Gong, N. Z., Jin, H., & Xiong, H. (2015) · Proceedings of the Eighth ACM International Conference on Web Search and Data Mining · doi:10.1145/2684822.2685322 · Cited by 98
“These work include matrix factorization [18], Probabilistic Matrix Factorization (PMF) [25] and its Bayesian version [24], and their other variants [17, 2, 16].”
MethodLearning Personalized Preference of Strong and Weak Ties for Social Recommendation
Wang, X., Hoi, S. C. H., Ester, M., Bu, J., & Chen, C. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052556 · Cited by 97
A novel Enhanced Collaborative Autoencoder with knowledge distillation for top-N recommender systems
Pan, Y., He, F., & Yu, H. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.12.025 · Cited by 97
Is distrust the negation of trust?: the value of distrust in social media
Tang, J., Hu, X., & Liu, H. (2014) · Proceedings of the 25th ACM conference on Hypertext and social media · doi:10.1145/2631775.2631793 · Cited by 91
Membership Inference Attacks Against Recommender Systems
Zhang, M., Ren, Z., Wang, Z., Ren, P., Chen, Z., Hu, P., & Zhang, Y. (2021) · Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3460120.3484770 · Cited by 76
“Inspired by the previous works [17, 24], matrix factorization is adopted to project users and items into a shared latent space.”
MethodBeyond Globally Optimal: Focused Learning for Improved Recommendations
Beutel, A., Chi, E. H., Cheng, Z., Pham, H., & Anderson, J. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052713 · Cited by 73
“…has significant implications: First, because most objectives optimize the average error across all observations, items with more observed ratings are considered more important than items with fewer observed ratings, and as a result, the allocation of model capacity is biased toward popular items.”
Background(2014) · Cited by 66
Shilling Black-Box Recommender Systems by Learning to Generate Fake User Profiles
Lin, C., Chen, S., Zeng, M., Zhang, S., Gao, M., & Li, H. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3183210 · Cited by 62
FCMF: Federated collective matrix factorization for heterogeneous collaborative filtering
Yang, E., Huang, Y., Liang, F., Pan, W., & Ming, Z. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106946 · Cited by 58
Tang, J., & Liu, H. (2015) · Synthesis Lectures on Information Security, Privacy, and Trust · doi:10.2200/s00657ed1v01y201507spt013 · Cited by 53
CausPref: Causal Preference Learning for Out-of-Distribution Recommendation
He, Y., Wang, Z., Cui, P., Zou, H., Zhang, Y., Cui, Q., & Jiang, Y. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3511969 · Cited by 50
A Generic Federated Recommendation Framework via Fake Marks and Secret Sharing
Lin, Z., Pan, W., Yang, Q., & Ming, Z. (2023) · ACM Transactions on Information Systems · doi:10.1145/3548456 · Cited by 44
“MF-MPC [42] has better recommendation performance than PMF and MF-OPC (i.e., SVD++ [27]), because it can capture more information than the other two algorithms.”
BackgroundInfluentialEvaluating the Quality of Learning Resources: A Learnersourcing Approach
Abdi, S., Khosravi, H., Sadiq, S., & Demartini, G. (2021) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2021.3058644 · Cited by 40
“In all analyses, we use an extension of MF called biased-MF proposed by Koren [63] that incorporates mean normalization and a bias parameter for each student and learning resource in ratings.”
MethodProvider fairness across continents in collaborative recommender systems
Gómez, E., Boratto, L., & Salamó, M. (2022) · Information Processing & Management · doi:10.1016/j.ipm.2021.102719 · Cited by 39
New SVD-based collaborative filtering algorithms with differential privacy
Xian, Z., Li, Q., Huang, X., & Li, L. (2017) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-162053 · Cited by 35
Hasan, M., & Roy, F. (2019) · Big Data and Cognitive Computing · doi:10.3390/bdcc3030039 · Cited by 28
Bayesian Personalized Feature Interaction Selection for Factorization Machines
Chen, Y., Ren, P., Wang, Y., & de Rijke, M. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331196 · Cited by 26
Efficient Federated Matrix Factorization Against Inference Attacks
Chai, D., Wang, L., Chen, K., & Yang, Q. (2022) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3501812 · Cited by 20
“Afterward, lots of variational models were proposed to improve the precision and robustness, such as SVD++ [22], CMN [13], etc.”
MethodBig graphs: challenges and opportunities
Fan, W. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3554821.3554899 · Cited by 19
Metadata
- Authors
- Koren, Y.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 426-434
- OpenAlex
- W1994389483
- Cited by
- 3,852
- References
- 25
- FWCI
- 53.51
- 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.