Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2011, Vol. 37 ›› Issue (7): 222-224,233. doi: 10.3969/j.issn.1000-3428.2011.07.075

• Networks and Communications • Previous Articles     Next Articles

Match Algorithms Survey of Computing Advertising

GUO Qing-tao, ZHENG Tao   

  1. (School of Software, Nanjing University, Nanjing 210093, China)
  • Online:2011-04-05 Published:2011-03-31

计算广告的匹配算法综述

郭庆涛,郑 滔   

  1. (南京大学软件学院,南京 210093)
  • 作者简介:郭庆涛(1985-),男,硕士研究生,主研方向:数据挖掘,模型验证,机器学习;郑 滔,教授
  • 基金资助:
    国家“863”计划基金资助项目(2007AA01Z448);国家自然科学基金资助项目(60773171)

Abstract: This paper conducts a survey of pricing models, relevance match algorithms, and effective statistical models for computing advertising, analyzes and compares these approaches, like Cosine, Okapi BM25, feature learning, hierarchy-learning and Multinomial language model, and conclusively points out the feasible improvement and future of research in this field.

Key words: sponsored search, content match, information retrieval, machine learning, online learning

摘要: 对计算广告研究中的计价模型和匹配算法及模型进行综述,分别从检索词匹配精度、语义情景和用户点击反馈等方面对Cosine算法、Okapi BM25算法、特征学习算法、分层学习模型和Multinomial统计语言模型等进行比较分析和优缺点总结,并提出可行的改进 方向。

关键词: 赞助搜索, 内容匹配, 信息检索, 机器学习, 在线学习

CLC Number: