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

Shiyi Yang 0001

dblp:202/5823-1 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-0539-8391ORCID · conflict

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

Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Security and privacy · 1Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Network and information security
2 papers
Security and privacy of machine learning · 70% Systems and software security · 30%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › large language model-based recommendation
LLM-based recommender agents
1.012026
DrunkAgent: Stealthy Memory Corruption in LLM-Powered Recommender Agents · WWW 2026
Security and privacy of machine learning › large language model security
LLM agent security
1.012026
DrunkAgent: Stealthy Memory Corruption in LLM-Powered Recommender Agents · WWW 2026
Systems and software security › exploitation
memory corruption attack
1.012026
DrunkAgent: Stealthy Memory Corruption in LLM-Powered Recommender Agents · WWW 2026
Recommender systems › trustworthy recommendation › recommender system security
data poisoning attack
0.712023
Review-Incorporated Model-Agnostic Profile Injection Attacks on Recommender Systems · ICDM 2023
Security and privacy of machine learning
adversarial attack
0.712023
Review-Incorporated Model-Agnostic Profile Injection Attacks on Recommender Systems · ICDM 2023
Security and privacy of machine learning
recommender system attack
0.712023
Review-Incorporated Model-Agnostic Profile Injection Attacks on Recommender Systems · ICDM 2023

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

adversarial attack · 2.0transformer · 1.3generative adversarial network · 1.3
YearPublicationVenuePosition
2026 DrunkAgent: Stealthy Memory Corruption in LLM-Powered Recommender Agents
Shiyi Yang 0001, Zhibo Hu, Xinshu Li 0001, Chen Wang 0008, Tong Yu 0001, Xiwei Xu 0001, Liming Zhu 0001, Lina Yao 0001
WWW1
2024 Attacking Visually-aware Recommender Systems with Transferable and Imperceptible Adversarial Styles
abstract
The inclusion of the images opens up a security vulnerability of visually-aware recommender systems (VARSs). It can be exploited by unscrupulous parties to upload well-crafted adversarial images for certain malicious purposes (e.g., promoting their own products for profits). Some studies have focused on attacking VARSs to gain insights into their robustness, while they are still far from practical, i.e., the attacks often 1) lack diversity in perturbations, 2) are easily perceived and 3) have limited transferability, which may lead to overestimation of defenses in practice. To tackle the problems, we propose to perturb the style of the product, which is an unnoticeable but important property of visual recommendations. Specifically, we propose a novel Style perturbation-based Practical Attack Framework (SPAF). Unlike existing attacks that change pixels within l∞ -norm constraints, SPAF interferes with styles in latent feature space so that the attack becomes unbounded in the pixel space to reflect possible actual perturbations. SPAF formulates attack objectives as an optimization problem and adopts an adaptive adversarial style transfer network to solve it so that transferable and imperceptible attacks can be generated. Comprehensive experiments on real-world datasets demonstrate that SPAF significantly outperforms state-of-the-art attacks.
Shiyi Yang 0001, Chen Wang 0008, Xiwei Xu 0001, Liming Zhu 0001, Lina Yao 0001
CIKM1
2023 Review-Incorporated Model-Agnostic Profile Injection Attacks on Recommender Systems
abstract
Recent studies have shown that recommender systems (RSs) are highly vulnerable to data poisoning attacks. Understanding attack tactics helps improve the robustness of RSs. We intend to develop efficient attack methods that use limited resources to generate high-quality fake user profiles to achieve 1) transferability among black-box RSs 2) and imperceptibility among detectors. In order to achieve these goals, we introduce textual reviews of products to enhance the generation quality of the profiles. Specifically, we propose a novel attack framework named R-Trojan, which formulates the attack objectives as an optimization problem and adopts a tailored transformer-based generative adversarial network (GAN) to solve it so that high-quality attack profiles can be produced. Comprehensive experiments on real-world datasets demonstrate that R-Trojan greatly outperforms state-of-the-art attack methods on various victim RSs under black-box settings and show its good imperceptibility.
Shiyi Yang 0001, Lina Yao 0001, Chen Wang 0008, Xiwei Xu 0001, Liming Zhu 0001
ICDM1
2021 Hunter in the Dark: Discover Anomalous Network Activity Using Deep Ensemble Network
abstract
Machine learning (ML)-based intrusion detection systems (IDSs) play a critical role in discovering unknown threats in a large-scale cyberspace. They have been adopted as a mainstream hunting method in many organizations, such as financial institutes, manufacturing companies and govern-ment agencies. However, existing designs achieve a high threat detection performance at the cost of a large number of false alarms, leading to alert fatigue. To tackle this issue, in this paper, we propose a neural-network-based defense mechanism named DarkHunter. DarkHunter incorporates both supervised learning and unsupervised learning in the design. It uses a deep ensemble network (trained through supervised learning) to detect anomalous network activities and exploits an unsupervised learning-based scheme to trim off mis-detection results. For each detected threat, DarkHunter can trace to its source and present the threat in its original traffic format. Our evaluations, based on the UNSW-NB15 dataset, show that DarkHunter outperforms the existing ML- based IDSs and is able to achieve a high detection accuracy while keeping a low false positive rate.
Shiyi Yang 0001, Nour Moustafa
QRS1
2020 Densely Connected Residual Network for Attack Recognition
abstract
High false alarm rate and low detection rate are the major sticking points for unknown threat perception. To address the problems, in the paper, we present a densely connected residual network (Densely-ResNet) for attack recognition. Densely-ResNet is built with several basic residual units, where each of them consists of a series of Conv-GRU subnets by wide connections. Our evaluation shows that Densely-ResNet can accurately discover various unknown threats that appear in edge, fog and cloud layers and simultaneously maintain a much lower false alarm rate than existing algorithms.
Peilun Wu, Nour Moustafa, Shiyi Yang 0001
TrustCom3