A new approach for collaborative filtering based on mining frequent itemsets
Pages 19 - 29
Abstract
As one of the most successful approaches to building recommender systems, collaborative filtering (CF) uses the known preferences of a group of users to make recommendations or predictions of the unknown preferences for other users. In this paper, we first propose a new CF model-based approach which has been implemented by basing on mining frequent itemsets technique with the assumption that "The larger the support of an item is, the higher it's likely that this item will occur in some frequent itemset, is". We then present the enhanced techniques such as the followings: bits representations, bits matching as well bits mining in order to speeding-up the algorithm processing with CF method.
References
[1]
Movielens dataset 2011. Home page is http://www.movielens.org, Download dataset from http://www.grouplens.org/node/12
[2]
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Elsevier Inc. (2006)
[3]
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)
[4]
Linden, G., Smith, B., York, J.: Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing 7(1), 76-80 (2003)
[5]
Hofmann, T.: Latent semantic models for collaborative filtering. ACM Transactions on Information Systems 22(1), 89-115 (2004)
[6]
Breese, J., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, UAI 1998 (1998)
[7]
Miyahara, K., Pazzani, M. J.: Collaborative filtering withthe simple Bayesian classifier. In: Proceedings of the 6th Pacific Rim International Conference on Artificial Intelligence, pp. 679-689 (2000)
[8]
Su, X., Khoshgoftaar, T. M.: Collaborative filtering for multi-class data using belief nets algorithms. In: Proceedings of the International Conference on Tools with Artificial Intelligence, ICTAI 2006, pp. 497-504 (2006)
[9]
Ungar, L. H., Foster, D. P.: Clustering methods for collaborative filtering. In: Proceedings of the Workshop on Recommendation Systems. AAAI Press (1998)
[10]
Chee, S. H. S., Han, J., Wang, K.: RecTree: an efficient collaborative filtering method. In: Proceedings of the 3rd International Conference on Data Warehousingand Knowledge Discovery, pp. 141-151 (2001)
[11]
Shani, G., Heckerman, D., Brafman, R. I.: An MDP-based recommender system. Journal of Machine Learning Research 6, 1265-1295 (2005)
[12]
Billsus, D., Pazzani, M.: Learning collaborative information filters. In: Proceedings of the 15th International Conference on Machine Learning, ICML 1998 (1998)
[13]
Sarwar, B. M., Karypis, G., Konstan, J. A., Riedl, J.: Analysis of recommendation algorithms for E-commerce. In: Proceedings of the ACM E-Commerce, Minneapolis, Minn, USA, pp. 158-167 (2000)
[14]
Sarwar, B. M., Karypis, G., Konstan, J. A., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International Conference on World Wide Web, WWW 2001, pp. 285-295 (May 2001)
- A new approach for collaborative filtering based on mining frequent itemsets
Recommendations
A Combination Approach to Frequent Itemsets Mining
ICCIT '08: Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01In this paper, we propose a new mining of frequent itemsets algorithm, called SFI-mine algorithm. The SFI-mine constructs pattern-base by using a new method which is different from the conditional pattern-base in FP-growth, mines frequent itemsets with ...
An adaptive approach to mining frequent itemsets efficiently
The mining of frequent itemsets is a fundamental and important task of data mining. To improve the efficiency in mining frequent itemsets, many researchers developed smart data structures to represent the database, and designed divide-and-conquers ...
An efficient pattern growth approach for mining fault tolerant frequent itemsets
Highlights- Mining fault tolerant (FT) frequent itemsets are computationally expensive.
- ...
AbstractMining fault tolerant (FT) frequent itemsets from transactional databases are computationally more expensive than mining exact matching frequent itemsets. Previous algorithms mine FT frequent itemsets using Apriori heuristic. Apriori-...
Comments
Information & Contributors
Information
Published In
Sponsors
- UTM: Universiti Teknologi Malaysia
- Wrocław University of Technology
- NTTU: Nguyen Tat Thanh University
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 18 March 2013
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025