Using Unified Probabilistic Matrix Factorization for Contextual Advertisement Recommendation
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Combining user interests with visited web page contents to perform contextual advertising enhances the user experience and adds more ad clicks, increasing revenue. The key issue is to improve the prediction accuracy of click rates for advertisements. The crucial challenges of the advertisement recommendation algorithm are the scalability on large number of users and web page contents, and the low prediction accuracy resulting from data sparsity. When data is large and sparse, the accuracy and efficiency of the traditional recommendation algorithms is poor. This paper proposes a factor model called AdRec. Based on the Unified Probability Matrix Factorization (UPMF), the model addresses the data sparsity problem by combining features of users, advertisements and web page contents to predict the click rate with higher accuracy. In addition, the computational complexity of our algorithm is linear with respect to the number of observed data, and scalable to very large datasets.

    Reference
    Related
    Cited by
Get Citation

涂丹丹,舒承椿,余海燕.基于联合概率矩阵分解的上下文广告推荐算法.软件学报,2013,24(3):454-464

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 01,2011
  • Revised:April 01,2012
  • Adopted:
  • Online: March 01,2013
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063