Stage Evolving Graph Neural Network based Dynamic Recommendation with Life Cycles
- Publisher:
- Institute of Electrical and Electronics Engineers (IEEE)
- Publication Type:
- Conference Proceeding
- Citation:
- Proceedings of the International Joint Conference on Neural Networks, 2022, 2022-July, pp. 01-08
- Issue Date:
- 2022-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Stage_Evolving_Graph_Neural_Network_based_Dynamic_Recommendation_with_Life_Cycles.pdf | Published version | 2.62 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Existing methods of dynamic recommender systems usually build neural networks or collaborative filtering models according to the absolute timeline, which fails to consider the preferences of users or characteristics of products in their life cycles. With the rise of graph neural networks, researchers have recently proposed methods based on graph neural networks to solve the recommendation problem. However, such models do not consider evolving stages in their life cycles. In this paper, we study the dynamic recommendation problem and propose a novel model named Stage Evolving Graph Neural Network (SEGNN). SEGNN learns the life stage representation by the Gated Stage Attention Unit (GSAU) and then uses a fully connected layer as the rating score predictor. GSAU adopts two types of attention layers to learn the preferences of users and products within one coupled life stage and discover the preferences over life stages, respectively. GSAU also utilizes a memory mechanism to ensure that the evolutionary patterns are maintained in the final representations of users and products. Due to the lack of information caused by data sparsity, SEGNN designs a masked loss function to train the model. Extensive experiments are done on real-world datasets, and the experimental results show the effectiveness of our proposed model.
Please use this identifier to cite or link to this item: