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

Huilin Chen 0002

dblp:49/3704-2 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
0000-0002-5323-0198ORCID · verified

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

Databases, data management, data science and information retrieval · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
6 papers
Recommender systems · 93% Data integration and cleaning · 7%
Artificial intelligence
3 papers
Efficient and distributed learning · 67% Representation and self-supervised learning · 20% Trustworthy machine learning · 13%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
multimodal recommendation
2.232025
I3-MRec: Invariant Learning with Information Bottleneck for Incomplete Modality Recommendation · ACM Multimedia 2025
Disentangled Multimodal Representation Learning for Recommendation · IEEE Trans. Multim. 2023
Semantic-Guided Feature Distillation for Multimodal Recommendation · ACM Multimedia 2023
Recommender systems
news recommendation
1.012026
Modeling Stage-wise Evolution of User Interests for News Recommendation · WWW 2026
Recommender systems
user interest modeling
1.012026
Modeling Stage-wise Evolution of User Interests for News Recommendation · WWW 2026
Recommender systems
explainable recommendation
0.912025
Understanding Before Recommendation: Semantic Aspect-Aware Review Exploitation via Large Language Models · ACM Trans. Inf. Syst. 2025
Recommender systems › multimodal recommendation
missing-modality recommendation
0.912025
I3-MRec: Invariant Learning with Information Bottleneck for Incomplete Modality Recommendation · ACM Multimedia 2025
Recommender systems
review-based recommendation
0.912025
Understanding Before Recommendation: Semantic Aspect-Aware Review Exploitation via Large Language Models · ACM Trans. Inf. Syst. 2025
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
feature distillation
0.712023
Semantic-Guided Feature Distillation for Multimodal Recommendation · ACM Multimedia 2023
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.712023
Semantic-Guided Feature Distillation for Multimodal Recommendation · ACM Multimedia 2023
Recommender systems › trustworthy recommendation
privacy-preserving recommendation
0.612022
Privacy-Preserving Synthetic Data Generation for Recommendation Systems · SIGIR 2022
Data integration and cleaning › data generation
synthetic data generation
0.612022
Privacy-Preserving Synthetic Data Generation for Recommendation Systems · SIGIR 2022
Privacy and data protection › privacy evaluation
privacy-utility tradeoff
0.612022
Privacy-Preserving Synthetic Data Generation for Recommendation Systems · SIGIR 2022
Privacy and data protection › differential privacy
synthetic data generation
0.612022
Privacy-Preserving Synthetic Data Generation for Recommendation Systems · SIGIR 2022
Machine learning › Trustworthy machine learning › out-of-distribution generalization
invariant learning
0.312025
I3-MRec: Invariant Learning with Information Bottleneck for Incomplete Modality Recommendation · ACM Multimedia 2025
Recommender systems › graph-based recommendation
graph neural network recommendation
0.312025
Understanding Before Recommendation: Semantic Aspect-Aware Review Exploitation via Large Language Models · ACM Trans. Inf. Syst. 2025
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.212023
Disentangled Multimodal Representation Learning for Recommendation · IEEE Trans. Multim. 2023
Machine learning › Representation and self-supervised learning
multimodal representation learning
0.212023
Semantic-Guided Feature Distillation for Multimodal Recommendation · ACM Multimedia 2023

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

missing-aware fusion · 1.7invariant risk minimization · 1.7information bottleneck · 1.7self-attention · 1.0graph neural network · 1.0LSTM · 1.0sentiment analysis · 0.9large language model · 0.9graph convolution network · 0.9chain-based prompting · 0.9teacher-student framework · 0.7response-based distillation · 0.7multimodal attention mechanism · 0.7feature-based distillation · 0.7disentangled representation · 0.7synthetic data generation · 0.6privacy preference modeling · 0.6
YearPublicationVenuePosition
2026 Modeling Stage-wise Evolution of User Interests for News Recommendation
abstract
Personalized news recommendation is highly time-sensitive, as user interests are often driven by emerging events, trending topics, and shifting real-world contexts. These dynamics make it essential to model not only users' long-term preferences, which reflect stable reading habits and high-order collaborative patterns, but also their short-term, context-dependent interests that change rapidly over time. However, most existing approaches rely on a single static interaction graph, which struggles to capture both long-term preference patterns and short-term interest changes as user behavior evolves. To address this challenge, we propose a unified framework that learns user preferences from both global and local temporal perspectives. A global preference modeling component captures long-term collaborative signals from the overall interaction graph, while a local preference modeling component partitions historical interactions into stage-wise temporal subgraphs to represent short-term dynamics. Within this module, an LSTM branch models the progressive evolution of recent interests, and a self-attention branch captures long-range temporal dependencies. Extensive experiments on two large-scale real-world datasets show that our approach consistently outperforms strong baselines and delivers fresher and more relevant recommendations across diverse user behaviors and temporal settings.
Zhiyong Cheng 0001, Yike Jin, Huilin Chen 0002, Zhangling Duan, Meng Wang 0001
WWW4
2025 I3-MRec: Invariant Learning with Information Bottleneck for Incomplete Modality Recommendation
abstract
Multimodal recommender systems (MRS) improve recommendation performance by integrating complementary semantic information from multiple modalities. However, the assumption of complete multimodality rarely holds in practice due to missing images and incomplete descriptions, hindering model robustness and generalization. To address these challenges, we introduce a novel method called I 3-MRec, which uses Invairant learning with Information bottleneck principle for Incomplete Modality Recommendation. To achieve robust performance in missing modality scenarios, I 3-MRec enforces two pivotal properties: (i) cross-modal preference invariance, ensuring consistent user preference modeling across varying modality environments, and (ii) compact yet effective multimodal representation, as modality information becomes unreliable in such scenarios, reducing the dependence on modality-specific information is particularly important. By treating each modality as a distinct semantic environment, I 3-MRec employs invariant risk minimization (IRM) to learn preference-oriented representations. In parallel, a missing-aware fusion module is developed to explicitly simulate modality-missing scenarios. Built upon the Information Bottleneck (IB) principle, the module aims to preserve essential user preference signals across these scenarios while effectively compressing modality-specific information. Extensive experiments conducted on three real-world datasets demonstrate that I 3-MRec consistently outperforms existing state-of-the-art MRS methods across various modality-missing scenarios, highlighting its effectiveness and robustness in practical applications.
Huilin Chen 0002, Miaomiao Cai 0001, Fan Liu 0008, Zhiyong Cheng 0001, Richang Hong, Meng Wang 0001
ACM Multimedia1
2025 Understanding Before Recommendation: Semantic Aspect-Aware Review Exploitation via Large Language Models
abstract
Recommendation systems harness user–item interactions like clicks and reviews to learn their representations. Previous studies improve recommendation accuracy and interpretability by modeling user preferences across various aspects and intents. However, the aspects and intents are inferred directly from user reviews or behavior patterns, suffering from the data noise and the data sparsity problem. Furthermore, it is difficult to understand the reasons behind recommendations due to the challenges of interpreting implicit aspects and intents. To address these constraints, we harness the sentiment analysis capabilities of Large Language Models (LLMs) to enhance the accuracy and interpretability of the conventional recommendation methods. Specifically, inspired by the deep semantic understanding offered by LLMs, we introduce a chain-based prompting strategy to uncover semantic aspect-aware interactions, which provide clearer insights into user behaviors at a fine-grained semantic level. To incorporate the rich interactions of various aspects, we propose the simple yet effective Semantic Aspect-Based Graph Convolution Network (SAGCN). By performing graph convolutions on multiple semantic aspect graphs, SAGCN efficiently combines embeddings across multiple semantic aspects for final user and item representations. The effectiveness of the SAGCN was evaluated on four publicly available datasets through extensive experiments, which revealed that it outperforms all other competitors. Furthermore, interpretability analysis experiments were conducted to demonstrate the interpretability of incorporating semantic aspects into the model.
Fan Liu 0008, Huilin Chen 0002, Zhiyong Cheng 0001, Liqiang Nie, Mohan Kankanhalli
ACM Trans. Inf. Syst.3
2023 Semantic-Guided Feature Distillation for Multimodal Recommendation
abstract
Multimodal recommendation exploits the rich multimodal information associated with users or items to enhance the representation learning for better performance. In these methods, end-to-end feature extractors (e.g., shallow/deep neural networks) are often adopted to tailor the generic multimodal features that are extracted from raw data by pre-trained models for recommendation. However, compact extractors, such as shallow neural networks, may find it challenging to extract effective information from complex and high-dimensional generic modality features. Conversely, DNN-based extractors may encounter the data sparsity problem in recommendation. To address this problem, we propose a novel model-agnostic approach called Semantic-guided Feature Distillation (SGFD), which employs a teacher-student framework to extract feature for multimodal recommendation. The teacher model first extracts rich modality features from the generic modality feature by considering both the semantic information of items and the complementary information of multiple modalities. SGFD then utilizes response-based and feature-based distillation loss to effectively transfer the knowledge encoded in the teacher model to the student model. To evaluate the effectiveness of our SGFD, we integrate SGFD into three backbone multimodal recommendation models. Extensive experiments on three public real-world datasets demonstrate that SGFD-enhanced models can achieve substantial improvement over their counterparts.
Fan Liu 0008, Huilin Chen 0002, Zhiyong Cheng 0001, Liqiang Nie, Mohan Kankanhalli
ACM Multimedia2
2023 Disentangled Multimodal Representation Learning for Recommendation
abstract
Many multimodal recommender systems have been proposed to exploit the rich side information associated with users or items (e.g., user reviews and item images) for learning better user and item representations to improve the recommendation performance. Studies from psychology show that users have individual differences in the utilization of various modalities for organizing information. Therefore, for a certain factor of an item (such asappearanceorquality), the features of different modalities are of varying importance to a user. However, existing methods ignore the fact that different modalities contribute differently towards a user's preference on various factors of an item. In light of this, in this paper, we propose a novelDisentangled Multimodal Representation Learning(DMRL) recommendation model, which can capture users' attention to different modalities on each factor in user preference modeling. In particular, we employ a disentangled representation technique to ensure the features of different factors in each modality are independent of each other. A multimodal attention mechanism is then designed to capture users' modality preference for each factor. Based on the estimated weights obtained by the attention mechanism, we make recommendations by combining the preference scores of a user's preferences to each factor of the target item over different modalities. Extensive evaluation on five real-world datasets demonstrate the superiority of our method compared with existing methods.
Fan Liu 0008, Huilin Chen 0002, Zhiyong Cheng 0001, Anan Liu, Liqiang Nie, Mohan Kankanhalli
IEEE Trans. Multim.2
2022 Privacy-Preserving Synthetic Data Generation for Recommendation Systems
abstract
Recommendation systems make predictions chiefly based on users' historical interaction data (e.g., items previously clicked or purchased). There is a risk of privacy leakage when collecting the users' behavior data for building the recommendation model. However, existing privacy-preserving solutions are designed for tackling the privacy issue only during the model training [32] and results collection [40] phases. The problem of privacy leakage still exists when directly sharing the private user interaction data with organizations or releasing them to the public. To address this problem, in this paper, we present a User Privacy Controllable Synthetic Data Generation model (short for UPC-SDG), which generates synthetic interaction data for users based on their privacy preferences. The generation model aims to provide certain privacy guarantees while maximizing the utility of the generated synthetic data at both data level and item level. Specifically, at the data level, we design a selection module that selects those items that contribute less to a user's preferences from the user's interaction data. At the item level, a synthetic data generation module is proposed to generate a synthetic item corresponding to the selected item based on the user's preferences. Furthermore, we also present a privacy-utility trade-off strategy to balance the privacy and utility of the synthetic data. Extensive experiments and ablation studies have been conducted on three publicly accessible datasets to justify our method, demonstrating its effectiveness in generating synthetic data under users' privacy preferences.
Fan Liu 0008, Zhiyong Cheng 0001, Huilin Chen 0002, Yinwei Wei, Liqiang Nie, Mohan Kankanhalli
SIGIR3