article · IEEE Access
Long Short-Term Memory (LSTM) networks are particularly useful in recommender systems since user preferences change over time. Unlike traditional recommender models which assume static user-item interactions, LSTM models capture sequential dependencies and temporal dynamics, making them ideal for personalized, session-based, and sequential recommendation tasks. However, traditional LSTM-based recommender systems do not model uncertainty since they perform deterministic predictions. Moreover, those recommender models exhibit poor generalization on small datasets, and poor-handle cold-start and data sparsity problems. To overcome those limitations, this paper presents an LSTM-based recommender model that leverages an improved deep matrix factorization to accurately address the data sparsity problem. In addition, an enhanced variational inference coupled to the Evidence Lower Bound Optimization is applied on LSTM unit layers to perform uncertainty-aware predictions. Thereafter, latent vectors obtained from LSTM networks are effectively involved in the sequential recommendation process. Experiments have been conducted on several real-world datasets to evaluate our proposal and the results show the proposed model presents significant performances compared to state-of-the-art models.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1109/access.2025.3570636
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.