The reviewed record of science sign in
Pith

arxiv: 2505.05989 · v1 · pith:S4RBE6VR · submitted 2025-05-09 · cs.IR · cs.LG

Modeling Multi-Hop Semantic Paths for Recommendation in Heterogeneous Information Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:S4RBE6VRrecord.jsonopen to challenge →

classification cs.IR cs.LG
keywords modelingpathrecommendationheterogeneousinformationmulti-hoppathsmethod
0
0 comments X
read the original abstract

This study focuses on the problem of path modeling in heterogeneous information networks and proposes a multi-hop path-aware recommendation framework. The method centers on multi-hop paths composed of various types of entities and relations. It models user preferences through three stages: path selection, semantic representation, and attention-based fusion. In the path selection stage, a path filtering mechanism is introduced to remove redundant and noisy information. In the representation learning stage, a sequential modeling structure is used to jointly encode entities and relations, preserving the semantic dependencies within paths. In the fusion stage, an attention mechanism assigns different weights to each path to generate a global user interest representation. Experiments conducted on real-world datasets such as Amazon-Book show that the proposed method significantly outperforms existing recommendation models across multiple evaluation metrics, including HR@10, Recall@10, and Precision@10. The results confirm the effectiveness of multi-hop paths in capturing high-order interaction semantics and demonstrate the expressive modeling capabilities of the framework in heterogeneous recommendation scenarios. This method provides both theoretical and practical value by integrating structural information modeling in heterogeneous networks with recommendation algorithm design. It offers a more expressive and flexible paradigm for learning user preferences in complex data environments.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.