.png){kind=icon}
返回
A Clickthrough Rate Prediction Algorithm Based on Users' Behaviors
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2957054.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Besides the ID class features, the advertisement click log file contains many significant features, which make the study of the advertisement clickthrough rate prediction more difficult. In this study, we convert original features into numerical meaningful ones, which reduce the sparsity and redundancy. In order to solve the problem of class imbalance, we propose a downsampling algorithm based on K-means model to classify large samples, then divide them into some sensible and rational features by the heuristic methods. To further improve the feature representation, we finally select and combine features by the Gradient Boosting Decision Tree model and process high-dimensional features by the logistic regression method. We conducted experiments on the dataset of Tencent SOSO and demonstrated that our approach outperforms the state-of-the-art baseline methods by 0.05% on average in terms of R2 and by 50.5% on average in terms of RMSE.
Keyword:
Clickthrough rate
class imbalance
gradient boosting decision tree
downsampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏A boosted decision tree approach using Bayesian hyper-parameter optimization for credit scoring
PREAI
分享收藏
分享收藏
查看更多内容