HCGR: Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation

• URL: http://arxiv.org/abs/2107.05366v1
• Date: Tue, 6 Jul 2021 01:46:16 GMT
• Title: HCGR: Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation
• Authors: Naicheng Guo and Xiaolei Liu and Shaoshuai Li and Qiongxu Ma and Yunan Zhao and Bing Han and Lin Zheng and Kaixin Gao and Xiaobo Guo
• Abstract summary: Session-based recommendation (SBR) learns users' preferences by capturing the short-term and sequential patterns from the evolution of user behaviors. We present a hyperbolic contrastive graph recommender (HCGR) to adequately capture the coherence and hierarchical representations of the items.
• Score: 5.942131706372327
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Session-based recommendation (SBR) learns users' preferences by capturing the short-term and sequential patterns from the evolution of user behaviors. Among the studies in the SBR field, graph-based approaches are a relatively powerful kind of way, which generally extract item information by message aggregation under Euclidean space. However, such methods can't effectively extract the hierarchical information contained among consecutive items in a session, which is critical to represent users' preferences. In this paper, we present a hyperbolic contrastive graph recommender (HCGR), a principled session-based recommendation framework involving Lorentz hyperbolic space to adequately capture the coherence and hierarchical representations of the items. Within this framework, we design a novel adaptive hyperbolic attention computation to aggregate the graph message of each user's preference in a session-based behavior sequence. In addition, contrastive learning is leveraged to optimize the item representation by considering the geodesic distance between positive and negative samples in hyperbolic space. Extensive experiments on four real-world datasets demonstrate that HCGR consistently outperforms state-of-the-art baselines by 0.43$\%$-28.84$\%$ in terms of $HitRate$, $NDCG$ and $MRR$.

Related papers

• APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation [86.29366168836141]
  We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR) APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems. As a generic framework, APGL4SR can outperform other baselines with significant margins.
  arXiv  Detail & Related papers  (2023-11-06T01:33:24Z)
• Graph-based Alignment and Uniformity for Recommendation [45.40299300441636]
  Collaborative filtering-based recommender systems rely on learning representations for users and items to predict preferences accurately. We propose a novel approach, graph-based alignment and uniformity (GraphAU), that explicitly considers high-order connectivities in the user-item bipartite graph. Experiments on four datasets show that GraphAU significantly alleviates the sparsity issue and achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-08-18T04:33:36Z)
• GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendation [58.6450834556133]
  We propose graph contrastive learning to enhance item representations with complex associations from the global view. We extend the CapsNet module with the elaborately introduced target-attention mechanism to derive users' dynamic preferences. Our proposed GUESR could not only achieve significant improvements but also could be regarded as a general enhancement strategy.
  arXiv  Detail & Related papers  (2023-03-01T05:46:36Z)
• Time-aware Hyperbolic Graph Attention Network for Session-based Recommendation [58.748215444851226]
  Session-based Recommendation (SBR) is to predict users' next interested items based on their previous browsing sessions. We propose Time-aware Hyperbolic Graph Attention Network (TA-HGAT) to build a session-based recommendation model considering temporal information.
  arXiv  Detail & Related papers  (2023-01-10T04:16:09Z)
• Heterogeneous Information Crossing on Graphs for Session-based Recommender Systems [19.959021202757107]
  We propose a novel graph-based method, namely Heterogeneous Information Crossing on Graphs (HICG) HICG captures users' current interests with their long-term preferences by effectively crossing the heterogeneous information on the graphs. We also propose an enhanced version, named HICG-CL, which incorporates contrastive learning (CL) technique to enhance item representation ability.
  arXiv  Detail & Related papers  (2022-10-24T04:02:33Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Enhancing Sequential Recommendation with Graph Contrastive Learning [64.05023449355036]
  This paper proposes a novel sequential recommendation framework, namely Graph Contrastive Learning for Sequential Recommendation (GCL4SR) GCL4SR employs a Weighted Item Transition Graph (WITG), built based on interaction sequences of all users, to provide global context information for each interaction and weaken the noise information in the sequence data. Experiments on real-world datasets demonstrate that GCL4SR consistently outperforms state-of-the-art sequential recommendation methods.
  arXiv  Detail & Related papers  (2022-05-30T03:53:31Z)
• G$^3$SR: Global Graph Guided Session-based Recommendation [116.38098186755029]
  Session-based recommendation tries to make use of anonymous session data to deliver high-quality recommendation. G$3$SR (Global Graph Guided Session-based Recommendation) decomposes the session-based recommendation workflow into two steps. Experiments on two real-world benchmark datasets show remarkable and consistent improvements of the G$3$SR method over the state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-03-12T15:44:03Z)
• Improved Representation Learning for Session-based Recommendation [0.0]
  Session-based recommendation systems suggest relevant items to users by modeling user behavior and preferences using short-term anonymous sessions. Existing methods leverage Graph Neural Networks (GNNs) that propagate and aggregate information from neighboring nodes. We propose using a Transformer in combination with a target attentive GNN, which allows richer Representation Learning.
  arXiv  Detail & Related papers  (2021-07-04T00:57:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.