Name
Abstract | ||
|---|---|---|
Click-through rate (CTR) prediction is an important topic in mobile recommendation systems and computational advertising. As previous research indicates, a key point to maximize CTR is feature conjunction for making the training data more informative. Despite great progress, existing methods still fail to choose suitable settings of feature conjunction for the given data. In particular, a linear model on the pair-wise feature conjunction may overfit the training set if the data set is highly sparse. For such data, a model based on low-rank latent matrices are shown to be more appropriate. Unfortunately, practitioners now face difficulties to decide when to use which. In this paper, we propose an adaptive framework to address the feature conjunction problem. Our proposed framework adaptively chooses effective models to do feature conjunction according to data properties. We offer a case for building feature conjunction based on feature-pair frequency. Efficient training, as well as parameter selection, are thoroughly investigated. We conduct comprehensive online and offline experiments to demonstrate the effectiveness of the adaptive model over existing models for CTR prediction. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/MDM48529.2020.00043 | 2020 21st IEEE International Conference on Mobile Data Management (MDM) |
Keywords | DocType | ISSN |
Recommendation System,Machine learning,CTR,Feature Conjunction,Adaptive Model | Conference | 1551-6245 |
ISBN | Citations | PageRank |
978-1-7281-4664-5 | 0 | 0.34 |
References | Authors | |
14 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chih-Yao Chang | 1 | 8 | 1.20 |
| Xing Tang | 2 | 0 | 0.34 |
| Bowen Yuan | 3 | 8 | 1.54 |
| Jui-Yang Hsia | 4 | 0 | 0.34 |
| Zhirong Liu | 5 | 11 | 3.27 |
| Zhenhua Dong | 6 | 91 | 9.03 |
| Xiuqiang He | 7 | 312 | 39.21 |
| Jen-Chih Lin | 8 | 24 | 8.22 |