中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
relational click prediction for sponsored search
Author: Xiong Chenyan ; Wang Taifeng ; Ding Wenkui ; Shen Yidong ; Liu Tie-Yan
Source: WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining
Conference Name: 5th ACM International Conference on Web Search and Data Mining, WSDM 2012
Conference Date: February 8, 2012 - February 12, 2012
Issued Date: 2012
Conference Place: Seattle, WA, United states
Keyword: Data mining ; Information retrieval ; Maximum likelihood estimation ; Search engines ; Websites
Indexed Type: EI
ISBN: 9781450307475
Department: (1) Graduate University Chinese Academy of Sciences Beijing China; (2) Microsoft Research Asia Beijing China; (3) Tsinghua University Beijing China; (4) Institute of Software Chinese Academy of Sciences Beijing China
Sponsorship: Special Interest Group on Information Retrieval (ACM SIGIR); ACM Spec. Interest Group Knowl. Discov. Data Min. (SIGKDD); ACM SIGMOD; ACM SIGWEB
Abstract: This paper is concerned with the prediction of clicking an ad in sponsored search. The accurate prediction of user's click on an ad plays an important role in sponsored search, because it is widely used in both ranking and pricing of the ads. Previous work on click prediction usually takes a single ad as input, and ignores its relationship to the other ads shown in the same page. This independence assumption here, however, might not be valid in the real scenario. In this paper, we first perform an analysis on this issue by looking at the click-through rates (CTR) of the same ad, in the same position and for the same query, but surrounded by different ads. We found that in most cases the CTR varies largely, which suggests that the relationship between ads is really an important factor in predicting click probability. Furthermore, our investigation shows that the more similar the surrounding ads are to an ad, the lower the CTR of the ad is. Based on this observation, we design a continuous conditional random fields (CRF) based model for click prediction, which considers both the features of an ad and its similarity to the surrounding ads. We show that the model can be effectively learned using maximum likelihood estimation, and can also be efficiently inferred due to its closed form solution. Our experimental results on the click-through log from a commercial search engine show that the proposed model can predict clicks more accurately than previous independent models. To our best knowledge this is the first work that predicts ad clicks by considering the relationship between ads. Copyright 2012 ACM.
English Abstract: This paper is concerned with the prediction of clicking an ad in sponsored search. The accurate prediction of user's click on an ad plays an important role in sponsored search, because it is widely used in both ranking and pricing of the ads. Previous work on click prediction usually takes a single ad as input, and ignores its relationship to the other ads shown in the same page. This independence assumption here, however, might not be valid in the real scenario. In this paper, we first perform an analysis on this issue by looking at the click-through rates (CTR) of the same ad, in the same position and for the same query, but surrounded by different ads. We found that in most cases the CTR varies largely, which suggests that the relationship between ads is really an important factor in predicting click probability. Furthermore, our investigation shows that the more similar the surrounding ads are to an ad, the lower the CTR of the ad is. Based on this observation, we design a continuous conditional random fields (CRF) based model for click prediction, which considers both the features of an ad and its similarity to the surrounding ads. We show that the model can be effectively learned using maximum likelihood estimation, and can also be efficiently inferred due to its closed form solution. Our experimental results on the click-through log from a commercial search engine show that the proposed model can predict clicks more accurately than previous independent models. To our best knowledge this is the first work that predicts ad clicks by considering the relationship between ads. Copyright 2012 ACM.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15707
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Xiong Chenyan,Wang Taifeng,Ding Wenkui,et al. relational click prediction for sponsored search[C]. 见:5th ACM International Conference on Web Search and Data Mining, WSDM 2012. Seattle, WA, United states. February 8, 2012 - February 12, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xiong Chenyan]'s Articles
[Wang Taifeng]'s Articles
[Ding Wenkui]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xiong Chenyan]‘s Articles
[Wang Taifeng]‘s Articles
[Ding Wenkui]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace