Abstract
A traditional library recommender system can not only employ individual history of library usage to recommend books which she (he) is interested, but also uses library usages of other users who are in the same social network to recommend the books which she (he) never loans but may be interested in. However, the same treatment for the user library usage at different times will lead to the recommended result departure from the users’ current information needs. Meanwhile, the data of library usage are highly dimensional and sparse. Thus, due to data sparsity and interest change over time, the traditional recommender systems cannot perform well. In order to tackle the two issues, this paper exploits time decay weight and matrix clustering to propose a novel library recommender system. Comparing two traditional recommender systems using K-Means clustering and hierarchical agglomerative clustering, experiments show promising results.
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
Adomavicius, G., Tuzhilin: Toward the next generation of recommender systems: A survey of state-of-the-art and possible extension. IEEE Transactions on Knowledge and Data Engineering 17(6), 734–749 (2005)
Angiulli, F., Cesario, E., Pizzuti, C.: A Greedy Search Approach to Co-clustering Sparse Binary Matrices. In: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006 (2006)
Chen, Z., Jiang, J., Zhao, Y.: A Collaborative Filtering Recommendation Algorithm Based on User Interest Change and Trust Evaluation. International Journal of Digital Content Technology and its Applications 4(9), 106–113 (2010)
McLaughlin, M.R., Herlocker, J.L.: Content-based filtering & collaborative filtering: A collaborative filtering algorithm and valuation metric that accurately model the user experience. In: Proceeding of the 27th ACM SIGIR Conference, pp. 329–336 (2004)
New Classification Scheme for Chinese Libraries (May 15, 2012), http://en.wikipedia.org/wiki/New_Classification_Scheme_for_Chinese_Libraries
Oyanagi, S., Kubota, K., And Nakase, A.: Application of Matrix Clustering to Web Log Analysis and Access Prediction. In: WebKDD 2001 (2001)
Peis, E., del Castillo, J.M.M., Delgado-Lopez, J.A.: Semantic Recommender Systems: Analysis of the state of the topic. Hipertext. Net 6 (2008)
Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.): Recommender Systems Handbook. Springer (2010)
Russell, S., Norvig, P.: Artificial Intelligence-A Modern Approach. Prentice Barzilay, Regina and Elhadad, Michael (2003) Using Lexical Chains for Text Summarization. In: Proceedings of ACL/EACL 1997 Workshop on The Intelligent Scalable Text Summarization, pp. 10–16 (1997)
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
Kuo, JJ., Zhang, YJ. (2012). A Library Recommender System Using Interest Change over Time and Matrix Clustering. In: Chen, HH., Chowdhury, G. (eds) The Outreach of Digital Libraries: A Globalized Resource Network. ICADL 2012. Lecture Notes in Computer Science, vol 7634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34752-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-34752-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34751-1
Online ISBN: 978-3-642-34752-8
eBook Packages: Computer ScienceComputer Science (R0)