Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Min, F., Hu, Q.H., Zhu, W.: Granular association rules with four subtypes. In: IEEE GrC, pp. 432–437 (2012)
Min, F., Zhu, W.: Mining top-k granular association rules for recommendation. In: IEEE IFSA-NAFIPS, pp. 1372–1376 (2013)
Džeroski, S., Lavrac, N. (eds.): Relational data mining. Springer (2001)
Goethals, B., Page, W.L., Mampaey, M.: Mining interesting sets and rules in relational databases. In: ACM Symposium on Applied Computing, pp. 997–1001 (2010)
Linden, G., Smith, B., York, J.: Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing 7(1), 76–80 (2003)
Internet movie database, http://movielens.umn.edu
Schein, A.I., Popescul, A., Ungar, L.H., Pennock, D.M.: Methods and metrics for cold-start recommendations. In: ACM SIGIR, pp. 253–260 (2002)
Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems 22(1), 5–53 (2004)
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Record, 207–216 (1993)
Min, F., Zhu, W., He, X.: Grale: Granular association rules (2013), http://grc.fjzs.edu.cn/~fmin/grale/
Min, F., Zhu, W.: Granular association rules for multi-valued data. In: IEEE CCECE, pp. 1–5 (2013)
Yao, Y.Y., Deng, X.F.: A granular computing paradigm for concept learning. In: Emerging Paradigms in Machine Learning, vol. 13, pp. 307–326. Springer (2013)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD, pp. 1–12 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Min, F., Zhu, W. (2014). Mining Significant Granular Association Rules for Diverse Recommendation. In: Cornelis, C., Kryszkiewicz, M., Ślȩzak, D., Ruiz, E.M., Bello, R., Shang, L. (eds) Rough Sets and Current Trends in Computing. RSCTC 2014. Lecture Notes in Computer Science(), vol 8536. Springer, Cham. https://doi.org/10.1007/978-3-319-08644-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-08644-6_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08643-9
Online ISBN: 978-3-319-08644-6
eBook Packages: Computer ScienceComputer Science (R0)