0


计算广告中的统计挑战

Statistical Challenges in Computational Advertising
课程网址: http://videolectures.net/kdd09_chakrabarti_agarwal_scca/  
主讲教师: Deepayan Chakrabarti, Deepak Agarwal
开课单位: 卡内基梅隆大学
开课时间: 2009-09-14
课程语种: 英语
中文简介:
现在,许多组织将其广告/推广预算的很大一部分用于在线广告;像Yahoo!,Google,MSN这样的广告网络通过构建新的经济模型并执行在给定上下文中匹配(查询,用户)对的最相关广告(从大型库存中选择)的基本任务来做出回应。几乎所有出现的挑战都是基本数据或模型驱动(或两者)。计算广告是大规模搜索和文本分析,信息检索,统计建模,机器学习,优化和微观经济学相互关联的一个相对较新的科学子学科,它解决了这一匹配问题,并为数据挖掘者提供了前所未有的机会。全面介绍几种广告形式(赞助搜索,上下文广告,展示广告),收入模式(每次点击付费,每次观看付费,每次转换付费)和涉及的数据挖掘挑战,以及对最新技术的概述。区域详细讨论了开放性问题。我们将介绍信息检索技术及其局限性;通过点击流数据执行广告匹配所涉及的数据挖掘挑战以及在展示广告中出现的挑战性优化问题。特别是,我们将介绍点击流数据的统计建模技术和探索/利用计划,以使用多臂强盗计划进行在线实验,以获得更好的长期性能。我们还讨论了推荐系统中使用的技术与我们的问题之间的密切关系,但指出了在计算广告中成为常规之前需要解决的几个其他问题。我们只假设统计方法的基本知识,没有在线广告的先验知识是需要。事实上,提供该地区介绍的第一个小时适合所有KDD 2009的注册参与者。下半部分需要熟悉基本概念,如回归,概率分布和对大规模拟合统计模型所涉问题的理解应用。没有先前对多臂匪徒的了解。
课程简介: Many organizations now devote significant fractions of their advertising/outreach budgets to online advertising; ad-networks like Yahoo!, Google, MSN have responded by constructing new kinds of economic models and perform the fundamental task of matching the most relevant ads (selected from a large inventory) for a (query,user) pair in a given context. Nearly all of the challenges that arise are substantially data- or model-driven (or both). Computational Advertising is a relatively new scientific sub-discipline at the interesection of large scale search and text analysis, information retrieval, statistical modeling, machine learning, optimization and microeconomics that address this match-making problem and provides unprecedented opportunities to data miners. Topics covered include a comprehensive introduction to several advertising forms (sponsored search, contextual adverting, display advertising), revenue models (pay-per-click, pay-per-view, pay-per-conversion) and data mining challenges involved, along with an overview of state-of-the-art techniques in the area with a detailed discussion of open problems. We will cover information retrieval techniques and their limitations; data mining challenges involved in performing ad matching through clickstream data and challenging optimization issues that arise in display advertising. In particular, we will cover statistical modeling techniques for clickstream data and explore/exploit schemes to perform online experiments for better long-term performance using multi-armed bandit schemes. We also discuss the close relationship of techniques used in recommender systems to our problem but indicate several additional issues that needs to be addressed before they become routine in computational advertising. We will only assume basic knowledge of statistical methods, no prior knowledge of online advertising is required. In fact, the first hour that provides an introduction to the area would be appropriate for all registered attendees of KDD 2009. The second half would require familiarity with basic concepts like regression, probability distributions and appreciation of issues involved in fitting statistical models to large scale applications. No prior knowledge of multi-armed bandits would be assumed.
关 键 词: 在线广告; 基本数据; 模型驱动
课程来源: 视频讲座网
最后编审: 2019-05-10:lxf
阅读次数: 80