Representation Learning-Assisted Click-Through Rate Prediction

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 informati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ouyang, Wentao, Zhang, Xiuwu, Ren, Shukui, Qi, Chao, Liu, Zhaojie, Du, Yanlong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Ouyang, Wentao
Zhang, Xiuwu
Ren, Shukui
Qi, Chao
Liu, Zhaojie
Du, Yanlong
description 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.
doi_str_mv 10.48550/arxiv.1906.04365
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1906_04365</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1906_04365</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-f4413b84512ddd7648101ffe5f3dba87ccd3c7fb8fc0043376f2884955ec18df3</originalsourceid><addsrcrecordid>eNotz8tqAjEYBeBsuijaB-jKeYFME3N1I8jQizCgyOyHTPL_GrSjJNNS3956WZ3N4XA-Ql45K6VVir259Bd_Sz5jumRSaPVM5hs4JcjQD26Ix76owaU-9lu6yDnmAUJRHaLf02aXjj_bXbFxAxTrBCH6a39MntAdMrw8ckSaj_em-qL16nNZLWrqtFEUpeSis1LxaQjBaGk544igUITOWeN9EN5gZ9Gz_1_CaJxaK2dKgec2oBiRyX32BmhPKX67dG6vkPYGERe4CUOO</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Representation Learning-Assisted Click-Through Rate Prediction</title><source>arXiv.org</source><creator>Ouyang, Wentao ; Zhang, Xiuwu ; Ren, Shukui ; Qi, Chao ; Liu, Zhaojie ; Du, Yanlong</creator><creatorcontrib>Ouyang, Wentao ; Zhang, Xiuwu ; Ren, Shukui ; Qi, Chao ; Liu, Zhaojie ; Du, Yanlong</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.1906.04365</identifier><language>eng</language><subject>Computer Science - Information Retrieval ; Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2019-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1906.04365$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1906.04365$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ouyang, Wentao</creatorcontrib><creatorcontrib>Zhang, Xiuwu</creatorcontrib><creatorcontrib>Ren, Shukui</creatorcontrib><creatorcontrib>Qi, Chao</creatorcontrib><creatorcontrib>Liu, Zhaojie</creatorcontrib><creatorcontrib>Du, Yanlong</creatorcontrib><title>Representation Learning-Assisted Click-Through Rate Prediction</title><description>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.</description><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz8tqAjEYBeBsuijaB-jKeYFME3N1I8jQizCgyOyHTPL_GrSjJNNS3956WZ3N4XA-Ql45K6VVir259Bd_Sz5jumRSaPVM5hs4JcjQD26Ix76owaU-9lu6yDnmAUJRHaLf02aXjj_bXbFxAxTrBCH6a39MntAdMrw8ckSaj_em-qL16nNZLWrqtFEUpeSis1LxaQjBaGk544igUITOWeN9EN5gZ9Gz_1_CaJxaK2dKgec2oBiRyX32BmhPKX67dG6vkPYGERe4CUOO</recordid><startdate>20190610</startdate><enddate>20190610</enddate><creator>Ouyang, Wentao</creator><creator>Zhang, Xiuwu</creator><creator>Ren, Shukui</creator><creator>Qi, Chao</creator><creator>Liu, Zhaojie</creator><creator>Du, Yanlong</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20190610</creationdate><title>Representation Learning-Assisted Click-Through Rate Prediction</title><author>Ouyang, Wentao ; Zhang, Xiuwu ; Ren, Shukui ; Qi, Chao ; Liu, Zhaojie ; Du, Yanlong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-f4413b84512ddd7648101ffe5f3dba87ccd3c7fb8fc0043376f2884955ec18df3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Ouyang, Wentao</creatorcontrib><creatorcontrib>Zhang, Xiuwu</creatorcontrib><creatorcontrib>Ren, Shukui</creatorcontrib><creatorcontrib>Qi, Chao</creatorcontrib><creatorcontrib>Liu, Zhaojie</creatorcontrib><creatorcontrib>Du, Yanlong</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ouyang, Wentao</au><au>Zhang, Xiuwu</au><au>Ren, Shukui</au><au>Qi, Chao</au><au>Liu, Zhaojie</au><au>Du, Yanlong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Representation Learning-Assisted Click-Through Rate Prediction</atitle><date>2019-06-10</date><risdate>2019</risdate><abstract>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.</abstract><doi>10.48550/arxiv.1906.04365</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1906.04365
ispartof
issn
language eng
recordid cdi_arxiv_primary_1906_04365
source arXiv.org
subjects Computer Science - Information Retrieval
Computer Science - Learning
Statistics - Machine Learning
title Representation Learning-Assisted Click-Through Rate Prediction
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T21%3A00%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Representation%20Learning-Assisted%20Click-Through%20Rate%20Prediction&rft.au=Ouyang,%20Wentao&rft.date=2019-06-10&rft_id=info:doi/10.48550/arxiv.1906.04365&rft_dat=%3Carxiv_GOX%3E1906_04365%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true