Chuan He 0005

dblp:76/4276-5 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
0009-0001-2054-0974ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 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 2021Human-computer interaction and ubiquitous computing · 1 · 1 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
2 papers
Recommender systems · 100%
Artificial intelligence
1 paper
Generative modeling · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
variational autoencoder
1.012026
M²VAE: Multi-Modal Multi-View Variational Autoencoder for Cold-start Item Recommendation · AAAI 2026
Recommender systems › cold-start recommendation
cold-start item recommendation
1.012026
M²VAE: Multi-Modal Multi-View Variational Autoencoder for Cold-start Item Recommendation · AAAI 2026
Recommender systems › sequential recommendation › side information-enhanced sequential recommendation
multi-behavior sequential recommendation
0.912025
Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation · KDD (2) 2025
Recommender systems
sequential recommendation
0.912025
Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation · KDD (2) 2025

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

contrastive learning · 2.9mixture of experts · 2.0product-of-experts · 1.0product of experts · 1.0transformer · 0.9graph convolution · 0.9
YearPublicationVenuePosition
2026 M²VAE: Multi-Modal Multi-View Variational Autoencoder for Cold-start Item Recommendation
abstract
Cold-start item recommendation is a significant challenge in recommendation systems, particularly when new items are introduced without any historical interaction data. While existing methods leverage multi-modal content to alleviate the cold-start issue, they often neglect the inherent multi-view structure of modalities, namely the distinction between shared and modality-specific features. In this paper, we propose Multi-Modal Multi-View Variational AutoEncoder (M²VAE), a generative model that addresses the challenges of modeling common and unique views in attribute and multi-modal features, as well as user preferences over single-typed item features. Specifically, we generate type-specific latent variables for item IDs, categorical attributes, and image features, and use Product-of-Experts (PoE) to derive a common representation. A disentangled contrastive loss decouples the common view from unique views while preserving feature informativeness. To model user inclinations, we employ a user-aware hierarchical Mixture-of-Experts (MoE) to adaptively fuse representations. We further incorporate co-occurrence signals via contrastive learning, eliminating the need for pretraining. Extensive experiments on real-world datasets validate the effectiveness of our approach.
Chuan He 0005, Yongchao Liu 0004, Qiang Li 0054, Chuntao Hong, Leon Wenliang Zhong, Xin-Wei Yao 0001
AAAI1
2025 Dual-Interest Adaptive Network for Click-Through Rate Prediction
abstract
In advertising recommendation systems, click-through rate (CTR) prediction is a critical task. Capturing users' interests from their rich historical behaviors is key to improving prediction results. Although traditional deep learning methods can capture users' interests to some extent, they fail to account for the local and global interests reflected in users' historical behaviors and the dynamic relationships between them. In this paper, we propose a novel architecture - Dual-Interest Adaptive Network (DIAN), which adaptively extracts both local and global interests of users. Specifically, to better explore users' interests in depth, we propose an Adaptive Interest Extraction Block applied to users' historical behavior sequences. By introducing an attention mechanism, this module can flexibly allocate weights to users' local and global interests after decoupling user behaviors. Additionally, to capture complex feature interactions, our model introduces two feature extractors: one combines a Multi-Layer Perceptron (MLP) with a Cross Network for high-order feature extraction, and the other incorporates an Attention Factorization Machine (AFM) for low-order feature extraction. We conducted extensive experiments on the Movielens-1M and Amazon Electronics datasets, validating the effectiveness of DIAN.
Xin-Wei Yao 0001, Yu-Han Mil, Chuan He 0005, Weiqiang Wang 0002, Qiang Li 0054
CSCWD3
2025 PF-GCL++: Parameter-Free Graph Contrastive Learning for Mitigating Oversmoothing in Recommender Systems
Xin-Wei Yao 0001, YuXiang Wu, Chuan He 0005, Qiang Li 0054
ICIC (8)3
2025 Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation
abstract
Sequential recommendation (SR) aims to predict the next purchasing item according to users' dynamic preference learned from their historical user-item interactions. To improve the performance of recommendation, learning dynamic heterogeneous cross-type behavior dependencies is indispensable for recommender system. However, there still exists some challenges in Multi-Behavior Sequential Recommendation (MBSR). On the one hand, existing methods only model heterogeneous multi-behavior dependencies at behavior-level or item-level, and modeling interaction-level dependencies is still a challenge. On the other hand, the dynamic multi-grained behavior-aware preference is hard to capture in interaction sequences, which reflects interaction-aware sequential pattern. To tackle these challenges, we propose a Multi-Grained Preference enhanced Transformer framework (M-GPT). First, M-GPT constructs an interaction-level graph of historical cross-typed interactions in a sequence. Then graph convolution is performed to derive interaction-level multi-behavior dependency representation repeatedly, in which the complex correlation between historical cross-typed interactions at specific orders can be well learned. Secondly, a novel multifaceted transformer architecture equipped with multi-grained user preference extraction is proposed to encode the interaction-aware sequential pattern enhanced by capturing temporal behavior-aware multi-grained preference . Experiments on the real-world datasets indicate that our method M-GPT consistently outperforms various state-of-the-art recommendation methods. Our code is available at: https://github.com/hchchchchchchc/MGPT.
Chuan He 0005, Yongchao Liu 0004, Qiang Li 0054, Weiqiang Wang 0002, Chuntao Hong, Xin-Wei Yao 0001
KDD (2)1
2023 Low-Dimensional Feature Representation with Hybrid Attention for Few-Shot Image Classification
abstract
Learning effective image representation and constructing a suitable metric space are two main challenges in few-shot image classification. Existing methods normally consider the joint characteristic distribution of the image to improve the image representation ability, but it also brings high computational cost and produces high-dimensional embedding vectors, which limit their real-world applicability. In this paper, in order to reduce computational complexity and embedding dimension, we propose an effectively low-dimensional feature representation module (LDFR), which introduces a window mechanism to make the model focus on the correlation between local channels by using Brownian Distance Covariance. Furthermore, we combine LDFR with Hybrid Attention (LDFR-HA) to solve the problem of unbalanced sample features in few-shot image classification. Specifically, weighted average is adopted in the Hybrid Attention to construct the metric space and perform classification. Numerous experiments are conducted on two standard few-shot image classification benchmarks, i.e., general object recognition and fine-grained categorization. Extensive evaluations demonstrate that LDFR-HA significantly outperforms existing approaches. On popular datasets miniImageNet and CUB, LDFR-HA achieves 3.52 percentage point(pp)/2.29pp and 2.1pp/1.45pp gains over the state-of-the-art method on 5-way 1-shot/5-shot tasks, respectively.
Xin-Wei Yao 0001, Zhi-Heng Yuan, Yu-Li Fang, Chuan He 0005, Yu-Chen Zhang, Qiang Li 0054
ICPADS4
2023 DDIN: Deep Disentangled Interest Network for Click-Through Rate Prediction
abstract
Click-Through Rate(CTR) prediction aims to predict the possibility of users clicking on products, which has become the core task of advertising recommendation systems. Due to the richness of user historical behavior, a key to making effective prediction is to capture users' diverse interests from historical behavior. An efficient way to do this is to perform dot product of behavior and target embedding with attentive neural networks. To better model the users' diverse interests, our proposed disentangled interest extraction block decouples the unary terms modeling the impact of user behavior sequence from pairwise interactions. Specifically, the decoupled pairwise term can learn the pure pairwise interactions, whereas the unary term models the impact of behavior sequence on each target items. Meanwhile, our model emphasizes both high- and low-order feature interactions by combining Attentional Factorization Machines(AFMs) with deep learning. This work intends to accomplish our goal by proposing a novel architecture Deep Disentangled Interest Network(DDIN). We conduct comprehensive experiments on Movielens dataset and Amazon electronic dataset. The results demonstrate the effectiveness of DDIN which is superior to some state-of-art models by up to 26.271 %.
Xin-Wei Yao 0001, Chuan He 0005, Weiwei Xing, Qi-Chao Lu, Xin-Ge Zhang, Yu-Chen Zhang
IJCNN2