The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
FiBiNET: combining feature importance and bilinear feature interaction for click-through rate prediction
Open accessAbstract
Advertising and feed ranking are essential to many Internet companies such as Facebook and Sina Weibo. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. There are many proposed models in this field such as logistic regression, tree based models, factorization machine based models and deep learning based CTR models. However, many current works calculate the feature interactions in a simple way such as Hadamard product and inner product and they care less about the importance of features. In this paper, a new model named FiBiNET as an abbreviation for Feature Importance and Bilinear feature Interaction NETwork is proposed to dynamically learn the feature importance and fine-grained feature interactions. On the one hand, the FiBiNET can dynamically learn the importance of features via the Squeeze-Excitation network (SENET) mechanism; on the other hand, it is able to effectively learn the feature interactions via bilinear function. We conduct extensive experiments on two real-world datasets and show that our shallow model outperforms other shallow models such as factorization machine(FM) and field-aware factorization machine(FFM). In order to improve performance further, we combine a classical deep neural network(DNN) component with the shallow model to be a deep model. The deep FiBiNET consistently outperforms the other state-of-the-art deep models such as DeepFM and extreme deep factorization machine(XdeepFM).
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Squeeze-and-Excitation Networks
Hu, J., Shen, L., & Sun, G. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00745 · Cited by 35,667
Squeeze-and-Excitation Networks
Hu, J., Shen, L., Albanie, S., Sun, G., & Wu, E. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2913372 · Cited by 12,157
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Recurrent neural network based language model
Mikolov, T., Karafiát, M., Burget, L., Černocký, J., & Khudanpur, S. (2010) · Interspeech 2010 · doi:10.21437/interspeech.2010-343 · Cited by 5,390 · cited 2×
“easily be used in Internet companies. 2.2 Deep Learning based CTR Models Deep learning has achieved great success in many research fields such as computer vision[5, 14] and natural language processing[2, 18]. As a result, many deep learning based CTR models have also been proposed in recent years[1, 4, 6, 15, 22, 23,…”
BackgroundInfluentialWide & 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
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
Deep Interest Network for Click-Through Rate Prediction
Zhou, G., Zhu, X., Song, C., Fan, Y., Zhu, H., Ma, X., Yan, Y., Jin, J., Li, H., & Gai, K. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219823 · Cited by 2,128
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
Factorization Machines with libFM
Rendle, S. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168771 · Cited by 1,337
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
Practical Lessons from Predicting Clicks on Ads at Facebook
He, X., Pan, J., Jin, O., Xu, T., Liu, B., Xu, T., Shi, Y., Atallah, A., Herbrich, R., Bowers, S., et al. (2014) · Proceedings of the Eighth International Workshop on Data Mining for Online Advertising · doi:10.1145/2648584.2648589 · Cited by 869
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
Field-aware Factorization Machines for CTR Prediction
Juan, Y., Zhuang, Y., Chin, W.-S., & Lin, C.-J. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959134 · Cited by 712
Deep Learning over Multi-field Categorical Data
Zhang, W., Du, T., & Wang, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-30671-1_4 · Cited by 445
Weakly Supervised Deep Learning for Thoracic Disease Classification and Localization on Chest X-rays
Yan, C., Yao, J., Li, R., Xu, Z., & Huang, J. (2018) · ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) · doi:10.1145/3233547.3233573 · Cited by 148
Field-aware Factorization Machines in a Real-world Online Advertising System
Juan, Y.-C., Lefortier, D., & Chapelle, O. (2017) · doi:10.1145/3041021.3054185 · Cited by 89
Cited by
(2021) · doi:10.1145/3448016.3457550 · Cited by 416
Self-citationMisztal-Radecka, J., & Indurkhya, B. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102519 · Cited by 29
Zhao, P., Xiao, K., Zhang, Y., Bian, K., & Yan, W. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/290 · Cited by 7
“The existing literature adopts Hadamard product [Lian et al., 2018], inner product [Guo et al., 2017; Qu et al., 2018], bilinear function [Huang et al., 2019] and cross product [Cheng et al., 2016] in the feature interactions.”
BackgroundInfluential
Metadata
- Authors
- Huang, T., Zhang, Z., & Zhang, J.
- Venue
- Proceedings of the 13th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2019-09-10
- Pages
- 169-177
- OpenAlex
- W2946044191
- Cited by
- 311
- References
- 17
- FWCI
- 18.65
- Type
- conference paper
- Language
- en
- Open access
- green
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.