scholarly journals Representation Learning-Assisted Click-Through Rate Prediction

2019 ◽  
Author(s):  
Wentao Ouyang ◽  
Xiuwu Zhang ◽  
Shukui Ren ◽  
Chao Qi ◽  
Zhaojie Liu ◽  
...  
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Online Advertising ◽  
Representation Learning ◽  
Good Prediction ◽  
Good Representation ◽  
Data Sparsity ◽  
Feature Representations ◽  
Rate Prediction ◽  
Click Through Rate

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.

Attentive capsule network for click-through rate and conversion rate prediction in online advertising

2021 ◽  
Vol 211 ◽  
pp. 106522
Author(s):  
Dongfang Li ◽  
Baotian Hu ◽  
Qingcai Chen ◽  
Xiao Wang ◽  
Quanchang Qi ◽  
...  
Keyword(s):  
Conversion Rate ◽  
Online Advertising ◽  
Rate Prediction ◽  
Click Through Rate

scholarly journals Deep Session Interest Network for Click-Through Rate Prediction

2019 ◽  
Author(s):  
Yufei Feng ◽  
Fuyu Lv ◽  
Weichen Shen ◽  
Menghan Wang ◽  
Fei Sun ◽  
...  
Keyword(s):  
Recommender Systems ◽  
Target Item ◽  
State Of The Art ◽  
Online Advertising ◽  
Industrial Applications ◽  
Research Topic ◽  
Intrinsic Structure ◽  
User Behaviors ◽  
Click Through Rate ◽  
Behavior Sequences

Click-Through Rate (CTR) prediction plays an important role in many industrial applications, such as online advertising and recommender systems. How to capture users' dynamic and evolving interests from their behavior sequences remains a continuous research topic in the CTR prediction. However, most existing studies overlook the intrinsic structure of the sequences: the sequences are composed of sessions, where sessions are user behaviors separated by their occurring time. We observe that user behaviors are highly homogeneous in each session, and heterogeneous cross sessions. Based on this observation, we propose a novel CTR model named Deep Session Interest Network (DSIN) that leverages users' multiple historical sessions in their behavior sequences. We first use self-attention mechanism with bias encoding to extract users' interests in each session. Then we apply Bi-LSTM to model how users' interests evolve and interact among sessions. Finally, we employ the local activation unit to adaptively learn the influences of various session interests on the target item. Experiments are conducted on both advertising and production recommender datasets and DSIN outperforms other state-of-the-art models on both datasets.

scholarly journals An Analysis and Application of Fast Nonnegative Orthogonal Matching Pursuit for Image Categorization in Deep Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Bo Wang ◽  
Jichang Guo ◽  
Yan Zhang
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Matching Pursuit ◽  
Computational Cost ◽  
Representation Learning ◽  
Orthogonal Matching Pursuit ◽  
Image Categorization ◽  
Image Patches ◽  
Deep Networks ◽  
Shape Vector

Nonnegative orthogonal matching pursuit (NOMP) has been proven to be a more stable encoder for unsupervised sparse representation learning. However, previous research has shown that NOMP is suboptimal in terms of computational cost, as the coefficients selection and refinement using nonnegative least squares (NNLS) have been divided into two separate steps. It is found that this problem severely reduces the efficiency of encoding for large-scale image patches. In this work, we study fast nonnegative OMP (FNOMP) as an efficient encoder which can be accelerated by the implementation ofQRfactorization and iterations of coefficients in deep networks for full-size image categorization task. It is analyzed and demonstrated that using relatively simple gain-shape vector quantization for training dictionary, FNOMP not only performs more efficiently than NOMP for encoding but also significantly improves the classification accuracy compared to OMP based algorithm. In addition, FNOMP based algorithm is superior to other state-of-the-art methods on several publicly available benchmarks, that is, Oxford Flowers, UIUC-Sports, and Caltech101.

scholarly journals Self-Supervised Video Representation Learning with Space-Time Cubic Puzzles

2019 ◽  
Vol 33 ◽  
pp. 8545-8552 ◽  
Author(s):  
Dahun Kim ◽  
Donghyeon Cho ◽  
In So Kweon
Keyword(s):  
Action Recognition ◽  
Large Scale ◽  
State Of The Art ◽  
Representation Learning ◽  
Space Time ◽  
Temporal Relation ◽  
Still Images ◽  
Video Frames ◽  
Spatio Temporal ◽  
The Cost

Self-supervised tasks such as colorization, inpainting and zigsaw puzzle have been utilized for visual representation learning for still images, when the number of labeled images is limited or absent at all. Recently, this worthwhile stream of study extends to video domain where the cost of human labeling is even more expensive. However, the most of existing methods are still based on 2D CNN architectures that can not directly capture spatio-temporal information for video applications. In this paper, we introduce a new self-supervised task called as Space-Time Cubic Puzzles to train 3D CNNs using large scale video dataset. This task requires a network to arrange permuted 3D spatio-temporal crops. By completing Space-Time Cubic Puzzles, the network learns both spatial appearance and temporal relation of video frames, which is our final goal. In experiments, we demonstrate that our learned 3D representation is well transferred to action recognition tasks, and outperforms state-of-the-art 2D CNN-based competitors on UCF101 and HMDB51 datasets.

scholarly journals Shared Generative Latent Representation Learning for Multi-View Clustering

2020 ◽  
Vol 34 (04) ◽  
pp. 6688-6695
Author(s):  
Ming Yin ◽  
Weitian Huang ◽  
Junbin Gao
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Poor Performance ◽  
Representation Learning ◽  
Performance Criteria ◽  
Data Share ◽  
Proposed Model ◽  
Nonlinear Features ◽  
Fundamental Research ◽  
Mixture Of Gaussian

Clustering multi-view data has been a fundamental research topic in the computer vision community. It has been shown that a better accuracy can be achieved by integrating information of all the views than just using one view individually. However, the existing methods often struggle with the issues of dealing with the large-scale datasets and the poor performance in reconstructing samples. This paper proposes a novel multi-view clustering method by learning a shared generative latent representation that obeys a mixture of Gaussian distributions. The motivation is based on the fact that the multi-view data share a common latent embedding despite the diversity among the various views. Specifically, benefitting from the success of the deep generative learning, the proposed model can not only extract the nonlinear features from the views, but render a powerful ability in capturing the correlations among all the views. The extensive experimental results on several datasets with different scales demonstrate that the proposed method outperforms the state-of-the-art methods under a range of performance criteria.

Sign in / Sign up

Export Citation Format

Share Document