Inferring Networks of Substitutable and Complementary Products

被引:368
作者
McAuley, Julian [1 ]
Pandey, Rahul [2 ]
Leskovec, Jure [2 ,3 ]
机构
[1] Univ Calif San Diego, San Diego, CA 92093 USA
[2] Pinterest, San Francisco, CA USA
[3] Stanford Univ, Stanford, CA 94305 USA
来源
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING | 2015年
关键词
D O I
10.1145/2783258.2783381
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In a modern recommender system, it is important to understand how products relate to each other. For example, while a user is looking for mobile phones, it might make sense to recommend other phones, but once they buy a phone, we might instead want to recommend batteries, cases, or chargers. These two types of recommendations are referred to as substitutes and complements: substitutes are products that can be purchased instead of each other, while complements are products that can be purchased in addition to each other. Here we develop a method to infer networks of substitutable and complementary products. We formulate this as a supervised link prediction task, where we learn the semantics of substitutes and complements from data associated with products. The primary source of data we use is the text of product reviews, though our method also makes use of features such as ratings, specifications, prices, and brands. Methodologically, we build topic models that are trained to automatically discover topics from text that are successful at predicting and explaining such relationships. Experimentally, we evaluate our system on the Amazon product catalog, a large dataset consisting of 9 million products, 237 million links, and 144 million reviews.
引用
收藏
页码:785 / 794
页数:10
相关论文
共 36 条
  • [1] [Anonymous], 2009, ICML
  • [2] [Anonymous], NIPS
  • [3] [Anonymous], 2009, COMPUTER
  • [4] [Anonymous], 2013, RECSYS
  • [5] [Anonymous], 2011, KDD
  • [6] [Anonymous], 2008, Introduction to information retrieval
  • [7] [Anonymous], 2003, JMLR
  • [8] [Anonymous], 2003, IEEE INTERNET COMPUT
  • [9] [Anonymous], 2007, KDD CUP WORKSH
  • [10] [Anonymous], SDM