The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Field-aware Factorization Machines for CTR Prediction
Abstract
Click-through rate (CTR) prediction plays an important role in computational advertising. Models based on degree-2 polynomial mappings and factorization machines (FMs) are widely used for this task. Recently, a variant of FMs, field-aware factorization machines (FFMs), outperforms existing models in some world-wide CTR-prediction competitions. Based on our experiences in winning two of them, in this paper we establish FFMs as an effective method for classifying large sparse data including those from CTR prediction. First, we propose efficient implementations for training FFMs. Then we comprehensively analyze FFMs and compare this approach with competing models. Experiments show that FFMs are very useful for certain classification problems. Finally, we have released a package of FFMs for public use.
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
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
(2010) · Cited by 8,261
(2006) · Springer eBooks · Cited by 8,123
Pattern Recognition and Machine Learning
Neal, R. M. (2007) · Technometrics · doi:10.1198/tech.2007.s518 · Cited by 4,571
OpenMP: an industry standard API for shared-memory programming
Dagum, L., & Menon, R. (1998) · IEEE Computational Science and Engineering · doi:10.1109/99.660313 · Cited by 3,343
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
Factorization Machines with libFM
Rendle, S. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168771 · Cited by 1,337
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Niu, F., Recht, B., Re, C., & Wright, S. J. (2011) · arXiv · doi:10.48550/arxiv.1106.5730 · Cited by 1,211 · cited 1×
“In this paper, we apply Hogwild! [13], which allows each thread to run independently without any locking.”
MethodPredicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
Ad click prediction: a view from the trenches
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., et al. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2488200 · Cited by 867
Pairwise interaction tensor factorization for personalized tag recommendation
Rendle, S., & Schmidt-Thieme, L. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718498 · Cited by 675
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Chang, Y.-W., Hsieh, C., Chang, K., Ringgaard, M., & Lin, C. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859899 · Cited by 472
Self-citationAdaptive Subgradient Methods for Online Learning and Stochastic Optimization
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2021068 · Cited by 346
LIBLINEAR: A Library for Large Linear Classification
FanRong-En, ChangKai-Wei, HsiehCho-Jui, WangXiang-Rui, & LinChih-Jen (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1442794 · Cited by 328
Simple and Scalable Response Prediction for Display Advertising
Chapelle, O., Manavoglu, E., & Rosales, R. (2015) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2532128 · Cited by 318
Boosting with Early Stopping: Convergence and Consistency
Zhang, T., Yu, B., & Becomes An, L. (2003) · Cited by 294
Boosting with early stopping: Convergence and consistency
Zhang, T., & Yu, B. (2005) · The Annals of Statistics · doi:10.1214/009053605000000255 · Cited by 281
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization
McMahan, H. B. (2011) · International Conference on Artificial Intelligence and Statistics · Cited by 265
Fast methods for kernel-based text analysis
Kudo, T., & Matsumoto, Y. (2003) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/1075096.1075100 · Cited by 204
Early stopping and non-parametric regression: An optimal data-dependent stopping rule
Raskutti, G., Wainwright, M. J., & Yu, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.3574 · Cited by 167
A Learning-Rate Schedule for Stochastic Gradient Methods to Matrix Factorization
Chin, W.-S., Zhuang, Y., Juan, Y.-C., & Lin, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18038-0_35 · Cited by 63
Self-citation
Cited by
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
Guo, H., TANG, R., Ye, Y., Li, Z., & He, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/239 · Cited by 2,538
Neural Factorization Machines for Sparse Predictive Analytics
He, X., & Chua, T.-S. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080777 · Cited by 1,340
Deep & Cross Network for Ad Click Predictions
Wang, R., Fu, B., Fu, G., & Wang, M. (2017) · Proceedings of the ADKDD'17 · doi:10.1145/3124749.3124754 · Cited by 1,161
Xiao, J., Ye, H., He, X., Zhang, H., Wu, F., & Chua, T.-S. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/435 · Cited by 912
AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks
Song, W., Shi, C., Xiao, Z., Duan, Z., Xu, Y., Zhang, M., & Tang, J. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357925 · Cited by 814
Metadata
- Authors
- Juan, Y., Zhuang, Y., Chin, W.-S., & Lin, C.-J.
- Venue
- Proceedings of the 10th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2016-09-07
- Pages
- 43-50
- OpenAlex
- W2509235963
- Cited by
- 712
- References
- 21
- FWCI
- 43.59
- 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.