中国科学院自动化研究所   设为首页   加入收藏  联系我们
 
English
网站首页     实验室概况     研究队伍     组织机构     学术交流     科研成果     人才培养     开放课题     创新文化     资源共享     联系我们
    学术讲座

2009年11月9日:模式识别系列讲座

题    目(TITLE):Learn-to-Rank-Ads in Computational Advertising
讲 座 人(SPEAKER): Dr. Jianchang (JC) Mao;Yahoo Labs
主 持 人 (CHAIR):Prof. Chenglin Liu
时    间 (TIME):10:00am, November 9th, 2009
地    点 (VENUE): The 2nd lecture room, 13th floor
报告摘要ABSTRACT):
 
The rapid growth of online advertising on the internet has created enormous opportunities as well as technical challenges that demand computational intelligence. The central problem of computational advertising is to find the best matching ads from a large ad inventory to a user in a given context (e.g., query, page view) under certain business constraints (blocking, targeting, guaranteed delivery, etc).
 
In the first part of this talk, I will provide a brief introduction to various forms of online advertising, including search advertising, contextual advertising, guaranteed and non-guaranteed display advertising. For each form of online advertising, I will describe the problem formulation and its accompanying computational challenges.
 
In the second part of this talk, I will provide a case study on Learn-to-Rank-Ads to illustrate how machine learning techniques can be employed to attack the central problem in computational advertising. Learning to rank has attracted attention of many machine learning researchers in the last decade. Until recently, most learn-to-rank algorithms were not using a loss function related to popular relevance measures, such as NDCG (Normalized Discounted Cumulative Gain) and MAP (Mean Average Precision). The main difficulty in direct optimization of these measures is that they depend on the ranks of objects, not the numerical values output by a ranking function. We propose a fully Bayesian framework that addresses this challenge by optimizing the expectation of NDCG measure over all the possible permutations of objects. A relaxation strategy is used to approximate the expectation of NDCG over the space of permutation, and a bound optimization approach is employed to make the computation efficient. Extensive experiments show that the proposed algorithm outperforms state-of-the-art Learn-to-Rank algorithms on several benchmark data sets.
报告人简介(BIOGRAPHY)
Dr. Jianchang (JC) Mao is currently a Senior Director and the head of Advertising Sciences in Yahoo Labs, responsible for the R&D of Search Advertising, Contextual Advertising, Display Advertising, Targeting, and Categorization technologies and products. He was also a Science/Engineering director responsible for development of backend technologies for several Yahoo! Social Search products, including Yahoo Answers and Yahoo MyWeb (Social Bookmarks). Prior to joining Yahoo, Dr. Mao was Director of Emerging Technologies & Principal Architect at Verity Inc., a leader in Enterprise Search (acquired by Autonomy), from 2000 to 2004. Prior to this, Dr. Mao was a research staff member at the IBM Almaden Research Center from 1994 to 2000. Dr. Mao's research interest includes Machine Learning, Data Mining, Information Retrieval, Computational Advertising, Social Networks, Pattern Recognition and Image Processing. He received an Honorable Mention Award in ACM KDD Cup 2002, IEEE Transactions on Neural Networks Outstanding Paper Award in 1996, and Honorable Mention Award from the International Pattern Recognition Society in 1993. Dr. Mao served as an associate editor of the IEEE Transactions on Neural Networks, 1999-2000. He received his Ph.D. degree in Computer Science from Michigan State University in 1994.
友情链接
 
中科院自动化研究所 模式识别国家重点实验室
NLPR, INSTITUTE OF AUTOMATION, CHNESE ACADEMY OF SCIENCES