Abstract
The association-rule-based approach is one of the most common technologies for building recommender systems and it has been extensively adopted for commercial use. A variety of techniques, mainly including eligible rule selection and multiple rules combination, have been developed to create effective recommendation. Unfortunately, little attention has been paid to the scalability concern of rule-based recommendation methods. However, the computational complexity of rule-based methods shall increase drastically with the growth of both online customers and rules, which are usually several millions in typical e-commerce platforms. Moreover, the dynamic change of users’ actions requires rule-based methods make recommendations in nearly real-time, which further highlights the scalability issue of rule-based recommender systems. In this article, we present a distributed framework that can scale different association-rule-based recommendation methods in a unified way. Specifically, based on the summarization of existing rule-based approaches, a generic tree-type structure is defined to store separate kinds of patterns, and an efficient algorithm is designed for mining eligible patterns along with computing recommendation scores. To handle the ever-increasing number of online customers, a distributed framework is proposed, where two load-balanced strategies for partitioning tree are put forward to fit sparse and dense data, respectively. Extensive experiments on five real-life data sets demonstrate that the efficiency of association-rule-based recommender systems can be significantly improved by the proposed framework.
- Gediminas Adomavicius and Alexander Tuzhilin. 2001. Expert-driven validation of rule-based user models in personalization applications. Data Min. Knowl. Discov. 5, 1 (2001), 33--58.Google Scholar
Digital Library
- Gediminas Adomavicius and Alexander Tuzhilin. 2005. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 17, 6 (2005), 734--749.Google Scholar
Digital Library
- Gediminas Adomavicius and Alexander Tuzhilin. 2007. Validation sequence optimization: A theoretical approach. INFORMS J. Comput. 19, 2 (2007), 185--200.Google Scholar
Digital Library
- Charu C. Aggarwal. 2016. Recommender Systems. Springer.Google Scholar
Digital Library
- Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, 207--216.Google Scholar
Digital Library
- Gregory Buehrer, Srinivasan Parthasarathy, and Amol Ghoting. 2006. Out-of-core frequent pattern mining on a commodity PC. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 86--95.Google Scholar
Digital Library
- B. Barla Cambazoglu, Emre Varol, Enver Kayaaslan, Cevdet Aykanat, and Ricardo Baeza-Yates. 2010. Query forwarding in geographically distributed search engines. In Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval. 90--97.Google Scholar
Digital Library
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms. MIT Press.Google Scholar
Digital Library
- James Davidson, Benjamin Liebald, Junning Liu, Palash Nandy, Taylor Van Vleet, Ullas Gargi, Sujoy Gupta, Yu He, Mike Lambert, Blake Livingston, and Dasarathi Sampath. 2010. The YouTube video recommendation system. In Proceedings of the ACM Conference on Recommender Systems (RecSys’10). 293--296.Google Scholar
Digital Library
- Farzad Eskandanian, Bamshad Mobasher, and Robin Burke. 2017. A clustering approach for personalizing diversity in collaborative recommender systems. In Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization (UMAP’17). 280--284.Google Scholar
Digital Library
- Rana Forsati and Mohammad Reza Meybodi. 2010. Effective page recommendation algorithms based on distributed learning automata and weighted association rules. Expert Syst. Appl. 37, 2 (2010), 1316--1330.Google Scholar
Digital Library
- Gustavo Machado Campagnani Gama, W. Meira, Márcio L. B. Carvalho, Dorgival O. Guedes, and Virgílio A. F. Almeida. 2001. Resource placement in distributed e-commerce servers. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM’01), Vol. 3. IEEE, 1677--1682.Google Scholar
- Abhijeet Ghoshal, Syam Menon, and Sumit Sarkar. 2015. Recommendations using information from multiple association rules: A probabilistic approach. Information Syst. Res. 26, 3 (2015), 532--551.Google Scholar
Digital Library
- Abhijeet Ghoshal and Sumit Sarkar. 2014. Association rules for recommendations with multiple items. Informs J. Comput. 26, 3 (2014), 433--448.Google Scholar
Cross Ref
- R. L. Graham. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 2 (1969), 416--429.Google Scholar
Digital Library
- Gösta Grahne and Jianfei Zhu. 2004. Mining frequent itemsets from secondary memory. In Proceedings of the International Conference on Data Mining (ICDM’04). 91--98.Google Scholar
Cross Ref
- Grahne Grahne and Jianfei Zhu. 2005. Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17, 10 (2005), 1347--1362.Google Scholar
Digital Library
- Guibing Guo, Jie Zhang, and Neil Yorke-Smith. 2016. A novel evidence-based Bayesian similarity measure for recommender systems. ACM Trans. Web 10, 2 (2016), 8.Google Scholar
Digital Library
- Jiawei Han, Jian Pei, and Yiwen Yin. 2000. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, 1--12.Google Scholar
Digital Library
- Negar Hariri, Bamshad Mobasher, and Robin Burke. 2012. Context-aware music recommendation based on latent topic sequential patterns. In Proceedings of the 6th ACM Conference on Recommender Systems. ACM, 131--138.Google Scholar
Digital Library
- Choonho Kim and Juntae Kim. 2003. A recommendation algorithm using multi-level association rules. In Proceedings of the IEEE / WIC International Conference on Web Intelligence (WI’03). 524--527.Google Scholar
- Carson K. Leung, Fan Jiang, and Adam GM Pazdor. 2017. Bitwise parallel association rule mining for web page recommendation. In Proceedings of the International Conference on Web Intelligence. ACM, 662--669.Google Scholar
Digital Library
- Cane Wing-ki Leung, Stephen Chi-fai Chan, and Fu-lai Chung. 2006. A collaborative filtering framework based on fuzzy association rules and multiple-level similarity. Knowl. Info. Syst. 10, 3 (2006), 357--381.Google Scholar
Digital Library
- Haoyuan Li, Yi Wang, Dong Zhang, Ming Zhang, and Edward Y. Chang. 2008. PFP: Parallel fp-growth for query recommendation. In Proceedings of the ACM Conference on Recommender Systems (RecSys’08). 107--114.Google Scholar
- Wenmin Li, Jiawei Han, and Jian Pei. 2001. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of the IEEE International Conference on Data Mining. 19--21.Google Scholar
- Weiyang Lin, Sergio A. Alvarez, and Carolina Ruiz. 2002. Efficient adaptive-support association rule mining for recommender systems. Data Mining Knowl. Discov. 6, 1 (2002), 83--105.Google Scholar
Digital Library
- Greg Linden, Brent Smith, and Jeremy York. 2003. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 7, 1 (2003), 76--80.Google Scholar
Digital Library
- Duen-Ren Liu, Chin-Hui Lai, and Wang-Jung Lee. 2009. A hybrid of sequential rules and collaborative filtering for product recommendation. Info. Sci. 179, 20 (2009), 3505--3519.Google Scholar
- Xin Luo, Mengchu Zhou, Yunni Xia, and Qingsheng Zhu. 2014. An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems. IEEE Trans. Industr. Inform. 10, 2 (2014), 1273--1284.Google Scholar
Cross Ref
- Julian J. McAuley and Jure Leskovec. 2013. Hidden factors and hidden topics: Understanding rating dimensions with review text. In Proceedings of the 7th ACM Conference on Recommender Systems (RecSys’13). 165--172.Google Scholar
- Harshitha Menon and Laxmikant V. Kalé. 2013. A distributed dynamic load balancer for iterative applications. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC’13). 15.Google Scholar
- Bamshad Mobasher, Honghua Dai, Tao Luo, and Miki Nakagawa. 2001. Effective personalization based on association rule discovery from web usage data. In Proceedings of the 3rd International Workshop on Web Information and Data Management (WIDM’01). 9--15.Google Scholar
Digital Library
- Bamshad Mobasher, Honghua Dai, Tao Luo, and Miki Nakagawa. 2002. Discovery and evaluation of aggregate usage profiles for web personalization. Data Mining Knowl. Discov. 6, 1 (2002), 61--82.Google Scholar
Digital Library
- Kaweh Djafari Naini, Ismail Sengor Altingovde, and Wolf Siberski. 2016. Scalable and efficient web search result diversification. ACM Trans. Web 10, 3 (2016), 15.Google Scholar
Digital Library
- Miki Nakagawa and Bamshad Mobasher. 2003. A hybrid web personalization model based on site connectivity. In Proceedings of the SIGKDD Workshop on Web Mining and Web Usage Analysis (WebKDD’03). 59--70.Google Scholar
- Sergio Oramas, Vito Claudio Ostuni, Tommaso Di Noia, Xavier Serra, and Eugenio Di Sciascio. 2016. Sound and music recommendation with knowledge graphs. ACM Trans. Intell. Syst. Technol. 8, 2 (2016), 21.Google Scholar
- Srinivasan Parthasarathy, Mohammed Javeed Zaki, Mitsunori Ogihara, and Wei Li. 2001. Parallel data mining for association rules on shared-memory systems. Knowl. Info. Syst. 3, 1 (2001), 1--29.Google Scholar
Digital Library
- David Patterson and John L. Hennessy. 2012. Computer Architecture: A Quantitative Approach. Elsevier.Google Scholar
- Zujie Ren, Jian Wan, Weisong Shi, Xianghua Xu, and Min Zhou. 2014. Workload analysis, implications, and optimization on a production hadoop cluster: A case study on Taobao. IEEE Trans. Services Comput. 7, 2 (2014), 307--321.Google Scholar
Cross Ref
- Cynthia Rudin, Benjamin Letham, Ansaf Salleb-Aouissi, Eugene Kogan, and David Madigan. 2011. Sequential event prediction with association rules. Omnipress 19 (2011), 615--634.Google Scholar
- J. J. Sandvig, Bamshad Mobasher, and Robin Burke. 2007. Robustness of collaborative recommendation based on association rule mining. In Proceedings of the ACM Conference on Recommender Systems. 105--112.Google Scholar
Digital Library
- Evan R. Sparks, Ameet Talwalkar, Valton Smith, Jey Kottalam, Xinghao Pan, Jose Gonzalez, Michael J. Franklin, Michael I. Jordan, and Tim Kraska. 2013. MLI: An API for distributed machine learning. In Proceedings of the IEEE 13th International Conference on Data Mining (ICDM’13). IEEE, 1187--1192.Google Scholar
Cross Ref
- Myra Spiliopoulou and Lukas C. Faulstich. 1998. WUM: A web utilization miner. In Proceedings of the EDBT Workshop (WebDB’98). Springer Verlag, 109--115.Google Scholar
- Jiaxi Tang and Ke Wang. 2018. Personalized Top-N sequential recommendation via convolutional sequence embedding. In Proceedings of the 11th ACM International Conference on Web Search and Data Mining (WSDM’18). 565--573.Google Scholar
Digital Library
- Fatemeh Vahedian, Robin Burke, and Bamshad Mobasher. 2017. Multirelational recommendation in heterogeneous networks. ACM Trans. Web 11, 3 (2017), 15:1--15:34.Google Scholar
Digital Library
- Feng Hsu Wang and Hsiu Mei Shao. 2004. Effective personalized recommendation based on time-framed navigation clustering and association mining. Expert Syst. Appl. 27, 3 (2004), 365--377.Google Scholar
Cross Ref
- Yaqiong Wang, Junjie Wu, Zhiang Wu, Hua Yuan, and Xu Zhang. 2014. Popular items or niche items: Flexible recommendation using cosine patterns. In Proceedings of the IEEE International Conference on Data Mining Workshops. 205--212.Google Scholar
Cross Ref
- Geoffrey I. Webb. 2000. Efficient search for association rules. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 99--107.Google Scholar
Digital Library
- Kasun Wickramaratna, Miroslav Kubat, and Kamal Premaratne. 2009. Predicting missing items in shopping carts. IEEE Trans. Knowl. Data Eng. 21, 7 (2009), 985--998.Google Scholar
Digital Library
- Le Wu, Qi Liu, Enhong Chen, Nicholas Jing Yuan, Guangming Guo, and Xing Xie. 2016. Relevance meets coverage: A unified framework to generate diversified recommendations. ACM Trans. Intell. Syst. Technol. 7, 3 (2016), 39:1--39:30.Google Scholar
Digital Library
- Hui Xiong, Pang-Ning Tan, and Vipin Kumar. 2006. Hyperclique pattern discovery. Data Mining Knowl. Discov. J. 13, 2 (2006), 219--242.Google Scholar
Digital Library
- Osmar R. Zaïane. 2002. Building a recommender agent for e-learning systems. In Proceedings of the IEEE International Conference on Computers in Education. IEEE, 55--59.Google Scholar
Cross Ref
- Heng-Ru Zhang, Fan Min, and Bing Shi. 2017. Regression-based three-way recommendation. Info. Sci. 378 (2017), 444--461.Google Scholar
- Mei Zheng, Fan Min, Heng-Ru Zhang, and Wen-Bin Chen. 2016. Fast recommendations with the M-distance. IEEE Access 4 (2016), 1464--1468.Google Scholar
Cross Ref
- Guixiang Zhu, Jie Cao, Changsheng Li, and Zhiang Wu. 2017. A recommendation engine for travel products based on topic sequential patterns. Multimedia Tools Appl. 76, 16 (2017), 17595--17612.Google Scholar
Digital Library
- Jiaqi Zhu, Kaijun Wang, Yunkun Wu, Zhongyi Hu, and Hongan Wang. 2016. Mining user-aware rare sequential topic patterns in document streams. IEEE Trans. Knowl. Data Eng. 28, 7 (2016), 1790--1804.Google Scholar
Cross Ref
Index Terms
On Scalability of Association-rule-based Recommendation: A Unified Distributed-computing Framework
Recommendations
A Collaborative Filtering Recommendation Algorithm Based on Item Classification
PACCS '09: Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and SystemsCollaborative filtering systems represent services of personalized that aim at predicting a user’s interest on some items available in the application systems. With the development of electronic commerce, the number of users and items grows rapidly, ...
Top-N Recommendation Based on Granular Association Rules
Rough Sets and Knowledge TechnologyAbstractRecommender systems are popular in e-commerce as they provide users with items of interest. Existing top-K approaches mine the K strongest granular association rules for each user, and then recommend respective K types of items to her. ...
Non-Redundant Sequential Association Rule Mining and Application in Recommender Systems
WI-IAT '10: Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03Many modern recommender systems are not suitable for recommending infrequently purchased products such as cars due to lack of user rating data to infrequently purchased products. A big challenge for recommending infrequently purchased products is the ...






Comments