Separating-Plane Factorization Models: Scalable Recommendation from One-class Implicit Feedback

• Author / Creator

  Chen, Haolan

• We study the large-scale video recommendation problem based on user viewing logs instead of explicit ratings. As viewing records are implicitly positive samples, existing matrix factorization methods fail to generate discriminative recommendations based on such one-class data. We propose a scalable approach called separating-plane matrix factorization (SPMF) to make effective recommendations based on one-class implicit feedback, with a learning complexity only comparable to matrix factorization. With extensive offline evaluation in Tencent Data Warehouse (TDW) based on big data, we show that our approach outperforms a wide range of state-of-the-art methods. We also deployed our system online to test with real users in Tencent QQ Browser mobile app. Results show that our approach can increase the video click through rate by 23% over implicit-feedback collaborative filtering (IFCF), a scheme implemented in Spark’s MLlib.

• Subjects / Keywords

  • Factorization machine
  • One-class problem
  • Implicit feedback
  • Matrix factorization
  • Big data
  • Tencent
  • Separating-plane
  • Recommender systems
  • Spark

• Graduation date

  Fall 2016

• Type of Item

  Thesis

• Degree

  Master of Science

• DOI

  https://doi.org/10.7939/R32Z12X89

• License

  This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.