This study aims to improve the level of personalized recommendation services in intelligent libraries of colleges and universities and address the issue of insufficient recommendation accuracy in existing models caused by static user representation and data sparsity. It proposes a lightweight graph neural network recommendation model integrating the idea of Singular Value Decomposition++ (SVD++), namely SVD++-Lightweight Graph Convolutional Network (SVD-LGCN). Taking Lightweight Graph Convolutional Network (LightGCN) as its backbone, this model learns the global embedding representation containing high-order collaborative signals from the user-book interaction graph. Moreover, in the prediction layer, it innovatively draws on the idea of SVD + + and dynamically aggregates all historical interaction behaviors of users to generate an enhanced user preference representation, thereby achieving refined and dynamic characterization of user interests. Experimental results on the public Book-Crossing dataset show that the proposed model has superior performance. Compared with the LightGCN baseline model, SVD-LGCN achieves a relative performance improvement of 4.1% in NDCG@20, a core indicator for measuring ranking quality. Additionally, its Precision@5 is 0.413 and Recall@50 is 0.589. The research conclusion confirms that the proposed model provides an advanced technical solution with both theoretical innovation and practical value for constructing an efficient and accurate personalized recommendation system for intelligent libraries of colleges and universities.
GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations...
Xiaotian Zhang, Chun-yan Li, Yi Zong et al.· arXiv.org· 216 citations· ⚡17
This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.
This work shows that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration and introduces high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical...
Masoud Mohseni, Artur Scherer, K. Johnson et al.· arXiv.org· 121 citations· ⚡9
This paper presents a comprehensive overview of the Ultralytics YOLO family, emphasizing architectural evolution, benchmarking, deployment, and emerging directions from YOLOv5 through YOLO27, and examines detection, segmentation, depth, classification, pose, oriented detection, tracking, export, quantization, and deplo...
This work revisits schema linking when using the latest generation of large language models (LLMs) and finds empirically that newer models are adept at utilizing relevant schema elements during generation even in the presence of large numbers of irrelevant ones.
Karime Maamari, Fadhil Abubaker, Daniel Jaroslawicz et al.· arXiv.org· 109 citations· ⚡19
A novel threat is unveiled in which attackers steer the RAG system's response by injecting malicious passages into its knowledge base, enabling the attacker to steer the response without altering the user input or modifying the RAG weights.
Jiaqi Xue, Meng Zheng, Yebowen Hu et al.· arXiv.org· 109 citations· ⚡8
With $2.1 million funding from Google.org, the open-source Public Transit Intelligence Hub will unify public transit monitoring, operations, and passenger communication.
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.