Abstract
Recommendation technologies have traditionally been used in domains such as E-commerce and Web navigation to recommend resources to customers so as to help them to get the pertinent resources. Among the possible approaches is collaborative filtering that does not take into account the content of the resources: only the traces of usage of the resources are considered. State of the art models, such as sequential association-rules and Markov models, that can be used in the frame of privacy concerns, are usually studied in terms of performance, state space complexity and time complexity. Many of them have a large time complexity and require a long time to compute recommendations. However, there are domains of application of the models where recommendations may be required quickly. This paper focuses on the study of how these state of the art models can be adapted so as to be anytime. In that case recommendations can be proposed to the user whatever is the computation time available, the quality of the recommendations increases according to the computation time. We show that such models can be adapted so as to be anytime and we propose several strategies to compute recommendations iteratively. We also show that the computation time needed by these new models is not increased compared to classical ones; even so, it sometimes decreases.
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
Pazzani, M.J., Billsus, D.: Content-Based Recommendation Systems. In: Brusilovsky, P., Kobsa, A., Nejdl, W. (eds.) Adaptive Web 2007. LNCS, vol. 4321, pp. 325–341. Springer, Heidelberg (2007)
Burke, R., Hammond, K., Cooper, E.: Knowledge-based navigation of complex information spaces. In: Proceedings of the 13th National Conference on Artificial Intelligence, Menlo Park, Canada, pp. 462–468 (1996)
Goldberg, D., Nichols, D., Oki, B., Terry, D.: Using collaborative filtering to weave an information tapestry. Communications of the ACM 35(12), 61–70 (1992)
Aïmeur, E., Brassard, G., Fernandez, J., Mani, A.: Alambic: a privacy-preserving recommender system for electronic commerce. International Journal of Information Security 7(5), 307–334 (2008)
Sarwar, B.M., Karypis, G., Konstan, J.A., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: World Wide Web, pp. 285–295 (2001)
Pitkow, J., Pirolli, P.: Mining longest repeating subsequences to predict world wide web surfing. In: USITS 1999: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems (1999)
Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Proceedings of the 5th International Conference on Extending Database Technology, pp. 3–17 (1996)
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management od Data, pp. 207–216 (1993)
Fu, X., Budzik, J., Hammond, K.: Mining navigation history for recommendation. In: Proceedings of the 5th International Conference on Intelligent User Interfaces, pp. 106–112 (2000)
Mobasher, B.: Data mining for web personalization. In: Brusilovsky, P., Kobsa, A., Nejdl, W. (eds.) Adaptive Web 2007. LNCS, vol. 4321, pp. 90–135. Springer, Heidelberg (2007)
Lu, L., Dunham, M.H., Meng, Y.: Mining significant usage patterns from clickstream data. In: Nasraoui, O., Zaïane, O.R., Spiliopoulou, M., Mobasher, B., Masand, B., Yu, P.S. (eds.) WebKDD 2005. LNCS, vol. 4198, pp. 1–17. Springer, Heidelberg (2006)
Shyu, M., Haruechaiyasak, C., Chen, S., Zhao, N.: Collaborative filtering by mining association rules from user access sequences. In: International Workshop on Challenges in Web Information Retrieval and Integration (2005)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the International Conference on Data Engineering (ICDE 1995), pp. 3–14 (1995)
Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1997, pp. 255–264 (1997)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: ACM Conference on Electronic Commerce (2000)
Yong, W., Zhanhuai, L., Yang, Z.: Mining sequential association-rule for improving web document prediction. In: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2005 (2005)
Kim, C., Kim, J.: A recommendation algorithm using multi-level association rules. In: Proceedings of the IEEE/WIC International Conference on Web Intelligence, WI 2003 (2003)
Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. IEEE Transactions on Systems, Man and Cybernetics (2004)
Tan, X., Yao, M., Xu, M.: An effective technique for personalization recommendation based on access sequential patterns. In: Proceedings of the IEEE Asia-Pacific Conference on Services Computing, APSCC 2006 (2006)
Deshpande, M., Karypis, G.: Selective markov models for predicting web-page accesses. In: First SIAM International Conference on Data Mining (2001)
Xiao, Y., Dunham, M.: Efficient mining of traversal patterns. Data and Knwoledge Engineering 39(2), 191–214 (2001)
Huang, Y., Kuo, Y., Chen, J., Jeng, Y.: Np-miner: A real time recommendation algorithm by using web usage mining. Knowledge-Based Systems 19, 272–286 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brun, A., Boyer, A. (2009). Towards Privacy Compliant and Anytime Recommender Systems. In: Di Noia, T., Buccafurri, F. (eds) E-Commerce and Web Technologies. EC-Web 2009. Lecture Notes in Computer Science, vol 5692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03964-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-03964-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03963-8
Online ISBN: 978-3-642-03964-5
eBook Packages: Computer ScienceComputer Science (R0)