Mining Significant Granular Association Rules for Diverse Recommendation

Granular association rule is a new technique to build recommender systems. The quality of a rule is often evaluated by the confidence measure, namely the probability that users purchase or rate certain items. Unfortunately, the confidence-based approach tends to suggest popular items to users, and novel patterns are often ignored. In this paper, we propose to mine significant granular association rules for diverse and novel recommendation. Generally, a rule is significant if the recommended items favor respective users more than others; while a recommender is diverse if it recommends different items to different users. We define two sets of measures to evaluate the quality of a rule as well as a recommender. Then we propose a significance-based approach seeking top-k significant rules for each user. Results on the MovieLens dataset show that the new approach provides more significant and diverse recommendations than the confidence-based one.

[1]  Bart Goethals,et al.  Mining interesting sets and rules in relational databases , 2010, SAC '10.

[2]  William Zhu,et al.  Mining top-k granular association rules for recommendation , 2013, 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS).

[3]  William Zhu,et al.  Granular association rules for multi-valued data , 2013, 2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE).

[4]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

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

[6]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[7]  Yiyu Yao,et al.  A Granular Computing Paradigm for Concept Learning , 2013 .

[8]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

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

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

[11]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[12]  Qinghua Hu,et al.  Granular association rules with four subtypes , 2012, 2012 IEEE International Conference on Granular Computing.