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

Yusheng Liu 0003

dblp:08/5282-3 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-0633-5104ORCID · verified

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

Databases, data management, data science and information retrieval · 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
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Graph Augmentation Empowered Contrastive Learning for Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.912025
Graph Augmentation Empowered Contrastive Learning for Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems › graph-based recommendation
graph augmentation
0.912025
Graph Augmentation Empowered Contrastive Learning for Recommendation · ACM Trans. Inf. Syst. 2025

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

pagerank centrality · 0.9graph augmentation · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Graph Augmentation Empowered Contrastive Learning for Recommendation
abstract
The application of contrastive learning (CL) to collaborative filtering (CF) in recommender systems has achieved remarkable success. CL-based recommendation models mainly focus on creating multiple augmented views by employing different graph augmentation methods and utilizing these views for self-supervised learning. However, current CL methods for recommender systems usually struggle to fully address the problem of noisy data. To address this problem, we propose the G raph A ugmentation E mpowered C ontrastive L earning (GAECL) for recommendation framework, which uses graph augmentation based on topological and semantic dual adaptation and global co-modeling via structural optimization to co-create contrasting views for better augmentation of the CF paradigm. Specifically, we strictly filter out unimportant topologies by reconstructing the adjacency matrix and mask unimportant attributes in nodes according to the PageRank centrality principle to generate an augmented view that filters out noisy data. Additionally, GAECL achieves global collaborative modeling through structural optimization and generates another augmented view based on the PageRank centrality principle. This helps to filter the noisy data while preserving the original semantics of the data for more effective data augmentation. Extensive experiments are conducted on five datasets to demonstrate the superior performance of our model over various recommendation models.
Lixiang Xu, Yusheng Liu 0003, Tong Xu 0001, Enhong Chen, Yuan Yan Tang
ACM Trans. Inf. Syst.2