Item-Triggered Recommendation for Identifying Potential Customers of Cold Sellers in Supermarkets

Recommendation has achieved successful results in many applications. However, for supermarkets, since the transaction data is extremely skewed in the sense that a large portion of sales is concentrated in a small number of hot seller items, collaborative filtering recommenders usually recommend hot sellers while rarely recommend cold sellers. But recommenders are supposed to provide better campaigns for cold sellers to increase sales. In this paper, we propose an alternative “item-triggered” recommendation, which aims at returning a ranked list of potential customers for a given cold-seller item. This problem can be formulated as a problem of rare class learning. We present a Boosting-SVM algorithm to solve the rare class problem and apply our algorithm to a real-world supermarket database. Experimental results show that our algorithm can improve from a baseline approach by about twenty-five percent in terms of the area under the ROC curve (AUC) metric for cold sellers that as low as 0.7% of customers have ever purchased.

[1]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[2]  Chih-Jen Lin,et al.  Probability Estimates for Multi-class Classification by Pairwise Coupling , 2003, J. Mach. Learn. Res..

[3]  Rong Yan,et al.  On predicting rare classes with SVM ensembles in scene classification , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[4]  Michael J. Pazzani,et al.  A Framework for Collaborative, Content-Based and Demographic Filtering , 1999, Artificial Intelligence Review.

[5]  Edward F. Harrington,et al.  Online Ranking/Collaborative Filtering Using the Perceptron Algorithm , 2003, ICML.

[6]  Barry Smyth,et al.  Personalized Electronic Program Guides for Digital TV , 2001, AI Mag..

[7]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[8]  Robert E. Schapire,et al.  The strength of weak learnability , 1990, Mach. Learn..

[9]  Liliana Ardissono,et al.  Personalized Recommendation of TV Programs , 2003, AI*IA.

[10]  Tong Zhang,et al.  Recommender Systems Using Linear Classifiers , 2002 .

[11]  Michael J. Pazzani,et al.  Learning Collaborative Information Filters , 1998, ICML.

[12]  J PazzaniMichael,et al.  User Modeling for Adaptive News Access , 2000 .

[13]  Jure Leskovec,et al.  Linear Programming Boosting for Uneven Datasets , 2003, ICML.

[14]  Chun-Nan Hsu,et al.  Mining Skewed and Sparse Transaction Data for Personalized Shopping Recommendation , 2004, Machine Learning.

[15]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[16]  Herna L. Viktor,et al.  Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach , 2004, SKDD.

[17]  Vladimir Kotlyar,et al.  Personalization of Supermarket Product Recommendations , 2004, Data Mining and Knowledge Discovery.

[18]  Yoram Singer,et al.  Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[19]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

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

[21]  John Shawe-Taylor,et al.  Optimizing Classifers for Imbalanced Training Sets , 1998, NIPS.