Recommendation Systems in Libraries: an Application with Heterogeneous Data Sources

• URL: http://arxiv.org/abs/2303.11746v1
• Date: Tue, 21 Mar 2023 11:13:01 GMT
• Title: Recommendation Systems in Libraries: an Application with Heterogeneous Data Sources
• Authors: Alessandro Speciale, Greta Vallero, Luca Vassio, Marco Mellia
• Abstract summary: The Reading&Machine project exploits the support of digitalization to increase the attractiveness of libraries and improve the users' experience. The project implements an application that helps the users in their decision-making process, providing recommendation system (RecSys)-generated lists of books the users might be interested in.
• Score: 66.81627042740679
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The Reading&Machine project exploits the support of digitalization to increase the attractiveness of libraries and improve the users' experience. The project implements an application that helps the users in their decision-making process, providing recommendation system (RecSys)-generated lists of books the users might be interested in, and showing them through an interactive Virtual Reality (VR)-based Graphical User Interface (GUI). In this paper, we focus on the design and testing of the recommendation system, employing data about all users' loans over the past 9 years from the network of libraries located in Turin, Italy. In addition, we use data collected by the Anobii online social community of readers, who share their feedback and additional information about books they read. Armed with this heterogeneous data, we build and evaluate Content Based (CB) and Collaborative Filtering (CF) approaches. Our results show that the CF outperforms the CB approach, improving by up to 47\% the relevant recommendations provided to a reader. However, the performance of the CB approach is heavily dependent on the number of books the reader has already read, and it can work even better than CF for users with a large history. Finally, our evaluations highlight that the performances of both approaches are significantly improved if the system integrates and leverages the information from the Anobii dataset, which allows us to include more user readings (for CF) and richer book metadata (for CB).

Related papers

• EmbSum: Leveraging the Summarization Capabilities of Large Language Models for Content-Based Recommendations [38.44534579040017]
  We introduce EmbSum, a framework that enables offline pre-computations of users and candidate items. The model's ability to generate summaries of user interests serves as a valuable by-product, enhancing its usefulness for personalized content recommendations.
  arXiv  Detail & Related papers  (2024-05-19T04:31:54Z)
• Knowledge Adaptation from Large Language Model to Recommendation for Practical Industrial Application [54.984348122105516]
  Large Language Models (LLMs) pretrained on massive text corpus presents a promising avenue for enhancing recommender systems. We propose an Llm-driven knowlEdge Adaptive RecommeNdation (LEARN) framework that synergizes open-world knowledge with collaborative knowledge.
  arXiv  Detail & Related papers  (2024-05-07T04:00:30Z)
• Editable User Profiles for Controllable Text Recommendation [66.00743968792275]
  We propose LACE, a novel concept value bottleneck model for controllable text recommendations. LACE represents each user with a succinct set of human-readable concepts. It learns personalized representations of the concepts based on user documents.
  arXiv  Detail & Related papers  (2023-04-09T14:52:18Z)
• FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings [108.77460689459247]
  We propose a Federated Graph Recommender System (FedGRec) to mitigate privacy concerns. In our system, users and the server explicitly store latent embeddings for users and items, where the latent embeddings summarize different orders of indirect user-item interactions. We perform extensive empirical evaluations to verify the efficacy of using latent embeddings as a proxy of missing interaction graph.
  arXiv  Detail & Related papers  (2022-10-25T01:08:20Z)
• Lib-SibGMU -- A University Library Circulation Dataset for Recommender Systems Developmen [58.720142291102135]
  We opensource Lib-SibGMU - a university library circulation dataset. For a recommender architecture that consists of a vectorizer that turns the history of the books borrowed into a vector, we show that using the fastText model as a vectorizer delivers competitive results.
  arXiv  Detail & Related papers  (2022-08-25T22:10:18Z)
• PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning [0.0]
  PEPPER is a decentralized recommender system based on gossip learning principles. Our solution converges up to 42% faster than with other decentralized solutions.
  arXiv  Detail & Related papers  (2022-08-09T14:51:27Z)
• Improving Rating and Relevance with Point-of-Interest Recommender System [0.0]
  We develop a deep neural network architecture to model query-item relevance in the presence of both collaborative and content information. The application of these learned representations to a large-scale dataset resulted in significant improvements.
  arXiv  Detail & Related papers  (2022-02-17T16:43:17Z)
• How to Put Users in Control of their Data in Federated Top-N Recommendation with Learning to Rank [16.256897977543982]
  We present FPL, an architecture in which users collaborate in training a central factorization model while controlling the amount of sensitive data leaving their devices. The proposed approach implements pair-wise learning-to-rank optimization by following the Federated Learning principles.
  arXiv  Detail & Related papers  (2020-08-17T10:13:15Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.