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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Large Language Model Empowered Logical Relations Mining for Personalized Recommendation

Carl Yang, Guofang Ma, Yanchao Tan, W. Shao
Recommender Systems and Techniques
article

Large Language Model Empowered Logical Relations Mining for Personalized Recommendation

Carl Yang, Guofang Ma, Yanchao Tan, W. Shao
article en

Abstract

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.

Emory University (US), Zhejiang Gongshang University (CN), Fuzhou University (CN)
Openalex Percentile: Top 79%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.