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

Guangping Zhang

dblp:130/5892 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
8since 2021 · last 2026
0009-0001-9853-8268ORCID · corroborated

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

Databases, data management, data science and information retrieval · 6 · 3 first-author · 6 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 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.

Databases, data mining, and information retrieval
4 papers
Recommender systems · 87% Information retrieval · 13%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 56% Human-AI interaction · 44%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › recommender system evaluation
recommendation simulation
1.012026
RECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations · ACM Trans. Inf. Syst. 2026
Recommender systems
recommender system evaluation
1.012026
RECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations · ACM Trans. Inf. Syst. 2026
Recommender systems › trustworthy recommendation
robust recommendation
1.012026
LLM Agent-based Shilling Attack on Recommender Systems · WSDM 2026
Information retrieval › evaluation
user simulation
1.012026
RECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations · ACM Trans. Inf. Syst. 2026
Collaborative and social computing
content moderation
1.012026
Power Echoes: Investigating Moderation Biases in Online Power-Asymmetric Conflicts · CHI 2026
Security and privacy of machine learning › model security
recommender system security
1.012026
LLM Agent-based Shilling Attack on Recommender Systems · WSDM 2026
Security and privacy of machine learning › recommender system attack
shilling attacks
1.012026
LLM Agent-based Shilling Attack on Recommender Systems · WSDM 2026
Recommender systems
cross-domain recommendation
0.912025
AgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations · SIGIR 2025
Recommender systems
large language model-based recommendation
0.912025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025
Recommender systems › user modeling
user preference modeling
0.912025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025
Natural language and speech › Language models and text generation › prompting
chain-of-thought prompting
0.312025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025
Natural language and speech › Language models and text generation
prompting
0.312025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025

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

adversarial profile generation · 2.0large language model · 1.7chain-of-thought prompting · 1.7user agent modeling · 1.0multi-stage recommender architecture · 1.0mixed-design experiment · 1.0LLM agents · 1.0LLM agent · 1.0two-step fusion · 0.9interest groups · 0.9group-shared memory · 0.9dual-layer memory · 0.9
YearPublicationVenuePosition
2026 Power Echoes: Investigating Moderation Biases in Online Power-Asymmetric Conflicts
abstract
Online power-asymmetric conflicts are prevalent, and most platforms rely on human moderators to conduct moderation currently. Previous studies have been continuously focusing on investigating human moderation biases in different scenarios, while moderation biases under power-asymmetric conflicts remain unexplored. Therefore, we aim to investigate the types of power-related biases human moderators exhibit in power-asymmetric conflict moderation (RQ1) and further explore the influence of AI’s suggestions on these biases (RQ2). For this goal, we conducted a mixed design experiment with 50 participants by leveraging the real conflicts between consumers and merchants as a scenario. Results suggest several biases towards supporting the powerful party within these two moderation modes. AI assistance alleviates most biases of human moderation, but also amplifies a few. Based on these results, we propose several insights into future research on human moderation and human-AI collaborative moderation systems for power-asymmetric conflicts.
Yaqiong Li, Peng Zhang 0060, Peixu Hou, Kainan Tu, Guangping Zhang, Shan Qu, Wenshi Chen, Yan Chen 0033, Ning Gu 0001, Tun Lu
CHI5
2026 LLM Agent-based Shilling Attack on Recommender Systems
abstract
With the growing ubiquity of recommender systems (RSs), malicious manipulation through shilling attacks, where fake user profiles are injected to alter system outputs, poses increasing threats to system integrity. Existing attack methods often rely on simplified heuristics, require internal RS data, and most overlook user reviews, limiting their stealthiness, realism, and potential impact. Recently, LLM-based user agents are gaining traction in the RS community for their capabilities to simulate human behaviors like rating and review generation. In this context, we propose AgentSA, a low-knowledge shilling attack framework that employs such agents to manipulate recommendations through adversarial yet human-like interactions. We design targeted mechanisms to guide profile construction, memory retrieval, and action generation (including reviews) to maximize manipulation impact while maintaining behavioral camouflage. We evaluate the impact of these agents on various types of RSs and demonstrate that AgentSA consistently outperforms existing low-knowledge attack methods in both effectiveness and stealth. Our findings uncover a concerning new class of threats enabled by LLM-based agents, underscoring the pressing need to bolster RS security against such emerging risks.
Shengkang Gu, Jiahao Liu 0009, Dongsheng Li 0002, Guangping Zhang, Mingzhe Han, Hansu Gu, Peng Zhang 0060, Ning Gu 0001, Li Shang 0001, Tun Lu
WSDM4
2026 RECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations
abstract
As recommender systems become increasingly important components in online communities, studying their impact on these communities becomes ever more crucial. Facing the high costs and ethical risks of real-world social experiments, researchers construct recommendation simulators to study the interactions between recommender systems and users. However, existing simulators face challenges in providing universal, accurate, and scalable interaction modeling for various types of online communities involving millions of contents and users with diverse action types. To address these challenges, we propose RECOSIM, a simulation framework capable of offering efficient recommendation interaction simulations across a wide range of scenarios. RECOSIM decomposes the user agent into five fundamental modules: Encode Model, Decode Model, Activity Model, Scoring Model, and Generation Model, allowing for accurate and extensible modeling of user behavior and interaction dynamics. The recommender system agent adheres to established industry architectures, implementing three stages and four fundamental strategies, thereby improving generalizability across various platforms and the computational efficiency of simulation. Utilizing two real-world datasets (Weibo and Zhihu), we validate the accuracy and stability of each component and the overall framework of RECOSIM, demonstrating the reliability of RECOSIM as a simulation environment. Subsequently, we delve into analyzing the impact of the four fundamental recommendation strategies on online communities, providing design inspirations for enhancing user engagement and community growth.
Guangping Zhang, Dongsheng Li 0002, Hansu Gu, Peng Zhang 0060, Tun Lu, Li Shang 0001, Ning Gu 0001
ACM Trans. Inf. Syst.1
2025 EvalAgent: Towards Evaluating News Recommender Systems with LLM-based Agents
abstract
Online news platforms have become the primary source of information consumption, with recommender systems serving as critical gateways that shape public discourse through their algorithmic power, necessitating rigorous evaluation methodologies. Traditional offline evaluation methods struggle with evolving user behavior and dynamic system adaptation, while online experiments are costly, time-consuming, and ethically challenging. To address these challenges, this paper introduces EvalAgent, a large language model agent system for simulating real-world online news recommender systems. EvalAgent employs Stable Memory (StM) to model users' exploration-exploitation dynamics, mitigating noise from irrelevant interactions by analyzing the distribution density of news articles within the short-term memory, and incrementally maintains the long-term memory to capture users' high-level preferences, thereby enabling a consistent and reliable simulation of sustained interactions. It further incorporates an Environment Interaction Framework (EIF) to enable seamless engagement with real-world recommender systems. This approach yields a precise, scalable, and ethically responsible evaluation framework for news recommender systems. Comprehensive experiments and user studies substantiate EvalAgent's efficacy, with publicly available code to support ongoing research in recommender system evaluation.
Guangping Zhang, Peng Zhang 0060, Jiahao Liu 0009, Zhuoheng Li, Dongsheng Li 0002, Hansu Gu, Tun Lu, Ning Gu 0001
CIKM1
2025 AgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations
abstract
LLM-based user agents, which simulate user interaction behavior, are emerging as a promising approach to enhancing recommender systems. In real-world scenarios, users' interactions often exhibit cross-domain characteristics and are influenced by others. However, the memory design in current methods causes user agents to introduce significant irrelevant information during decision-making in cross-domain scenarios and makes them unable to recognize the influence of other users' interactions, such as popularity factors. To tackle this issue, we propose a dual-layer memory architecture combined with a two-step fusion mechanism. This design avoids irrelevant information during decision-making while ensuring effective integration of cross-domain preferences. We also introduce the concepts of interest groups and group-shared memory to better capture the influence of popularity factors on users with similar interests. Comprehensive experiments validate the effectiveness of AgentCF++. Our code is available at https://github.com/jhliu0807/AgentCF-plus.
Jiahao Liu 0009, Shengkang Gu, Dongsheng Li 0002, Guangping Zhang, Mingzhe Han, Hansu Gu, Peng Zhang 0060, Tun Lu, Li Shang 0001, Ning Gu 0001
SIGIR4
2025 Improving LLM-powered Recommendations with Personalized Information
abstract
Due to the lack of explicit reasoning modeling, existing LLM-powered recommendations fail to leverage LLMs' reasoning capabilities effectively. In this paper, we propose a pipeline called CoT-Rec, which integrates two key Chain-of-Thought (CoT) processes-user preference analysis and item perception analysis-into LLM-powered recommendations, thereby enhancing the utilization of LLMs' reasoning abilities. CoT-Rec consists of two stages: (1) personalized information extraction, where user preferences and item perception are extracted, and (2) personalized information utilization, where this information is incorporated into the LLM-powered recommendation process. Experimental results demonstrate that CoT-Rec shows potential for improving LLM-powered recommendations. The implementation is publicly available at https://github.com/jhliu0807/CoT-Rec.
Jiahao Liu 0009, Xueshuo Yan, Dongsheng Li 0002, Guangping Zhang, Hansu Gu, Peng Zhang 0060, Tun Lu, Li Shang 0001, Ning Gu 0001
SIGIR4
2024 Simulating News Recommendation Ecosystems for Insights and Implications
abstract
Studying the evolution of online news communities is essential for improving the effectiveness of news recommender systems. Traditionally, this has been done through empirical research based on static data analysis. While this approach has yielded valuable insights for optimizing recommender system designs, it is limited by the lack of appropriate datasets and open platforms for controlled social experiments. This gap in the existing literature hinders a comprehensive understanding of the impact of recommender systems on the evolutionary process and its underlying mechanisms. As a result, suboptimal system designs may be developed that could negatively affect long-term utilities. In this work, we propose SimuLine, a simulation platform to dissect the evolution of news recommendation ecosystems and present a detailed analysis of the evolutionary process and underlying mechanisms. SimuLine first constructs a latent space well reflecting the human behaviors and then simulates the news recommendation ecosystem via agent-based modeling. Based on extensive simulation experiments and the comprehensive analysis framework consisting of quantitative metrics, visualization, and textual explanations, we analyze the characteristics of each evolutionary phase from the perspective of life-cycle theory and propose a relationship graph illustrating the key factors and affecting mechanisms. Furthermore, we explore the impacts of recommender system designing strategies, including the utilization of cold-start news, breaking news, and promotion, on the evolutionary process, which sheds new light on the design of recommender systems.
Guangping Zhang, Dongsheng Li 0002, Hansu Gu, Tun Lu, Li Shang 0001, Ning Gu 0001
IEEE Trans. Comput. Soc. Syst.1
2024 Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation
abstract
The emergence of online media has facilitated the dissemination of news, but has also introduced the problem of information overload. To address this issue, providing users with accurate and diverse news recommendations has become increasingly important. News possesses rich and heterogeneous content, and the factors that attract users to news reading are varied. Consequently, accurate news recommendation requires modeling of both the heterogeneous content of news and the heterogeneous user-news relationships. Furthermore, users’ news consumption is highly dynamic, which is reflected in the differences in topic concentration among different users and in the real-time changes in user interests. To this end, we propose a Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation (DivHGNN). DivHGNN first represents the heterogeneous content of news and the heterogeneous user-news relationships as an attributed heterogeneous graph. Then, through a heterogeneous node content adapter, it models the heterogeneous node attributes into aligned and fused node representations. With the proposed attributed heterogeneous graph neural network, DivHGNN integrates the heterogeneous relationships to enhance node representation for accurate news recommendations. We also discuss relation pruning, model deployment, and cold-start issues to further improve model efficiency. In terms of diversity, DivHGNN simultaneously models the variance of nodes through variational representation learning for providing personalized diversity. Additionally, a time-continuous exponentially decaying distribution cache is proposed to model the temporal dynamics of user real-time interests for providing adaptive diversity. Extensive experiments on real-world news datasets demonstrate the effectiveness of the proposed method.
Guangping Zhang, Dongsheng Li 0002, Hansu Gu, Tun Lu, Ning Gu 0001
ACM Trans. Web1