Mining Abstract Highly Correlated Pairs

Recommendation systems are essentially solving a prediction problem where, given that p items have already been selected or rated by a user, the goal is to propose k target items most likely to be appreciated by her/him. Many models have been proposed to identify these target items but the results are not always satisfactory in practice because they often only include the most popular items and ignore the “long tail” of items that are either less popular or new ones. This paper investigates the use of a type of domain abstraction to search for highly correlated pairs of abstract items that are then used to infer other target items of interest. The advantage of this approach is evaluated on the basis of real data showing better results compared to an approach only based on the concrete pairs. Basing on an empirical study we confirm that the accuracy improvement is linked to the relevance of the domain abstraction.

[1]  K. Margaritis,et al.  Analysis of Recommender Systems’ Algorithms , 2003 .

[2]  John Riedl,et al.  Analysis of recommendation algorithms for e-commerce , 2000, EC '00.

[3]  Paulo J. G. Lisboa,et al.  The value of personalised recommender systems to e-business: a case study , 2008, RecSys '08.

[4]  Patrice Perny,et al.  Preference-based Search and Machine Learning for Collaborative Filtering: the "Film-Conseil" Movie Recommender System , 2001 .

[5]  Hui Xiong,et al.  TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases , 2006, Sixth International Conference on Data Mining (ICDM'06).

[6]  Yen-Liang Chen,et al.  Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism , 2004, Decision Support Systems.

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

[8]  Amedeo Napoli,et al.  Towards Rare Itemset Mining , 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

[9]  Korris Fu-Lai Chung,et al.  Applying Cross-Level Association Rule Mining to Cold-Start Recommendations , 2007, 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops.

[10]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

[11]  Paulo J. G. Lisboa,et al.  A probabilistic model for item-based recommender systems , 2007, RecSys '07.

[12]  Joan Feigenbaum,et al.  Finding highly correlated pairs efficiently with powerful pruning , 2006, CIKM '06.

[13]  Alexander Tuzhilin,et al.  The long tail of recommender systems and how to leverage it , 2008, RecSys '08.

[14]  Paulo J. G. Lisboa,et al.  Evaluating Retail Recommender Systems via Retrospective Data: Lessons Learnt from a Live-Intervention Study , 2007, DMIN.

[15]  Jiawei Han,et al.  Mining Multiple-Level Association Rules in Large Databases , 1999, IEEE Trans. Knowl. Data Eng..

[16]  Bamshad Mobasher,et al.  Robustness of collaborative recommendation based on association rule mining , 2007, RecSys '07.

[17]  Tai-Wen Yue,et al.  A Q'tron Neural-Network Approach to Solve the Graph Coloring Problems , 2007 .

[18]  Jean-Daniel Zucker,et al.  Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings , 2005, SARA.

[19]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.