Dynamic Recommendation Based on Graph Diffusion and Ebbinghaus Curve
- Publisher:
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Computational Social Systems, 2023, PP, (99)
- Issue Date:
- 2023-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Dynamic_Recommendation_Based_on_Graph_Diffusion_and_Ebbinghaus_Curve.pdf | Accepted version | 2.2 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Nowadays, many dynamic recommendations still suffer from the insufficiency of finding user online interest evolving patterns because of those complicated interactions. In general, each interaction is usually impacted by multiple underlying reasons, which needs us to open the “box” of each interaction instance instead of simply treating them as a pair-wise link. Besides, different users usually perform differently for their long-term and short-term tastes, leaving traditional sequential models far from personalized. In this article, we propose a novel recommendation model based on Graph Diffusion and Ebbinghaus Curve. Specifically, to explore the underline reasons for different interactions, we explore an underlying sub-graph for each interaction and find important reasoning paths within the sub-graph via a well-designed graph diffusion method. To capture users’ personalized strategies on long-term and short-term tastes, we are inspired by the Ebbinghaus Curve, which can naturally describe users’ memory patterns, and design an effective neural network to process users’ evolving behaviors. We conduct extensive experiments on four real-world datasets and the results further confirm the superiority of our model compared with existing state-of-the-art baselines.
Please use this identifier to cite or link to this item: