Selecting Valuable Customers for Merchants in E-Commerce Platforms

An e-commerce website provides a platform for merchants to sell products to customers. While most existing research focuses on providing customers with personalized product suggestions by recommender systems, in this paper, we consider the role of merchants and introduce a parallel problem, i.e., how to select the most valuable customers for a merchant? Accurately answering this question can not only help merchants to gain more profits, but also benefit the ecosystem of e-commence platforms. To deal with this problem, we propose a general approach by taking into consideration the interest and profit of each customer to the merchant, i.e., select the customers who are not only interested in the merchant to ensure the visit of the merchant, but also capable of making good profits. Specifically, we first generate candidate customers for a given merchant by using traditional recommendation techniques. Then we select a set of the valuable customers from candidate customers, which has the balanced maximization between the interest and the profit metrics. Given the NP-hardness of the balanced maximization formulation, we further introduce efficient techniques to solve this maximization problem by exploiting the inherent submodularity property. Finally, extensive experimental results on a real-world dataset demonstrate the effectiveness of our proposed approach.

[1]  Jure Leskovec,et al.  Inferring Networks of Substitutable and Complementary Products , 2015, KDD.

[2]  Steffen Rendle,et al.  Improving pairwise learning for item recommendation from implicit feedback , 2014, WSDM.

[3]  Le Wu,et al.  Identifying Hesitant and Interested Customers for Targeted Social Marketing , 2015, PAKDD.

[4]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[5]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[6]  Shu-Chen Kao,et al.  Targeting customers via discovery knowledge for the insurance industry , 2005, Expert Syst. Appl..

[7]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[8]  Peng Jiang,et al.  Life-stage Prediction for Product Recommendation in E-commerce , 2015, KDD.

[9]  Enhong Chen,et al.  Diversified social influence maximization , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[10]  Sang-Chan Park,et al.  Visualization method for customer targeting using customer map , 2005, Expert Syst. Appl..

[11]  Hui Xiong,et al.  Social Marketing Meets Targeted Customers: A Typical User Selection and Coverage Perspective , 2014, 2014 IEEE International Conference on Data Mining.

[12]  Feng Xu,et al.  Dual-Regularized One-Class Collaborative Filtering , 2014, CIKM.

[13]  Nicholas Jing Yuan,et al.  Relevance Meets Coverage , 2016, ACM Trans. Intell. Syst. Technol..

[14]  John Riedl,et al.  An Algorithmic Framework for Performing Collaborative Filtering , 1999, SIGIR Forum.

[15]  Hui Lin,et al.  A Class of Submodular Functions for Document Summarization , 2011, ACL.

[16]  Li Xiu,et al.  Application of data mining techniques in customer relationship management: A literature review and classification , 2009, Expert Syst. Appl..

[17]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[18]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[19]  Bamshad Mobasher,et al.  The recommender problem revisited: morning tutorial , 2014, KDD.

[20]  Nathan Srebro,et al.  Fast maximum margin matrix factorization for collaborative prediction , 2005, ICML.

[21]  Qi Zhang,et al.  Stock Constrained Recommendation in Tmall , 2015, KDD.