Abstract
The traditional method of recommender systems suffers from the Sparsity problem whereby incomplete dataset results in poor recommendations. Another issue is the drifting preference, i.e. the change of the user’s preference with time. In this paper, we propose an algorithm that takes minimal inputs to do away with the Sparsity problem and takes the drift into consideration giving more priority to latest data. The streams of elements are decomposed into the corresponding attributes and are classified in a preferential list with tags as “Sporadic”, “New”, “Regular”, “Old” and “Past” – each category signifying a changing preference over the previous respectively. A repeated occurrence of attribute set of interest implies the user’s preference for such attribute(s). The proposed algorithm is based on drifting preference and has been tested with the Yahoo Webscope R4 dataset. Results have shown that our algorithm have shown significant improvements over the comparable “Sliding Window” algorithm.
This research has been supported by Indian Institute of Management Calcutta (IIM Calcutta), work order no. 019/RP: SIRS//3397/2008-09.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Herlocker, J., Konstan, J., Borchers, A., Riedl, J.: An Algorithm Framework for Performing Collaborative Filtering. In: Proceedings of SIGIR, pp. 77–87. ACM, New York (1999)
Lam, S., Riedl, J.: Shilling Recommender Systems for Fun and Profit. In: Proceedings of the 13th International WWW Conference, New York (2004)
Massa, P., Avesani, P.: Trust-aware collaborative filtering for recommender systems. In: Proceedings of the Federated Int. Conf. on the Move to Meaningful Internet (2004)
Massa, P., Avesani, P.: Trust-aware recommender systems. In: Proceedings of the 2007 ACM Conference on Recommender Systems, Minneapolis (2007)
Massa, P., Avesani, P.: Trust-aware Bootstrapping of Recommender Systems. In: Proceeedings of ECAI Workshop on Recommender Systems, Italy (2006)
Massa, P., Avesani, P.: Trust metrics on controversial users: balancing between tyranny of the majority and echo chambers. International Journal on Semantic Web and Information Systems
Mobasher, B., Burke, R., Bhaumik, R., Williams, C.: Towards Trustworthy Recommender Systems: An Analysis of Attack Models and Algorithm Robustness. ACM Transactions on Internet Technology 7, 23:1–23:38 (2007)
Rashid, A., Karypis, G., Riedl, J.: Learning Preferences of New Users in Recommender Systems: An Information Theoretic Approach. SIGKDD Explorations 10, 90–100 (2008)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based Collaborative Filtering of Recommendation Algorithms. In: Proceedings of the 10th International WWW Conference, Hong Kong (2001)
Victor, P., Cornelis, C., Cock, M., Teredesai, A.: Key figure impact in trust-enhanced recommender systems. AI Communications 21(2-3), 127–143 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saha, S., Majumder, S., Ray, S., Mahanti, A. (2010). Categorizing User Interests in Recommender Systems. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-15390-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15389-1
Online ISBN: 978-3-642-15390-7
eBook Packages: Computer ScienceComputer Science (R0)