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

Kai-Huang Lai

dblp:371/4911 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 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
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
explainable recommendation
0.812024
Knowledge-Aware Explainable Reciprocal Recommendation · AAAI 2024
Recommender systems › sequential recommendation › generative sequential recommendation
LLM-based sequential recommendation
0.812024
RecCoder: Reformulating Sequential Recommendation as Large Language Model-Based Code Completion · ICDM 2024
Recommender systems › user recommendation
reciprocal recommendation
0.812024
Knowledge-Aware Explainable Reciprocal Recommendation · AAAI 2024
Recommender systems
sequential recommendation
0.812024
RecCoder: Reformulating Sequential Recommendation as Large Language Model-Based Code Completion · ICDM 2024
Machine learning › Graph learning › heterogeneous graph learning
metapath-based learning
0.212024
Knowledge-Aware Explainable Reciprocal Recommendation · AAAI 2024

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

metapath modeling · 1.5attention mechanism · 1.5large language model · 0.8fine-tuning · 0.8
YearPublicationVenuePosition
2026 TipRec: Time-interval-aware prompting for Recommendation with large language models
Pei-Yuan Lai, Zhen-Wei Huang, De-Zhang Liao, Kai-Huang Lai, Chang-Dong Wang 0001
Knowl. Based Syst.4
2024 Knowledge-Aware Explainable Reciprocal Recommendation
abstract
Reciprocal recommender systems (RRS) have been widely used in online platforms such as online dating and recruitment. They can simultaneously fulfill the needs of both parties involved in the recommendation process. Due to the inherent nature of the task, interaction data is relatively sparse compared to other recommendation tasks. Existing works mainly address this issue through content-based recommendation methods. However, these methods often implicitly model textual information from a unified perspective, making it challenging to capture the distinct intentions held by each party, which further leads to limited performance and the lack of interpretability. In this paper, we propose a Knowledge-Aware Explainable Reciprocal Recommender System (KAERR), which models metapaths between two parties independently, considering their respective perspectives and requirements. Various metapaths are fused using an attention-based mechanism, where the attention weights unveil dual-perspective preferences and provide recommendation explanations for both parties. Extensive experiments on two real-world datasets from diverse scenarios demonstrate that the proposed model outperforms state-of-the-art baselines, while also delivering compelling reasons for recommendations to both parties.
Kai-Huang Lai, Zhe-Rui Yang, Pei-Yuan Lai, Chang-Dong Wang 0001, Mohsen Guizani, Min Chen 0003
AAAI1
2024 RecCoder: Reformulating Sequential Recommendation as Large Language Model-Based Code Completion
abstract
In the evolving landscape of sequential recommendation systems, the application of Large Language Models (LLMs) is increasingly prominent. However, current attempts typically utilize general-purpose LLMs, which present a mismatch in capability and a large semantic gap relative to the specialized needs of recommendation tasks. To tackle these issues, we introduce RecCoder, an innovative model that reformulates sequential recommendation as a code completion task. This approach leverages the superior reasoning capability of code LLMs as a backbone, aligning well with the requirements of recommendation systems. To bridge the semantic gap, RecCoder creates extra tokens for each item and employs item content to initialize token embeddings. Furthermore, we have developed a suite of Semantic Adaptation Fine-tuning tasks, tailored to enhance the model's acquisition of both content and collaborative semantic information, thus aligning the model's intrinsic capabilities with the unique demands of recommendation tasks. Through extensive testing on three public datasets, RecCoder has shown remarkable improvements over existing models in terms of recommendation accuracy and efficiency. This success highlights the substantial yet previously underexplored potential of code LLMs in improving recommendation accuracy and efficiency, suggesting a promising new direction for future research in this area. The implementation code is accessible at https://github.com/AllminerLab/Code-for-RecCoder-master.
Kai-Huang Lai, Wudong Xi, Xing-Xing Xing, Chang-Dong Wang 0001, Min Chen 0003, Mohsen Guizani
ICDM1