Large Language Model Empowered Logical Relations Mining for Personalized Recommendation
In personalized recommendations, users often express complex logical requirements, involving the intersection of multiple preferences over heterogeneous graphs containing users, items, and external knowledge. Existing methods for mining logical relations face challenges in scalability and often overlook the semantics of relations, which are essential for uncovering higher order connections and addressing incomplete relations within the graph. To tackle these challenges, we propose RelRec, a novel approach that leverages large language models (LLMs) to mine logical relations and satisfy users' logical requirements in personalized recommendation tasks. Specifically, the framework begins with the extraction of user-driven logical relations, followed by a rule-based logical relation mining module that integrates both semantic and structural information using the capabilities of LLMs. By uncovering higher-order logical relations, our approach effectively refines the heterogeneous graph for reasoning capacity and recommendation accuracy. Extensive experiments on real-world datasets demonstrate that RelRec significantly outperforms existing methods.
Authors
- Carl Yang (ORCID: https://orcid.org/0000-0001-9145-4531)
- Guofang Ma (ORCID: https://orcid.org/0000-0002-9076-7250)
- Yanchao Tan (ORCID: https://orcid.org/0000-0002-3526-6859)
- W. Shao
Institutions
- Emory University (US)
- Zhejiang Gongshang University (CN)
- Fuzhou University (CN)
Publication Details
- Published
- 2025-05-08
- DOI
- https://doi.org/10.1145/3701716.3715574
- Primary Topic
- Recommender Systems and Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00