Temporal attention graph-optimized networks for sequential recommendation

Sequential recommendation systems are pivotal in enhancing user experience by providing personalized suggestions based on historical data. However, traditional models often disregard the temporal dynamics of user-item interactions, which can lead to static and outdated recommendations that fail to r...

Full description

Saved in:
Bibliographic Details
Main Author: Pathak, Siddhant
Other Authors: Ke Yiping, Kelly
Format: Final Year Project
Language:English
Published: Nanyang Technological University 2024
Subjects:
Online Access:https://hdl.handle.net/10356/175250
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-175250
record_format dspace
spelling sg-ntu-dr.10356-1752502024-04-26T15:42:11Z Temporal attention graph-optimized networks for sequential recommendation Pathak, Siddhant Ke Yiping, Kelly School of Computer Science and Engineering ypke@ntu.edu.sg Computer and Information Science Graph neural networks Recommendation systems Sequential recommendation Sequential recommendation systems are pivotal in enhancing user experience by providing personalized suggestions based on historical data. However, traditional models often disregard the temporal dynamics of user-item interactions, which can lead to static and outdated recommendations that fail to reflect current user preferences. To address this critical gap, this study introduces a novel architecture known as Temporal Attention Graph-Optimized Networks (TAGON), which integrates Graph Neural Networks (GNNs) with an innovative temporal attention mechanism. TAGON is designed to dynamically adapt to both the sequential and temporal aspects of user interactions, thereby offering more accurate and relevant recommendations. This research extends the capabilities of GNNs by incorporating a temporal dimension, allowing the system to track and predict the evolving preferences of users over time. The effectiveness of TAGON is rigorously tested against established benchmarks on several real-world datasets, demonstrating superior performance in terms of precision, recall, and user satisfaction. The results indicate that incorporating temporal dynamics into the recommendation process significantly improves the relevance and timeliness of the suggestions offered to users. This study not only validates the importance of temporal considerations in modeling user- item interactions but also sets a new standard for the design of adaptive recommendation systems in continuously evolving digital environments. Overall, TAGON represents a significant advancement in the field of recommendation systems, promising enhanced user engagement through more intelligent and context-aware recommendations. Bachelor's degree 2024-04-23T01:31:59Z 2024-04-23T01:31:59Z 2024 Final Year Project (FYP) Pathak, S. (2024). Temporal attention graph-optimized networks for sequential recommendation. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/175250 https://hdl.handle.net/10356/175250 en application/pdf application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Computer and Information Science
Graph neural networks
Recommendation systems
Sequential recommendation
spellingShingle Computer and Information Science
Graph neural networks
Recommendation systems
Sequential recommendation
Pathak, Siddhant
Temporal attention graph-optimized networks for sequential recommendation
description Sequential recommendation systems are pivotal in enhancing user experience by providing personalized suggestions based on historical data. However, traditional models often disregard the temporal dynamics of user-item interactions, which can lead to static and outdated recommendations that fail to reflect current user preferences. To address this critical gap, this study introduces a novel architecture known as Temporal Attention Graph-Optimized Networks (TAGON), which integrates Graph Neural Networks (GNNs) with an innovative temporal attention mechanism. TAGON is designed to dynamically adapt to both the sequential and temporal aspects of user interactions, thereby offering more accurate and relevant recommendations. This research extends the capabilities of GNNs by incorporating a temporal dimension, allowing the system to track and predict the evolving preferences of users over time. The effectiveness of TAGON is rigorously tested against established benchmarks on several real-world datasets, demonstrating superior performance in terms of precision, recall, and user satisfaction. The results indicate that incorporating temporal dynamics into the recommendation process significantly improves the relevance and timeliness of the suggestions offered to users. This study not only validates the importance of temporal considerations in modeling user- item interactions but also sets a new standard for the design of adaptive recommendation systems in continuously evolving digital environments. Overall, TAGON represents a significant advancement in the field of recommendation systems, promising enhanced user engagement through more intelligent and context-aware recommendations.
author2 Ke Yiping, Kelly
author_facet Ke Yiping, Kelly
Pathak, Siddhant
format Final Year Project
author Pathak, Siddhant
author_sort Pathak, Siddhant
title Temporal attention graph-optimized networks for sequential recommendation
title_short Temporal attention graph-optimized networks for sequential recommendation
title_full Temporal attention graph-optimized networks for sequential recommendation
title_fullStr Temporal attention graph-optimized networks for sequential recommendation
title_full_unstemmed Temporal attention graph-optimized networks for sequential recommendation
title_sort temporal attention graph-optimized networks for sequential recommendation
publisher Nanyang Technological University
publishDate 2024
url https://hdl.handle.net/10356/175250
_version_ 1800916224742260736