Mining Evolving Association Rules for E-Business Recommendation

doi:10.1007/s12204-012-1246-4

上海交通大学学报（英文版） ›› 2012, Vol. 17 ›› Issue (2): 161-165.doi: 10.1007/s12204-012-1246-4

Mining Evolving Association Rules for E-Business Recommendation

LONG Shun (龙舜), ZHU Wei-heng^∗(朱蔚恒)

(Department of Computer Science, Jinan University, Guangzhou 510632, China; Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security, Guangzhou 510632, China)

出版日期:2012-04-28 发布日期:2012-05-31
通讯作者: ZHU Wei-heng(朱蔚恒) E-mail: tzhuwh@jnu.edu.cn

Mining Evolving Association Rules for E-Business Recommendation

LONG Shun (龙舜), ZHU Wei-heng^∗(朱蔚恒)

(Department of Computer Science, Jinan University, Guangzhou 510632, China; Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security, Guangzhou 510632, China)

Online:2012-04-28 Published:2012-05-31
Contact: ZHU Wei-heng? (朱蔚恒) E-mail: tzhuwh@jnu.edu.cn

摘要/Abstract

摘要： Association analysis is an effective data mining approach capable of unveiling interesting associations within a large dataset. Although widely adopted in e-business areas, it still has many difficulties when applied in practice. For instance, there is a mismatch between the static rules discovered and the drifting nature of the user interests, and it is difficult to detect associations from a huge volume of raw user data. This paper presents an effective approach to mine evolving association rules in order to tackle these problems. It is followed by a recommendation model based on the evolving association rules unveiled. Experimental results on an online toggery show that it can effectively unveil people’s shifting interests and make better recommendations accordingly.

关键词: data mining, evolving association rules, personalized recommendation

Abstract: Association analysis is an effective data mining approach capable of unveiling interesting associations within a large dataset. Although widely adopted in e-business areas, it still has many difficulties when applied in practice. For instance, there is a mismatch between the static rules discovered and the drifting nature of the user interests, and it is difficult to detect associations from a huge volume of raw user data. This paper presents an effective approach to mine evolving association rules in order to tackle these problems. It is followed by a recommendation model based on the evolving association rules unveiled. Experimental results on an online toggery show that it can effectively unveil people’s shifting interests and make better recommendations accordingly.

Key words: data mining, evolving association rules, personalized recommendation

中图分类号:

TP 181

LONG Shun (龙舜), ZHU Wei-heng (朱蔚恒). Mining Evolving Association Rules for E-Business Recommendation[J]. 上海交通大学学报（英文版）, 2012, 17(2): 161-165.

LONG Shun (龙舜), ZHU Wei-heng (朱蔚恒). Mining Evolving Association Rules for E-Business Recommendation[J]. Journal of shanghai Jiaotong University (Science), 2012, 17(2): 161-165.

参考文献

[1] Han J W, Kamber M. Data mining: Concepts and techniques [M]. San Francisco, USA: Morgan Kaufmann Publishers, 2006.

[2] Delort J Y. A content-based approach for detecting users’ shift of interests [C]//Proceedings of the 1st International

Conference on Internet Technologies and Applications. Wrexham, UK: Local Organizing Committee,2005: 1-10.

[3] Koychev I, Schwab I. Adaptation to drifting user interests [C]//Proceedings of the 11th European Conference on Machine Learning Workshop: Machine

Learning in New Information Age. Barcelona, Spain:Springer-Verlag, 2000: 39-46.

[4] Ma S, Li X, Ding Y, et al. A recommender system with interest-drifting [C]//Proceedings of the 8th International Conference on Web Information Systems Engineering.

Nancy, France: Springer-Verlag, 2007: 633-642.

[5] Zhang P, Pu J, Liu Y, et al. A probabilistic approach for mining drifting user interest [C]//Proceedings of the Joint International Conference on Advances in

Data and Web Management. Suzhou, China: Springer-Verlag, 2009: 381-391.

[6] Koren Y. Collaborative filtering with temporal dynamics[C]//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and

Data Mining. San Diego, USA: Association for Computing Machinery, 2009: 447-456.

[7] Srikant R, Agrawal R. Mining quantitative association rules in large relational tables [C]// Proceedings of the 1996 ACM SIGMOD International Conference on

Management of Data. Montreal, Canada: Association for Computing Machinery, 1996: 1-12.

[8] Deshpande M, Karypis G. Item-based top-N recommendation algorithms [J]. ACM Transactions on Information Systems, 2004, 22(1): 143-177.

[9] Bell R, Koren F, Volinsky C. Modeling relationships at multiple scales to improve accuracy of large recommender systems [C]//Proceedings of the 13th

ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Jose, USA: Association for Computing Machinery, 2007: 95-104.

[10] Han E H, Karypis G. Feature-based recommendation system [C]//Proceedings of the 14th ACM International Conference on Information and Knowledge

Management. Bremen, Germany: Association for Computing Machinery, 2005: 446-452.

[11] Mahmood T, Ricci F. Learning and adaptivity in interactive recommender systems [C]//Proceedings of the 9th International Conference on Electronic Commerce.

Minneapolis, USA: Association for Computing Machinery, 2007: 75-84.

Mining Evolving Association Rules for E-Business Recommendation

Mining Evolving Association Rules for E-Business Recommendation

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

本文评价

[1]	XU Zewen1,2 (许泽文), LI Jianqiang1,2,3,4* (李建强), LIU Bo1 (刘博),BI Jing1 (毕敬), LI Ro. Semi-Supervised Learning in Large Scale Text Categorization[J]. 上海交通大学学报（英文版）, 2017, 22(3): 291-302.
[2]	ZHAO Xiao-qiang* (赵小强), ZHOU Jin-hu (周金虎). Improved Kernel Possibilistic Fuzzy Clustering Algorithm Based on Invasive Weed Optimization[J]. 上海交通大学学报（英文版）, 2015, 20(2): 164-170.
[3]	QIU Wei-dong (邱卫东), JIN Ling (金凌), YANG Xiao-niu (杨小牛), YANG Hong-w. Bit Stream Oriented Enumeration Tree Pruning Algorithm [J]. 上海交通大学学报（英文版）, 2011, 16(5): 567-570.