Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ru-Bin Li

dblp:398/2379 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0005-6041-4541ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Artificial intelligence
2 papers
Graph learning · 85% Language models and text generation · 15%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
large language model-based recommendation
0.912025
CL3M-Rec: Contrastive Learning Enhanced LLMs for Recommendation · ICDM 2025
Machine learning › Graph learning
dynamic graph
0.812024
Periodic Prompt on Dynamic Heterogeneous Graph for Next Basket Recommendation · ICDM 2024
Machine learning › Graph learning
heterogeneous graph
0.812024
Periodic Prompt on Dynamic Heterogeneous Graph for Next Basket Recommendation · ICDM 2024
Recommender systems › session-based recommendation
next-basket recommendation
0.812024
Periodic Prompt on Dynamic Heterogeneous Graph for Next Basket Recommendation · ICDM 2024
Recommender systems
sequential recommendation
0.812024
Periodic Prompt on Dynamic Heterogeneous Graph for Next Basket Recommendation · ICDM 2024
Natural language and speech › Language models and text generation › prompting
prompt construction
0.312025
CL3M-Rec: Contrastive Learning Enhanced LLMs for Recommendation · ICDM 2025

Methods — techniques the papers use, named apart from their topics

prompt construction · 1.7large language model · 1.7contrastive learning · 1.7prompt learning · 1.5heterogeneous graph neural network · 1.5
YearPublicationVenuePosition
2025 CL3M-Rec: Contrastive Learning Enhanced LLMs for Recommendation
abstract
In recent years, Large Language Models (LLMs) have gained increasing attention in personalized recommendation systems due to their strong capabilities to understand contextual and semantic information. However, most existing LLM-based recommendation methods primarily rely on textual features, often neglecting the unique structural information embedded in user and item IDs, which are critical for capturing personalized preferences. To bridge this gap, we propose a novel method called CL 3M - Rec, which enhances the semantic representation of user and item IDs through Contrastive Learning (CL) and optimizes LLM recommendation performance via prompt construction. By effectively integrating structured ID information with textual semantics, our approach enables the LLMs to better model individual user interests and improve personalized prediction. Experiments on four public datasets demonstrate that CL3M-Rec consistently outperforms existing LLM-based and CL-based recommendation approaches, achieving superior predictive accuracy and robust generalization across diverse recommendation scenarios. The code of our method is available at https://github.com/Lewis44zhou/CL-3M-Rec.
Yu-Xuan Zhou, Ru-Bin Li, Zhe Xuanyuan, Pei-Yuan Lai, Chang-Dong Wang 0001
ICDM2
2024 Periodic Prompt on Dynamic Heterogeneous Graph for Next Basket Recommendation
abstract
In next basket recommendation, baskets are usually formed through a large number of user interactions with items in the early stage. In general, the existing methods for next basket recommendation primarily focus on historical purchase behavior of users, assuming that user purchase interests are static, and overlook the dynamic and diverse changes in user purchase interests. In order to fully capture dynamic user interests and provide users with more diverse recommendations, we propose our method, Dynamic Heterogeneous Graph Prompt (DHGP), for next basket recommendation. By constructing a dynamic heterogeneous graph, we can adequately consider the influence of various interactive behaviors on the user's baskets at different times. Furthermore, we introduce a periodic dynamic heterogeneous prompt strategy to capture the interest directions between baskets from different users and provide users with more diverse interest directions. Extensive experimental validation on six real world datasets demonstrates that our method shows strong applicability across datasets under various conditions and outperforms several state-of-the-art recommendation methods. To the best of our knowledge, DHGP is the first next basket recommendation method that effectively combines dynamic and heterogeneous information. The implementation code is accessible at https://github.com/AllminerLab.
Ru-Bin Li, Man-Sheng Chen, Xin-Yu Ding, Chang-Dong Wang 0001, Sihong Xie, Shuangyin Liu, Min Chen 0003, Mohsen Guizani
ICDM1