Score: 1

HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation

Published: May 25, 2025 | arXiv ID: 2505.19020v1

By: Jiawei Xue , Zhen Yang , Haitao Lin and more

BigTech Affiliations: Alibaba

Potential Business Impact:

Finds better stuff you'll like.

Business Areas:
Semantic Search Internet Services

Graph Contrastive Learning (GCL), which fuses graph neural networks with contrastive learning, has evolved as a pivotal tool in user-item recommendations. While promising, existing GCL methods often lack explicit modeling of hierarchical item structures, which represent item similarities across varying resolutions. Such hierarchical item structures are ubiquitous in various items (e.g., online products and local businesses), and reflect their inherent organizational properties that serve as critical signals for enhancing recommendation accuracy. In this paper, we propose Hierarchical Graph Contrastive Learning (HGCL), a novel GCL method that incorporates hierarchical item structures for user-item recommendations. First, HGCL pre-trains a GCL module using cross-layer contrastive learning to obtain user and item representations. Second, HGCL employs a representation compression and clustering method to construct a two-hierarchy user-item bipartite graph. Ultimately, HGCL fine-tunes user and item representations by learning on the hierarchical graph, and then provides recommendations based on user-item interaction scores. Experiments on three widely adopted benchmark datasets ranging from 70K to 382K nodes confirm the superior performance of HGCL over existing baseline models, highlighting the contribution of hierarchical item structures in enhancing GCL methods for recommendation tasks.

Country of Origin
🇨🇳 China

Page Count
13 pages

Category
Computer Science:
Information Retrieval