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

Lele Sun

dblp:327/4256 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Artificial intelligence
2 papers
Representation and self-supervised learning · 65% Trustworthy machine learning · 22% Graph learning · 6%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
cross-domain recommendation
1.522024
Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation · IEEE Trans. Multim. 2024
Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation · AAAI 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.812024
Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation · AAAI 2024
Machine learning › Representation and self-supervised learning › representation learning › invariant representation learning
domain-invariant representation
0.812024
Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation · IEEE Trans. Multim. 2024
Machine learning › Trustworthy machine learning
feature separation
0.812024
Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation · IEEE Trans. Multim. 2024
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.812024
Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation · AAAI 2024
Recommender systems
data sparsity
0.812024
Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation · IEEE Trans. Multim. 2024
Machine learning › Deep learning architectures and training
attention mechanism
0.212024
Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation · IEEE Trans. Multim. 2024
Machine learning › Graph learning
graph neural network
0.212024
Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation · AAAI 2024

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

mutual information · 1.5meta-network · 1.5domain-invariant feature separation · 1.5contrastive learning · 1.5compound sample generation · 1.5attention mechanism · 1.5
YearPublicationVenuePosition
2025 Structurally and Semantically Guided Human-Object Interaction Detection
Lele Sun, Rong Quan
PRCV (17)1
2024 Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation
abstract
Cross-Domain Recommendation (CDR) has been proven to effectively alleviate the data sparsity problem in Recommender System (RS). Recent CDR methods often disentangle user features into domain-invariant and domain-specific features for efficient cross-domain knowledge transfer. Despite showcasing robust performance, three crucial aspects remain unexplored for existing disentangled CDR approaches: i) The significance nuances of the interaction behaviors are ignored in generating disentangled features; ii) The user features are disentangled irrelevant to the individual items to be recommended; iii) The general knowledge transfer overlooks the user's personality when interacting with diverse items. To this end, we propose a Graph Disentangled Contrastive framework for CDR (GDCCDR) with personalized transfer by meta-networks. An adaptive parameter-free filter is proposed to gauge the significance of diverse interactions, thereby facilitating more refined disentangled representations. In sight of the success of Contrastive Learning (CL) in RS, we propose two CL-based constraints for item-aware disentanglement. Proximate CL ensures the coherence of domain-invariant features between domains, while eliminatory CL strives to disentangle features within each domains using mutual information between users and items. Finally, for domain-invariant features, we adopt meta-networks to achieve personalized transfer. Experimental results on four real-world datasets demonstrate the superiority of GDCCDR over state-of-the-art methods.
Jing Liu 0002, Lele Sun, Weizhi Nie, Peiguang Jing, Yuting Su 0001
AAAI2
2024 Beyond Users: Denoising Behavior-based Contrastive Learning for Disentangled Cross-Domain Recommendation
Lele Sun, Jing Liu 0002, Shenyuan Zhang, Weizhi Nie, Anan Liu, Yuting Su 0001
DASFAA (2)1
2024 Feature-Prompting GBMSeg: One-Shot Reference Guided Training-Free Prompt Engineering for Glomerular Basement Membrane Segmentation
Xueyu Liu, Guangze Shi 0001, Yexin Lai, Lele Sun, Quan Yang, Yongfei Wu, Weixia Han
MICCAI (9)6
2024 Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation
abstract
Data sparsity poses a persistent challenge in Recommender Systems (RS), driving the emergence of Cross-Domain Recommendation (CDR) as a potential remedy. However, most existing CDR methods often struggle to circumvent the transfer of domain-specific information, which are perceived as noise in the target domain. Additionally, they primarily concentrate on inter-domain information transfer, disregarding the comprehensive exploration of data within intra-domains. To address these limitations, we propose SUCCDR (SeparatingUser features withCompound samples), a novel approach that tackles data sparsity by leveraging both cross-domain knowledge transfer and comprehensive intra-domain analysis. Specifically, to ensure the exclusion of noisy domain-specific features during the transfer process, user preferences are separated into domain-invariant and domain-specific features through three efficient constraints. Furthermore, the unobserved items are leveraged to generate compound samples that intelligently merge observed and unobserved potential user-item interaction, utilizing a simple yet efficient attention mechanism to enable a comprehensive and unbiased representation of user preferences. We evaluate the performance of SUCCDR on two real-world datasets, Douban and Amazon, and compare it with state-of-the-art single-domain and cross-domain recommendation methods. The experimental results demonstrate that SUCCDR outperforms existing approaches, highlighting its ability to effectively alleviate data sparsity problem.
Jing Liu 0002, Lele Sun, Weizhi Nie, Yuting Su 0001, Yongdong Zhang 0001, Anan Liu
IEEE Trans. Multim.2
2023 Test Case Generation for Autonomous Driving Based on Improved Genetic Algorithm
abstract
From reducing traffic congestion to improving transportation, autonomous vehicles have immense potential in enhancing productivity and quality of life. As a safety-critical system, autonomous vehicles must undergo extensive testing before being deployed on public roads to ensure their safety and reliability. Given the complexity and high dimensionality of testing scenarios for autonomous driving, this paper proposes a test case generation method based on an improved genetic algorithm. The LGSVL simulator is used to conduct simulation tests on the Baidu Apollo system. The experimental results demonstrate that the test cases generated by this method can effectively test various safety violations of autonomous vehicles and improve the efficiency of generating effective test cases.
Lele Sun, Changyou Zheng, Tongtong Bai
QRS1