Personalized Ranking on Cascading Behavior Graphs for Accurate Multi-Behavior Recommendation

• URL: http://arxiv.org/abs/2502.11335v1
• Date: Mon, 17 Feb 2025 01:13:45 GMT
• Title: Personalized Ranking on Cascading Behavior Graphs for Accurate Multi-Behavior Recommendation
• Abstract summary: Multi-behavior recommendation predicts items a user may purchase by analyzing diverse behaviors like viewing, adding to a cart, and purchasing.<n>Existing methods fall into two categories: representation learning and graph ranking.<n>We propose CascadingRank, a novel graph ranking method for multi-behavior recommendation.
• Score: 4.130591018565202
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-behavior recommendation predicts items a user may purchase by analyzing diverse behaviors like viewing, adding to a cart, and purchasing. Existing methods fall into two categories: representation learning and graph ranking. Representation learning generates user and item embeddings to capture latent interaction patterns, leveraging multi-behavior properties for better generalization. However, these methods often suffer from over-smoothing and bias toward frequent interactions, limiting their expressiveness. Graph ranking methods, on the other hand, directly compute personalized ranking scores, capturing user preferences more effectively. Despite their potential, graph ranking approaches have been primarily explored in single-behavior settings and remain underutilized for multi-behavior recommendation. In this paper, we propose CascadingRank, a novel graph ranking method for multi-behavior recommendation. It models the natural sequence of user behaviors (e.g., viewing, adding to cart, and purchasing) through a cascading behavior graph. An iterative algorithm computes ranking scores, ensuring smoothness, query fitting, and cascading alignment. Experiments on three real-world datasets demonstrate that CascadingRank outperforms state-of-the-art methods, with up to 9.56% and 7.16% improvements in HR@10 and NDCG@10, respectively. Furthermore, we provide theoretical analysis highlighting its effectiveness, convergence, and scalability, showcasing the advantages of graph ranking in multi-behavior recommendation.

Related papers

• An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation [50.09718257952108]
  Sequentialsolv has increasingly shifted toward generative recommenders that combine sequential patterns with semantic item information.<n>These methods are often evaluated on a small set of widely used benchmarks, raising a key question: do these benchmarks actually require the advanced modeling capabilities that modern generative recommenders claim to provide?<n>We conduct a benchmark audit with an intentionally simple graph. Starting from only the last one or two items, it retrieves candidates from a few-hop item-transition graph and ranks them by item-feature similarity.
  arXiv  Detail & Related papers  (2026-05-08T02:00:11Z)
• Hierarchical Graph Information Bottleneck for Multi-Behavior Recommendation [31.495904374599533]
  We propose a novel model-agnostic Hierarchical Graph Information Bottleneck (HGIB) framework for multi-behavior recommendation.<n>Our framework optimize the learning of compact yet sufficient representations that preserve essential information for target behavior prediction.<n>We conduct comprehensive experiments on three real-world public datasets, which demonstrate the superior effectiveness of our framework.
  arXiv  Detail & Related papers  (2025-07-21T08:53:49Z)
• Graph Contrastive Learning on Multi-label Classification for Recommendations [34.785207813971134]
  We propose a model called Graph Contrastive Learning for Multi-label Classification (MCGCL)<n>MCGCL leverages contrastive learning to enhance recommendation effectiveness.<n>We assess the performance using real-world datasets from Amazon Reviews in multi-label classification tasks.
  arXiv  Detail & Related papers  (2025-01-13T00:29:29Z)
• HEC-GCN: Hypergraph Enhanced Cascading Graph Convolution Network for Multi-Behavior Recommendation [41.65320959602054]
  We propose a novel approach named Hypergraph Enhanced Cascading Graph Convolution Network for multi-behavior recommendation (HEC-GCN)<n>To be specific, we first explore both fine- and coarse-grained correlations among users or items of each behavior by simultaneously modeling the behavior-specific interaction graph and its corresponding hypergraph in a cascaded manner.
  arXiv  Detail & Related papers  (2024-12-19T02:57:02Z)
• Behavior Pattern Mining-based Multi-Behavior Recommendation [22.514959709811446]
  We introduce Behavior Pattern mining-based Multi-behavior Recommendation (BPMR) BPMR extensively investigates the diverse interaction patterns between users and items, utilizing these patterns as features for making recommendations. Our experimental evaluation on three real-world datasets demonstrates that BPMR significantly outperforms existing state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-08-22T06:41:59Z)
• Instant Representation Learning for Recommendation over Large Dynamic Graphs [29.41179019520622]
  We propose SUPA, a novel graph neural network for dynamic multiplex heterogeneous graphs. For each new edge, SUPA samples an influenced subgraph, updates the representations of the two interactive nodes, and propagates the interaction information to the sampled subgraph. To train SUPA incrementally online, we propose InsLearn, an efficient workflow for single-pass training of large dynamic graphs.
  arXiv  Detail & Related papers  (2023-05-22T15:36:10Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Boosting the Learning for Ranking Patterns [6.142272540492935]
  This paper formulates the problem of learning pattern ranking functions as a multi-criteria decision making problem. Our approach aggregates different interestingness measures into a single weighted linear ranking function, using an interactive learning procedure. Experiments conducted on well-known datasets show that our approach significantly reduces the running time and returns precise pattern ranking.
  arXiv  Detail & Related papers  (2022-03-05T10:22:44Z)
• Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation [56.12499090935242]
  This work proposes a Knowledge-Enhanced Hierarchical Graph Transformer Network (KHGT) to investigate multi-typed interactive patterns between users and items in recommender systems. KHGT is built upon a graph-structured neural architecture to capture type-specific behavior characteristics. We show that KHGT consistently outperforms many state-of-the-art recommendation methods across various evaluation settings.
  arXiv  Detail & Related papers  (2021-10-08T09:44:00Z)
• Hyper Meta-Path Contrastive Learning for Multi-Behavior Recommendation [61.114580368455236]
  User purchasing prediction with multi-behavior information remains a challenging problem for current recommendation systems. We propose the concept of hyper meta-path to construct hyper meta-paths or hyper meta-graphs to explicitly illustrate the dependencies among different behaviors of a user. Thanks to the recent success of graph contrastive learning, we leverage it to learn embeddings of user behavior patterns adaptively instead of assigning a fixed scheme to understand the dependencies among different behaviors.
  arXiv  Detail & Related papers  (2021-09-07T04:28:09Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• Dynamic Graph Collaborative Filtering [64.87765663208927]
  Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data. Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations. Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
  arXiv  Detail & Related papers  (2021-01-08T04:16:24Z)
• Learning Diverse Fashion Collocation by Neural Graph Filtering [78.9188246136867]
  We propose a novel fashion collocation framework, Neural Graph Filtering, that models a flexible set of fashion items via a graph neural network. By applying symmetric operations on the edge vectors, this framework allows varying numbers of inputs/outputs and is invariant to their ordering. We evaluate the proposed approach on three popular benchmarks, the Polyvore dataset, the Polyvore-D dataset, and our reorganized Amazon Fashion dataset.
  arXiv  Detail & Related papers  (2020-03-11T16:17:08Z)

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.