Abstract
Social tagging systems (STS) model three types of entities (i.e. tag-user-item) and relationships between them are encoded into a 3-order tensor. Latent relationships and patterns can be discovered by applying tensor factorization techniques like Higher Order Singular Value Decomposition (HOSVD), Canonical Decomposition etc. STS accumulate large amount of sparse data that restricts factorization techniques to detect latent relations and also significantly slows down the process of a factorization. We propose to reduce tag space by exploiting clustering techniques so that the quality of the recommendations and execution time are improved and memory requirements are decreased. The clustering is motivated by the fact that many tags in a tag space are semantically similar thus the tags can be grouped. Finally, promising experimental results are presented.
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
Begelman, G., Keller, P., Smadja, F.: Automated tag clustering: Improving search and exploration in the tag space. In: CWT at WWW 2006, Edinburgh, Scotland, pp. 15–33. Citeseer (2006)
Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)
Gemmell, J., Shepitsen, A., Mobasher, B., Burke, R.: Personalization in folksonomies based on tag clustering. Intelligent Techniques for web Personalization & Recommender Systems 12 (2008)
Hansen, P.: The truncatedsvd as a method for regularization. BIT Numerical Mathematics 27(4), 534–553 (1987)
Huang, A.: Similarity measures for text document clustering. In: Proceedings of NZCSRSC 2008, Christchurch, New Zealand, pp. 49–56 (2008)
Kipp, M., Campbell, D.: Patterns and inconsistencies in collaborative tagging systems: An examination of tagging practices. Proceedings of the American Society for Information Science and Technology 43(1), 1–18 (2006)
Leginus, M., Zemaitis, V.: Speeding up tensor based recommenders with clustered tag space and improving quality of recommendations with non-negative tensor factorization. Master’s thesis, Aalborg University (2011)
Mitchell, M.: An introduction to genetic algorithms. The MIT Press (1998)
Rendle, S., Balby Marinho, L., Nanopoulos, A., Schmidt-Thieme, L.: Learning optimal ranking with tensor factorization for tag recommendation. In: Proceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM (2009)
Solskinnsbakk, G., Gulla, J.: Mining tag similarity in folksonomies. In: Proceedings of the 3rd International Workshop on Search and Mining User-Generated Contents, pp. 53–60. ACM (2011)
Symeonidis, P., Nanopoulos, A., Manolopoulos, Y.: A unified framework for providing recommendations in social tagging systems based on ternary semantic analysis. IEEE Transactions on Knowledge and Data Engineering (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leginus, M., Dolog, P., Žemaitis, V. (2012). Improving Tensor Based Recommenders with Clustering. In: Masthoff, J., Mobasher, B., Desmarais, M.C., Nkambou, R. (eds) User Modeling, Adaptation, and Personalization. UMAP 2012. Lecture Notes in Computer Science, vol 7379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31454-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-31454-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31453-7
Online ISBN: 978-3-642-31454-4
eBook Packages: Computer ScienceComputer Science (R0)