Deep Learning Algorithms for Personalized Services and Enhanced User Experience in Libraries
Bibliographic record
Abstract
The integration of deep learning (DL) algorithms in library settings engenders a multitude of challenges and complexities, encompassing unintended ramifications, ethical quandaries, a dearth of specialized literature elucidating DL in library contexts, the intricacies of dataset selection and human intervention, and the inherent limitations when juxtaposed with the remarkable cognitive capabilities of the human brain. To surmount these hurdles and attain a profound comprehension of DL in library settings, a rigorous and comprehensive systematic literature review (SLR) becomes imperative. This study investigates the application of DL algorithms in examining user-seeking behaviour to provide personalized services and enhance user experience in libraries. Through a comprehensive literature review, the study aims to uncover the benefits, challenges, and implications of integrating DL algorithms for user behaviour analysis and personalized services in library environments. The investigation encompasses a systematic literature review, employing a meticulous search and screening process utilizing the Scopus database. DL algorithms enable tailored recommendations, resource suggestions, and personalized search outcomes, improving information retrieval and user-centric services. Ethical considerations and ongoing research are emphasized to address challenges and maximize the potential of DL algorithms in libraries. The integration of DL algorithms in libraries yields substantial benefits, including improved information retrieval capabilities, augmented resource recommendation systems, and the delivery of user-centric services. The paper offers valuable insights to researchers, practitioners, and stakeholders operating within this field.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".