On the Long Tail Products Recommendation using Tripartite Graph

Abstract

The growth of the number of e-commerce users and the items being sold become both opportunities and challenges for e-commerce marketplaces. As the existence of the long-tail phenomenon, the marketplaces need to pay attention to the high number of rarely sold items. The failure to sell these products would be a threat for some B2C e-commerce companies that apply a non-consignment sale system because the products cannot be returned to the manufacturer. Thus, it is important for the marketplace to boost the promotion of long-tail products. The objective of this study is to adapt the graph-based technique to build the recommendation system for long-tail products. The set of products, customers, and categories are represented as nodes in the tripartite graph. The Absorbing Time and Hitting Time algorithms are employed together with the Markov Random Walker to traverse the nodes in the graph. We find that using Absorbing Time achieves better accuracy than the Hitting Time for recommending long-tail products.