2019 · 24 citations · 21 references
ComputingComputer ScienceMarketingAdvertisingMachine LearningPredictive AnalyticsDeep LearningRepresentation LearningSupervised LearningClick-through Rate PredictionCorrelationData SparsityDeep Feature ExtractionDeep Feature LearningFeature LearningLearned Feature EmbeddingsLearned Feature Representations
Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically reliable feature representations, and in consequence to improve the performance of CTR prediction. In particular, DeepMCP contains three parts: a matching subnet, a correlation subnet and a prediction subnet. These subnets model the user-ad, ad-ad and feature-CTR relationship respectively. When these subnets are jointly optimized under the supervision of the target labels, the learned feature representations have both good prediction powers and good representation abilities. Experiments on two large-scale datasets demonstrate that DeepMCP outperforms several state-of-the-art models for CTR prediction.
21
Dropout: a simple way to prevent neural networks from overfitting
Nitish Srivastava, Geoffrey E. Hinton, Alex Krizhevsky et al. · 2014 · 34.3K citations
Matrix Factorization Techniques for Recommender Systems
Yehuda Koren, Robert Bell, Chris Volinsky · Computer · 2009 · 11.7K citations
Deep Neural Networks for YouTube Recommendations
Paul Covington, Jay Adams, Emre Sargin · 2016 · 3.4K citations · Full text