Author
Listed:
- Fan Yang
(School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China)
- Dunlu Peng
(School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China)
Abstract
The main goal of session-based recommendation (SBR) is to analyze the list of possible next interaction items through the user’s historical interaction sequence. The existing session recommendation models directly model the session sequence as a graph, and only consider the aggregation of neighbor items based on spatial structure information, ignoring the time information of items. The sparsity of interaction sequences also affects the accuracy of recommendation. This paper proposes a spatio-temporal contrastive heterogeneous graph attention network model (STC-HGAT). The session sequence is built as a spatial heterogeneous hypergraph, a latent Dirichlet allocation (LDA) algorithm is used to construct the category nodes of the items to enhance the contextual semantic information of the hypergraph, and the hypergraph attention network is employed to capture the spatial structure information of the session. The temporal heterogeneous graph is constructed to aggregate the temporal information of the item. Then, the spatial and temporal information are fused by sumpooling. Meanwhile, a modulation factor is added to the cross-entropy loss function to construct the adaptive weight (AW) loss function. Contrastive learning (CL) is used as an auxiliary task to further enhance the modeling, so as to alleviate the sparsity of data. A large number of experiments on real public datasets show that the STC-HGAT model proposed in this paper is superior to the baseline models in metrics such as P @ 20 and M R R @ 20 , improving the recommendation performance to a certain extent.
Suggested Citation
Fan Yang & Dunlu Peng, 2024.
"Spatio-Temporal Contrastive Heterogeneous Graph Attention Networks for Session-Based Recommendation,"
Mathematics, MDPI, vol. 12(8), pages 1-16, April.
Handle:
RePEc:gam:jmathe:v:12:y:2024:i:8:p:1193-:d:1376777
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:8:p:1193-:d:1376777. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.