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

Guoxuan Zou

dblp:371/4630 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Generative modeling · 50% Deep learning architectures and training · 50%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › adversarial generative modeling
adversarial generation
0.812024
Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation · AAAI 2024
Machine learning › Deep learning architectures and training
data augmentation
0.812024
Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation · AAAI 2024
Recommender systems
sequential recommendation
0.812024
Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation · AAAI 2024
Recommender systems
data sparsity
0.212024
Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation · AAAI 2024

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

embedding space exploration · 1.5adversarial generation · 1.5
YearPublicationVenuePosition
2024 Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation
abstract
Sequential Recommendation plays a significant role in daily recommendation systems, such as e-commerce platforms like Amazon and Taobao. However, even with the advent of large models, these platforms often face sparse issues in the historical browsing records of individual users due to new users joining or the introduction of new products. As a result, existing sequence recommendation algorithms may not perform well. To address this, sequence-based data augmentation methods have garnered attention. Existing sequence enhancement methods typically rely on augmenting existing data, employing techniques like cropping, masking prediction, random reordering, and random replacement of the original sequence. While these methods have shown improvements, they often overlook the exploration of the deep embedding space of the sequence. To tackle these challenges, we propose a Sparse Enhanced Network (SparseEnNet), which is a robust adversarial generation method. SparseEnNet aims to fully explore the hidden space in sequence recommendation, generating more robust enhanced items. Additionally, we adopt an adversarial generation method, allowing the model to differentiate between data augmentation categories and achieve better prediction performance for the next item in the sequence. Experiments have demonstrated that our method achieves a remarkable 4-14% improvement over existing methods when evaluated on the real-world datasets. (https://github.com/junyachen/SparseEnNet)
Junyang Chen 0001, Guoxuan Zou, Pan Zhou 0001, Yirui Wu, Zhenghan Chen, Houcheng Su, Huan Wang 0005, Zhiguo Gong
AAAI2