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

Peng Zhang 0060

dblp:21/1048-60 · DBLP profile ↗
← Back
74ranked-venue papers
8as first author
63since 2021 · last 2026
0000-0002-9109-4625ORCID · conflict

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

Databases, data management, data science and information retrieval · 35 · 3 first-author · 35 since 2021Human-computer interaction and ubiquitous computing · 28 · 3 first-author · 20 since 2021Artificial intelligence and machine learning · 17 · 1 first-author · 14 since 2021Applied, interdisciplinary, general and emerging computing · 9 · 1 first-author · 9 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 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
22 papers
Recommender systems · 79% Web and social media mining · 11% Information retrieval · 7%
Human-computer interaction and pervasive computing
10 papers
Collaborative and social computing · 35% Human-AI interaction · 34% Health and well-being technologies · 10%
Artificial intelligence
11 papers
Language models and text generation · 37% Graph learning · 18% Vision and language · 16%
Network and information security
3 papers
Security and privacy of machine learning · 79% Privacy and data protection · 21%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
2.332025
Unbiased Collaborative Filtering with Fair Sampling · SIGIR 2025
Hierarchical Graph Signal Processing for Collaborative Filtering · WWW 2024
Personalized Graph Signal Processing for Collaborative Filtering · WWW 2023
Recommender systems
click-through rate prediction
2.232026
RQ-GMM: Residual Quantized Gaussian Mixture Model for Multimodal Semantic Discretization in CTR Prediction · SIGIR 2026
CL4CTR: A Contrastive Learning Framework for CTR Prediction · WSDM 2023
Enhancing CTR Prediction with Context-Aware Feature Representation Learning · SIGIR 2022
Collaborative and social computing
content moderation
2.022026
Echoes of Norms: Investigating Counterspeech Bots' Influence on Bystanders in Online Communities · CHI 2026
Power Echoes: Investigating Moderation Biases in Online Power-Asymmetric Conflicts · CHI 2026
Natural language and speech › Language models and text generation
alignment
1.832026
On the Essence and Prospect: An Investigation of Alignment Approaches for Big Models · IJCAI 2024
Denevil: towards Deciphering and Navigating the Ethical Values of Large Language Models via Instruction Learning · ICLR 2024
MoHoBench: Assessing Honesty of Multimodal Large Language Models via Unanswerable Visual Questions · AAAI 2026
Recommender systems
sequential recommendation
1.622025
Oracle-guided Dynamic User Preference Modeling for Sequential Recommendation · WSDM 2025
Neural Kalman Filtering for Robust Temporal Recommendation · WSDM 2024
Recommender systems › user modeling
user preference modeling
1.422025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025
Parameter-free Dynamic Graph Embedding for Link Prediction · NeurIPS 2022
Natural language and speech › Language models and text generation
large language model
1.322026
IROTE: Human-like Traits Elicitation of Large Language Model via In-Context Self-Reflective Optimization · AAAI 2026
Filtering Discomforting Recommendations with Large Language Models · WWW 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
1.012026
MoHoBench: Assessing Honesty of Multimodal Large Language Models via Unanswerable Visual Questions · AAAI 2026
Computer vision › Vision and language
visual question answering
1.012026
MoHoBench: Assessing Honesty of Multimodal Large Language Models via Unanswerable Visual Questions · AAAI 2026
Information retrieval › similarity search › vector quantization
embedding quantization
1.012026
RQ-GMM: Residual Quantized Gaussian Mixture Model for Multimodal Semantic Discretization in CTR Prediction · SIGIR 2026
Recommender systems
generative recommendation
1.012026
Drift-Aware Incremental Token Adaptation with Collaborative Semantics for Generative Recommendation · SIGIR 2026
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
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
Machine learning › Generative modeling › diffusion model › text-to-image generation
personalized text-to-image generation
0.912025
SoulSearch: applying heuristic optimization to enhance text-to-image generation with personalized human-LMM collaboration · Sci. China Inf. Sci. 2025
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
SoulSearch: applying heuristic optimization to enhance text-to-image generation with personalized human-LMM collaboration · Sci. China Inf. Sci. 2025
Recommender systems
cross-domain recommendation
0.912025
AgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations · SIGIR 2025
Recommender systems › sequential recommendation › temporal dynamics modeling
dynamic user preference modeling
0.912025
Oracle-guided Dynamic User Preference Modeling for Sequential Recommendation · WSDM 2025
Recommender systems
federated recommendation
0.912025
FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation · SIGIR 2025
Recommender systems
large language model-based recommendation
0.912025
Improving LLM-powered Recommendations with Personalized Information · SIGIR 2025
Recommender systems › debiased recommendation
popularity bias mitigation
0.912025
Unbiased Collaborative Filtering with Fair Sampling · SIGIR 2025
Recommender systems › trustworthy recommendation
privacy-preserving recommendation
0.912025
FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation · SIGIR 2025
Collaborative and social computing › social support
peer support
0.912025
RemiHaven: Integrating "In-Town" and "Out-of-Town" Peers to Provide Personalized Reminiscence Support for Older Drifters · CHI 2025
Health and well-being technologies › cognitive support
reminiscence support
0.912025
RemiHaven: Integrating "In-Town" and "Out-of-Town" Peers to Provide Personalized Reminiscence Support for Older Drifters · CHI 2025
Accessibility and assistive technology › older adults
technology for older adults
0.912025
RemiHaven: Integrating "In-Town" and "Out-of-Town" Peers to Provide Personalized Reminiscence Support for Older Drifters · CHI 2025
Machine learning › Trustworthy machine learning › ethical AI
fairness and ethics
0.812024
Denevil: towards Deciphering and Navigating the Ethical Values of Large Language Models via Instruction Learning · ICLR 2024
Natural language and speech › Language models and text generation
instruction learning
0.812024
Denevil: towards Deciphering and Navigating the Ethical Values of Large Language Models via Instruction Learning · ICLR 2024

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

large language model · 4.4attention mechanism · 2.2self-reflection · 2.0information-theoretic objective · 2.0in-context optimization · 2.0adversarial profile generation · 2.0preference profiling · 1.7conversational interaction · 1.7graph signal processing · 1.4user agent modeling · 1.0supervised fine-tuning · 1.0residual quantization · 1.0preference learning · 1.0multi-stage recommender architecture · 1.0mixed-method within-subjects study · 1.0mixed-design experiment · 1.0intelligent support system · 1.0gaussian mixture model · 1.0
YearPublicationVenuePosition
2026 IROTE: Human-like Traits Elicitation of Large Language Model via In-Context Self-Reflective Optimization
abstract
Trained on various human-authored corpora, Large Language Models (LLMs) have demonstrated a certain capability of reflecting specific human-like traits (e.g., personality or values) by prompting, benefiting applications like personalized LLMs and social simulations. However, existing methods suffer from the superficial elicitation problem: LLMs can only be steered to mimic shallow and unstable stylistic patterns, failing to embody the desired traits precisely and consistently across diverse tasks like humans. To address this challenge, we propose IROTE, a novel in-context method for stable and transferable trait elicitation. Drawing on psychological theories suggesting that traits are formed through identity-related reflection, our method automatically generates and optimizes a textual self-reflection within prompts, which comprises self-perceived experience, to stimulate LLMs' trait-driven behavior. The optimization is performed by iteratively maximizing an information-theoretic objective that enhances the connections between LLMs' behavior and the target trait, while reducing noisy redundancy in reflection without any fine-tuning, leading to evocative and compact trait reflection. Extensive experiments across three human trait systems manifest that one single IROTE-generated self-reflection can induce LLMs' stable impersonation of the target trait across diverse downstream tasks beyond simple questionnaire answering, consistently outperforming existing strong baselines.
Yuzhuo Bai, Shitong Duan, Muhua Huang, Jing Yao 0003, Zhenghao Liu 0001, Peng Zhang 0060, Tun Lu, Xiaoyuan Yi, Maosong Sun 0001, Xing Xie 0001
AAAI6
2026 MoHoBench: Assessing Honesty of Multimodal Large Language Models via Unanswerable Visual Questions
abstract
Recently Multimodal Large Language Models (MLLMs) have achieved considerable advancements in vision-language tasks, yet produce potentially harmful or untrustworthy content. Despite substantial work investigating the trustworthiness of language models, MMLMs' capability to act honestly, especially when faced with visually unanswerable questions, remains largely underexplored. This work presents the first systematic assessment of honesty behaviors across various MLLMs. We ground honesty in models' response behaviors to unanswerable visual questions, define four representative types of such questions, and construct MoHoBench, a large-scale MMLM honest benchmark, consisting of 12k+ visual question samples, whose quality is guaranteed by multi-stage filtering and human verification. Using MoHoBench, we benchmarked the honesty of 28 popular MMLMs and conducted a comprehensive analysis. Our findings show that: (1) most models fail to appropriately refuse to answer when necessary, and (2) MMLMs' honesty is not solely a language modeling issue, but is deeply influenced by visual information, necessitating the development of dedicated methods for multimodal honesty alignment. Therefore, we implemented initial alignment methods using supervised and preference learning to improve honesty behavior, providing a foundation for future work on trustworthy MLLMs.
Yanxu Zhu, Shitong Duan, Xiangxu Zhang, Peng Zhang 0060, Tun Lu, Xiao Zhou 0005, Jing Yao 0003, Xiaoyuan Yi, Xing Xie 0001
AAAI5
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
CHI2
2026 Echoes of Norms: Investigating Counterspeech Bots' Influence on Bystanders in Online Communities
abstract
Counterspeech offers a non-repressive approach to moderate hate speech in online communities. Research has examined how counterspeech chatbots restrain hate speakers and support targets, but their impact on bystanders remains unclear. Therefore, we developed a counterspeech strategy framework and built Civilbot for a mixed-method within-subjects study. Bystanders generally viewed Civilbot as credible and normative, though its shallow reasoning limited persuasiveness. Its behavioural effects were subtle: when performing well, it could guide participation or act as a stand-in; when performing poorly, it could discourage bystanders or motivate them to step in. Strategy proved critical: cognitive strategies that appeal to reason, especially when paired with a positive tone, were relatively effective, while mismatch of contexts and strategies could weaken impact. Based on these findings, we offer design insights for mobilizing bystanders and shaping online discourse, highlighting when to intervene and how to do so through reasoning-driven and context-aware strategies.
Shuai Ma 0005, Peng Zhang 0060, Chenxin Li, Ning Gu 0001, Tun Lu
CHI4
2026 SparkTales: Facilitating Cross-Language Collaborative Storytelling through Coordinator-AI Collaboration
abstract
Cross-language collaborative storytelling plays a vital role in children’s language learning and cultural development, fostering both expressive ability and intercultural awareness. Yet, in practice, children’s participation is often shallow, and facilitating such sessions places heavy cognitive and organizational burdens on coordinators, who must coordinate language support, maintain children’s engagement, and navigate cultural differences. To address these challenges, we conducted a formative study with coordinators to identify their needs and pain points, which guided the design of SparkTales, an intelligent support system for cross-language collaborative storytelling. SparkTales leverages both individual and common characteristics of participating children to provide coordinators with story frameworks, diverse questions, and comprehension-oriented materials, aiming to reduce coordinators’ workload while enhancing children’s interactive engagement. Evaluation results show that SparkTales not only significantly increases coordinators’ efficiency and quality of guidance but also improves children’s participation, providing valuable insights for the design of future intelligent systems supporting cross-language collaboration.
Wenxin Zhao, Peng Zhang 0060, Hansu Gu, Haoxuan Zhou, Xiaojie Huo, Lin Wang 0085, Tun Lu, Ning Gu 0001
CHI2
2026 Drift-Aware Incremental Token Adaptation with Collaborative Semantics for Generative Recommendation
Yuebo Feng, Jiahao Liu 0009, Mingzhe Han, Dongsheng Li 0002, Hansu Gu, Peng Zhang 0060, Tun Lu, Ning Gu 0001
SIGIR6
2026 RQ-GMM: Residual Quantized Gaussian Mixture Model for Multimodal Semantic Discretization in CTR Prediction
abstract
Multimodal content is crucial for click-through rate (CTR) prediction. However, directly incorporating continuous embeddings from pre-trained models into CTR models yields suboptimal results due to misaligned optimization objectives and convergence speed inconsistency during joint training. Discretizing embeddings into semantic IDs before feeding them into CTR models offers a more effective solution, yet existing methods suffer from limited codebook utilization, reconstruction accuracy, and semantic discriminability. We propose RQ-GMM (Residual Quantized Gaussian Mixture Model), which introduces probabilistic modeling to better capture the statistical structure of multimodal embedding spaces. Through Gaussian Mixture Models combined with residual quantization, RQ-GMM achieves superior codebook utilization and reconstruction accuracy. Experiments on public datasets and online A/B tests on a large-scale short-video platform serving hundreds of millions of users demonstrate substantial improvements: RQ-GMM yields a 1.502% gain in Advertiser Value over strong baselines. The method has been fully deployed, serving daily recommendations for hundreds of millions of users.
Ziye Tong, Jiahao Liu 0009, Hongji Ruan, Derick Tang, Zhanpeng Zeng, Qinsong Zeng, Peng Zhang 0060, Tun Lu, Ning Gu 0001
SIGIR8
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
WSDM7
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.4
2025 RemiHaven: Integrating "In-Town" and "Out-of-Town" Peers to Provide Personalized Reminiscence Support for Older Drifters
Xuechen Zhang 0008, Changyang He, Peng Zhang 0060, Hansu Gu, Ning Gu 0001, Zhan Hu, Tun Lu
CHI3
2025 YouthCare: Building a Personalized Collaborative Video Censorship Tool to Support Parent-Child Joint Media Engagement
Wenxin Zhao, Fangyu Yu, Peng Zhang 0060, Hansu Gu, Lin Wang 0085, Siyuan Qiao, Tun Lu, Ning Gu 0001
CHI3
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
CIKM2
2025 AOTree: Aspect Order Tree-Based Model for Explainable Recommendation
abstract
Recent recommender systems aim to provide not only accurate recommendations but also explanations that help users understand them better. However, most existing explainable recommendations only consider the importance of content in reviews, such as words or aspects, and ignore the ordering relationship among them. This oversight neglects crucial ordering dimensions in the human decision-making process, leading to suboptimal performance. Therefore, in this paper, we propose Aspect Order Tree-based (AOTree) explainable recommendation method, inspired by the Order Effects Theory from cognitive and decision psychology, in order to capture the dependency relationships among decisive factors. We first validate the theory in the recommendation scenario by analyzing the reviews of the users. Then, according to the theory, the proposed AOTree expands the construction of the decision tree to capture aspect orders in users’ decision-making processes, and use attention mechanisms to make predictions based on the aspect orders. Extensive experiments demonstrate our method's effectiveness on rating predictions, and our approach aligns more consistently with the user’s decision-making process by displaying explanations in a particular order, thereby enhancing interpretability.
Wenxin Zhao, Peng Zhang 0060, Hansu Gu, Dongsheng Li 0002, Tun Lu, Ning Gu 0001
ICWSM2
2025 FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation
abstract
Recommendation algorithms rely on user historical interactions to deliver personalized suggestions, which raises significant privacy concerns. Federated recommendation algorithms tackle this issue by combining local model training with server-side model aggregation, where most existing algorithms use a uniform weighted summation to aggregate item embeddings from different client models. This approach has three major limitations: 1) information loss during aggregation, 2) failure to retain personalized local features, and 3) incompatibility with parameter-free recommendation algorithms. To address these limitations, we first review the development of recommendation algorithms and recognize that their core function is to share collaborative information, specifically the global relationship between users and items. With this understanding, we propose a novel aggregation paradigm named collaborative information aggregation, which focuses on sharing collaborative information rather than item parameters. Based on this new paradigm, we introduce the federated collaborative information aggregation (FedCIA) method for privacy-preserving recommendation. This method requires each client to upload item similarity matrices for aggregation, which allows clients to align their local models without constraining embeddings to a unified vector space. As a result, it mitigates information loss caused by direct summation, preserves the personalized embedding distributions of individual clients, and supports the aggregation of parameter-free models. Theoretical analysis and experimental results on real-world datasets demonstrate the superior performance of FedCIA compared with the state-of-the-art federated recommendation algorithms. Code is available at https://github.com/Mingzhe-Han/FedCIA.
Mingzhe Han, Dongsheng Li 0002, Jiafeng Xia, Jiahao Liu 0009, Hansu Gu, Peng Zhang 0060, Ning Gu 0001, Tun Lu
SIGIR6
2025 Unbiased Collaborative Filtering with Fair Sampling
abstract
Recommender systems leverage extensive user interaction data to model preferences; however, directly modeling these data may introduce biases that disproportionately favor popular items. In this paper, we demonstrate that popularity bias arises from the influence of propensity factors during training. Building on this insight, we propose a fair sampling (FS) method that ensures each user and each item has an equal likelihood of being selected as both positive and negative instances, thereby mitigating the influence of propensity factors. The proposed FS method does not require estimating propensity scores, thus avoiding the risk of failing to fully eliminate popularity bias caused by estimation inaccuracies. Comprehensive experiments demonstrate that the proposed FS method achieves state-of-the-art performance in both point-wise and pair-wise recommendation tasks. The code implementation is available at https://github.com/jhliu0807/Fair-Sampling.
Jiahao Liu 0009, Dongsheng Li 0002, Hansu Gu, Peng Zhang 0060, Tun Lu, Li Shang 0001, Ning Gu 0001
SIGIR4
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
SIGIR7
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
SIGIR6
2025 Oracle-guided Dynamic User Preference Modeling for Sequential Recommendation
abstract
Sequential recommendation methods can capture dynamic user preferences from user historical interactions to achieve better performance. However, most existing methods only use past information extracted from user historical interactions to train the models, leading to the deviations of user preference modeling. Besides past information, future information is also available during training, which contains the ''oracle'' user preferences in the future and will be beneficial to model dynamic user preferences. Therefore, we propose an oracle-guided dynamic user preference modeling method for sequential recommendation (Oracle4Rec), which leverages future information to guide model training on past information, aiming to learn ''forward-looking'' models. Specifically, Oracle4Rec first extracts past and future information through two separate encoders, then learns a forward-looking model through an oracle-guiding module which minimizes the discrepancy between past and future information. We also tailor a two-phase model training strategy to make the guiding more effective. Extensive experiments demonstrate that Oracle4Rec is superior to state-of-the-art sequential methods. Further experiments show that Oracle4Rec can be leveraged as a generic module in other sequential recommendation methods to improve their performance with a considerable margin.
Jiafeng Xia, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Li Shang 0001, Ning Gu 0001
WSDM5
2025 Filtering Discomforting Recommendations with Large Language Models
abstract
Personalized algorithms can inadvertently expose users to discomforting recommendations, potentially triggering negative consequences. The subjectivity of discomfort and the black-box nature of these algorithms make it challenging to effectively identify and filter such content. To address this, we first conducted a formative study to understand users' practices and expectations regarding discomforting recommendation filtering. Then, we designed a Large Language Model (LLM)-based tool named DiscomfortFilter, which constructs an editable preference profile for a user and helps the user express filtering needs through conversation to mask discomforting preferences within the profile. Based on the edited profile, DiscomfortFilter facilitates the discomforting recommendations filtering in a plug-and-play manner, maintaining flexibility and transparency. The constructed preference profile improves LLM reasoning and simplifies user alignment, enabling a 3.8B open-source LLM to rival top commercial models in an offline proxy task. A one-week user study with 24 participants demonstrated the effectiveness of DiscomfortFilter, while also highlighting its potential impact on platform recommendation outcomes. We conclude by discussing the ongoing challenges, highlighting its relevance to broader research, assessing stakeholder impact, and outlining future research directions.
Jiahao Liu 0009, Yiyang Shao, Peng Zhang 0060, Dongsheng Li 0002, Hansu Gu, Chao Chen 0016, Longzhi Du, Tun Lu, Ning Gu 0001
WWW3
2025 SoulSearch: applying heuristic optimization to enhance text-to-image generation with personalized human-LMM collaboration
Yubo Shu, Peng Zhang 0060, Hansu Gu, Yaqiong Li, Yiyang Shao, Tun Lu, Ning Gu 0001
Sci. China Inf. Sci.3
2025 Cultivating a Space for Learning: A Study of Note-Taking and Sharing on a Video-Sharing Platform Bilibili
abstract
Abstract Video-sharing platforms such as YouTube are popular today, not only for entertainment but also for learning, e.g., for understanding lecture content or acquiring everyday skills. Some platforms, like Bilibili, a popular video-sharing platform in China, even introduced note-taking and sharing features to further foster such learning practices. While note-taking and sharing have been extensively explored in environments specifically for learning, their use around these social media platforms such as YouTube and Bilibili remains under-studied. In this paper, we present a qualitative study with 15 participants who have used the note-taking and sharing feature called BNote launched on Bilibili. Our study reveals how note-taking and sharing are used as a way to cultivate a space for learning on such a general video-sharing platform by structuring, supplementing, and substituting user-generated videos and by leveraging social forces for motivation, self-discipline, and organization for learning. We end by discussing our findings and providing design recommendations to better support a learning space on social media platforms.
Fangyu Yu, Xianghua Ding, Peng Zhang 0060, Tun Lu, Ning Gu 0001
Comput. Support. Cooperative Work.3
2025 Addressing popularity discrepancy in collaborative filtering
Cizhou Yu, Dongsheng Li 0002, Hansu Gu, Peng Zhang 0060, Ning Gu 0001, Tun Lu
Knowl. Inf. Syst.4
2025 WePilot: Integrating Younger Family Members and Chatbot to Support Older Adults Learning Smartphone Usage
abstract
Older adults (OAs) usually face various challenges when using smartphones due to their limited knowledge and the declines in memory and information processing capabilities. Many studies in HCI and CSCW communities have focused on supporting OAs to independently use smartphones. However, compared to independent exploration, support from younger family members (YFMs) has specific advantages in problem understanding, solution personalization, and security protection. However, OAs and YFMs generally have gaps in time, knowledge, and experience, affecting the efficiency of support and their experience. For this problem, we conduct a formative study to gather insights into OAs and YFMs' perspectives and expectations in the supporting procedure. Then we introduce chatbot to mediate the gaps between OAs and YFMs and build a system named WePilot to assist them to collaboratively solve smartphone usage problems. Evaluations with 12 pairs of participants (OA and corresponding YFM) suggest WePilot's strengths in improving problem solving efficiency and OAs and YFMs' experience. Based on these findings, we propose several insights into the future design of intergenerational technical support systems.
Haonan Zhang 0001, Peng Zhang 0060, Yan Chen 0033, Meitong Guo, Hansu Gu, Tun Lu, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.2
2025 DeMod: A Holistic Tool with Explainable Detection and Personalized Modification for Toxicity Censorship
abstract
Although there have been automated approaches and tools supporting toxicity censorship for social posts, most of them focus on detection. Toxicity censorship is a complex process, wherein detection is just an initial task and a user can have further needs such as rationale understanding and content modification. For this problem, we conduct a need-finding study to investigate people's diverse needs in toxicity censorship and then build a ChatGPT-based censorship tool named DeMod accordingly. DeMod is equipped with the features of explainable De tection and personalized Mod ification, providing fine-grained detection results, detailed explanations, and personalized modification suggestions. We also implemented the tool and recruited 35 Weibo users for evaluation. The results suggest DeMod's multiple strengths like the richness of functionality, the accuracy of censorship, and ease of use. Based on the findings, we further propose several insights into the design of content censorship systems.
Yaqiong Li, Peng Zhang 0060, Hansu Gu, Tun Lu, Siyuan Qiao, Yubo Shu, Yiyang Shao, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.2
2025 Exploring Cross-Site User Modeling without Cross-Site User Identity Linkage: A Case Study of Content Preference Prediction
abstract
Performing user modeling on two or more social media platforms collaboratively and complementing each other (cross-site user modeling) has been a significant problem in the area of social media mining in recent years. The core of this problem is to get to know a person’s identities on multiple platforms and then train user models collaboratively among these platforms. However, for privacy protection, many people do not want their identities on different platforms to be linked and disclosed. For this problem, we set cross-site Content Preference Prediction as a task and propose a cross-site user modeling method without cross-site User Identity Linkage (UIL). The core thought borrowed from privacy-preserving recommender system research is to organize social media identities into groups to hide the identity linkage among platforms. Experiments on real-world datasets suggest that our method outperforms the existing cross-site user modeling methods with cross-site UIL regarding several metrics.
Peng Zhang 0060, Hansu Gu, Tun Lu, Ning Gu 0001
ACM Trans. Inf. Syst.2
2025 BNoteToDanmu: Category-Guided Note-to-Danmu Conversion Method for Learning on Video Sharing Platforms
abstract
Danmu (or “bullet screen”), a popular feature on video sharing platforms, plays a crucial role in facilitating knowledge sharing and learning. In recent years, danmu has drawn attention to automatic generation methods. However, existing methods mostly utilize limited content sources, such as the video itself (e.g., subtitles) and neighboring danmus, while other valuable sources remain underexplored. To this end, this article proposes a Category-Guided Note-to-Danmu conversion model (CG-NTD) by leveraging user-generated notes. The model is designed to identify unique contents within the notes and convert them into danmus while also showing the source note categories. CG-NTD classifies the notes by fusing them with subtitle and neighboring danmu features. Then, it uses a cross-attention mechanism to integrate the note’s category feature with note, subtitle, and danmu contexts to identify three keywords from the notes as the generated danmus. Using Bilibili as the research site, we implement a plugin prototype named BNoteToDanmu. Automatic and human evaluations reveal that CG-NTD outperforms BiLSTM, mT5, and BERT baselines in Precision, Recall, and F1-score metrics and generates more understandable and relevant danmus than ChatGPT. Moreover, the plugin demonstrates promising applications, such as assisting users in viewing videos, posting danmus, and recognizing high-quality notes. These findings offer insights into leveraging user creations to generate danmu to enhance its learning value on video sharing platforms.
Fangyu Yu, Peng Zhang 0060, Siyuan Qiao, Xianghua Ding, Tun Lu, Ning Gu 0001
ACM Trans. Web2
2024 Denevil: towards Deciphering and Navigating the Ethical Values of Large Language Models via Instruction Learning
abstract
Large Language Models (LLMs) have made unprecedented breakthroughs, yet their increasing integration into everyday life might raise societal risks due to generated unethical content. Despite extensive study on specific issues like bias, the intrinsic values of LLMs remain largely unexplored from a moral philosophy perspective. This work delves into ethical values utilizing Moral Foundation Theory. Moving beyond conventional discriminative evaluations with poor reliability, we propose DeNEVIL, a novel prompt generation algorithm tailored to dynamically exploit LLMs’ value vulnerabilities and elicit the violation of ethics in a generative manner, revealing their underlying value inclinations. On such a basis, we construct MoralPrompt, a high-quality dataset comprising 2,397 prompts covering 500+ value principles, and then benchmark the intrinsic values across a spectrum of LLMs. We discovered that most models are essentially misaligned, necessitating further ethical value alignment. In response, we develop VILMO, an in-context alignment method that substantially enhances the value compliance of LLM outputs by learning to generate appropriate value instructions, outperforming existing competitors. Our methods are suitable for black-box and open-source models, offering a promising initial step in studying the ethical values of LLMs.
Shitong Duan, Xiaoyuan Yi, Peng Zhang 0060, Tun Lu, Xing Xie 0001, Ning Gu 0001
ICLR3
2024 On the Essence and Prospect: An Investigation of Alignment Approaches for Big Models
Xinpeng Wang 0001, Shitong Duan, Xiaoyuan Yi, Jing Yao 0003, Shanlin Zhou, Zhihua Wei 0001, Peng Zhang 0060, Dongkuan Xu, Maosong Sun 0001, Xing Xie 0001
IJCAI7
2024 Neural Kalman Filtering for Robust Temporal Recommendation
abstract
Temporal recommendation methods can achieve superior accuracy due to updating user/item embeddings continuously once obtaining new interactions. However, the randomness of user behaviors will introduce noises into the user interactions and cause the deviation in the modeling of user preference, resulting in sub-optimal performance. To this end, we propose NeuFilter, a robust temporal recommendation algorithm based on neural Kalman Filtering, to learn more accurate user and item embeddings with noisy interactions. Classic Kalman Filtering is time-consuming when applied to recommendation due to its covariance matrices. Thus, we propose a neural network solution to Kalman Filtering, so as to realize higher efficiency and stronger expressivity. Specifically, NeuFilter consists of three alternating units: 1) prediction unit, which predicts user and item embeddings based on their historical embeddings; 2) estimation unit, which updates user and item embeddings in a manner similar to Kalman Filtering; 3) correction unit, which corrects the updated user and item embeddings from estimation unit to ensure reliable estimation and accurate update. Experiments on two recommendation tasks show that NeuFilter can achieve higher accuracy compared with the state-of-the-art methods, while achieving high robustness. Moreover, our empirical studies on a node classification task further confirm the importance of handling noises in tasks on temporal graph, shedding a new light on temporal graph modeling.
Jiafeng Xia, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Li Shang 0001, Ning Gu 0001
WSDM5
2024 Hierarchical Graph Signal Processing for Collaborative Filtering
abstract
Graph Signal Processing (GSP) has proven to be a highly effective and efficient tool for predicting user future interactions in recommender systems. However, current GSP methods recognize user interaction patterns based on the interactions of all users, so that the recognized interaction patterns are not fully user-matched and easily impacted by other users with different interaction behaviors, resulting in sub-optimal recommendation performance. To this end, we propose a hierarchical graph signal processing method (HiGSP) for collaborative filtering, which consists of two key modules: 1) the cluster-wise filter module that recognizes user unique interaction patterns merely from interactions of users with similar preferences, making the recognized patterns able to reflect user preference without being influenced by other users with different interaction behaviors, and 2) the globally-aware filter module that serves as a complementary to the cluster-wise filter module to recognize user general interaction patterns more effectively from all user interactions. By linearly combining these two modules, HiGSP can recognize user-matched interaction patterns, so as to model user preference and predict user future interactions more accurately. Extensive experiments on six real-world datasets demonstrate the superiority of HiGSP compared to other GCN-based and GSP-based recommendation methods in terms of efficacy and efficiency.
Jiafeng Xia, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Li Shang 0001, Ning Gu 0001
WWW5
2024 HCCKshell: A heterogeneous cross-comparison improved Kshell algorithm for Influence Maximization
abstract
Influence maximization (IM) has been extensively researched in the information propagation field and applied in various domains. However, existing studies on the IM have primarily focused on network structure, and lack the in-depth exploration of online network complexities, like personal history or preference. In this paper, a heterogeneous cross-comparison improved Kshell algorithm (HCCKshell) is proposed to solve IM, applying users’ multi-dimensional attributes in the propagation, including social history and topological structure . Specifically, the model learns users’ potential representation of historical content preferences and topological structure based on the Encoder and GCN thoughts, then defines the heterogeneous similarity and the heterogeneous information entropy to measure users’ influence ability and provide reliability assurance on the propagation. To improve the performance, a cross-comparison improved K-shell heuristic algorithm based on the heterogeneous information entropy is proposed to find a valid influential seed set. Furthermore, the experiments on multiple real large-scale datasets and their results indicate that our HCCKshell algorithm is more effective than baseline algorithms on both effect and performance.
Yaqiong Li, Tun Lu, Weimin Li 0001, Peng Zhang 0060
Inf. Process. Manag.4
2024 JargonFM: A Framework With Multiple Interpretation Modes for Jargon Understanding in Online Communities
abstract
Jargon words are commonly used in the communication of online communities. These words are characterized by special and implicit meanings that can only be comprehended by a small group of users, which brings challenges to community regulation and user engagement. For this problem, we present JargonFM, a framework with multiple interpretation modes for jargon understanding in online communities. JargonFM is designed based on the scientific explanation framework and supports three interpretation modes: jargon category prediction based on a jargon classifier, similar word identification based on a jargon synonyms selector, and representative text selection based on an example sentence selector. A jargon interpreter was also implemented to demonstrate the usage and usefulness of the interpretation framework. Automatic and human evaluations suggest that JargonFM can explain jargon words more accurately and more efficiently than the existing interpretation methods, leading to its wide acceptance among the evaluation participants.
Zhengqing Guan, Peng Zhang 0060, Hansu Gu, Tun Lu, Baoxi Liu, Ning Gu 0001
IEEE Trans. Comput. Soc. Syst.2
2024 RAH! RecSys-Assistant-Human: A Human-Centered Recommendation Framework With LLM Agents
abstract
The rapid evolution of the web has led to an exponential growth in content. Recommender systems play a crucial role in human–computer interaction (HCI) by tailoring content based on individual preferences. Despite their importance, challenges persist in balancing recommendation accuracy with user satisfaction, addressing biases while preserving user privacy, and solving cold-start problems in cross-domain situations. This research argues that addressing these issues is not solely the recommender systems’ responsibility, and a human-centered approach is vital. We introduce the recommender system, assistant, and human (RAH) framework, an innovative solution with large language model (LLM)-based agents such as perceive, learn, act, critic, and reflect, emphasizing the alignment with user personalities. The framework utilizes the learn-act-critic loop and a reflection mechanism for improving user alignment. Using the real-world data, our experiments demonstrate the RAH framework's efficacy in various recommendation domains, from reducing human burden to mitigating biases and enhancing user control. Notably, our contributions provide a human-centered recommendation framework that partners effectively with various recommendation models.
Yubo Shu, Haonan Zhang 0001, Hansu Gu, Peng Zhang 0060, Tun Lu, Dongsheng Li 0002, Ning Gu 0001
IEEE Trans. Comput. Soc. Syst.4
2024 BNoteHelper: A Note-based Outline Generation Tool for Structured Learning on Video-sharing Platforms
abstract
Usually generated by ordinary users and often not particularly designed for learning, the videos on video-sharing platforms are mostly not structured enough to support learning purposes, although they are increasingly leveraged for that. Most existing studies attempt to structure the video using video summarization techniques. However, these methods focus on extracting information from within the video and aiming to consume the video itself. In this article, we design and implement BNoteHelper, a note-based video outline prototype that generates outline titles by extracting user-generated notes on Bilibili, using the BART model fine-tuned on a built dataset. As a browser plugin, BNoteHelper provides users with video overview and navigation as well as note-taking template, via two main features: outline table and navigation marker. The model and prototype are evaluated through automatic and human evaluations. The automatic evaluation reveals that, both before and after fine-tuning, the BART model outperforms T5-Pegasus in BLEU and Perplexity metrics. Also, the results from user feedback reveal that the generation outline sourced from notes is preferred by users over that sourced from video captions due to its more concise, clear, and accurate characteristics but also too general with less details and diversities sometimes. Two features of the video outline are also found to have respective advantages, especially in holistic and fine-grained aspects. Based on these results, we propose insights into designing a video summary from the user-generated creation perspective, customizing it based on video types, and strengthening the advantages of its different visual styles on video-sharing platforms.
Fangyu Yu, Peng Zhang 0060, Xianghua Ding, Tun Lu, Ning Gu 0001
ACM Trans. Web2
2024 DeLink: An Adversarial Framework for Defending against Cross-site User Identity Linkage
abstract
Cross-site user identity linkage (UIL) aims to link the identities of the same person across different social media platforms. Social media practitioners and service providers can construct composite user portraits based on cross-site UIL, which helps understand user behavior holistically and conduct accurate recommendations and personalization. However, many social media users expect each profile to stay within the platform where it was created and thus do not want the identities of different platforms to be linked. For this problem, we first investigate the approaches people would like to use to defend against cross-site UIL and the corresponding challenges. Based on the findings, we build an adversarial framework, DeLink, based on the thoughts of adversarial text generation to help people improve their social media screen names to defend against cross-site UIL. DeLink can support both Chinese and English languages and has good generalizability to the varying numbers of social media accounts and different cross-site user identity linkage models. Extensive evaluations validate DeLink’s better performance, including a higher success rate, higher efficiency, less impact on human perception, and capability to defend against different cross-site UIL models.
Peng Zhang 0060, Tun Lu, Hansu Gu, Ning Gu 0001
ACM Trans. Web1
2023 AutoSeqRec: Autoencoder for Efficient Sequential Recommendation
abstract
Sequential recommendation demonstrates the capability to recommend items by modeling the sequential behavior of users. Traditional methods typically treat users as sequences of items, overlooking the collaborative relationships among them. Graph-based methods incorporate collaborative information by utilizing the user-item interaction graph. However, these methods sometimes face challenges in terms of time complexity and computational efficiency. To address these limitations, this paper presents AutoSeqRec, an incremental recommendation model specifically designed for sequential recommendation tasks. AutoSeqRec is based on autoencoders and consists of an encoder and three decoders within the autoencoder architecture. These components consider both the user-item interaction matrix and the rows and columns of the item transition matrix. The reconstruction of the user-item interaction matrix captures user long-term preferences through collaborative filtering. In addition, the rows and columns of the item transition matrix represent the item out-degree and in-degree hopping behavior, which allows for modeling the user's short-term interests. When making incremental recommendations, only the input matrices need to be updated, without the need to update parameters, which makes AutoSeqRec very efficient. Comprehensive evaluations demonstrate that AutoSeqRec outperforms existing methods in terms of accuracy, while showcasing its robustness and efficiency.
Sijia Liu 0001, Jiahao Liu 0009, Hansu Gu, Dongsheng Li 0002, Tun Lu, Peng Zhang 0060, Ning Gu 0001
CIKM6
2023 Towards Deeper, Lighter and Interpretable Cross Network for CTR Prediction
abstract
Click Through Rate (CTR) prediction plays an essential role in recommender systems and online advertising.It is crucial to effectively model feature interactions to improve the prediction performance of CTR models.However, existing methods face three significant challenges.First, while most methods can automatically capture high-order feature interactions, their performance tends to diminish as the order of feature interactions increases.Second, existing methods lack the ability to provide convincing interpretations of the prediction results, especially for high-order feature interactions, which limits the trustworthiness of their predictions.Third, many methods suffer from the presence of redundant parameters, particularly in the embedding layer.This paper proposes a novel method called Gated Deep Cross Network (GDCN) and a Field-level Dimension Optimization (FDO) approach to address these challenges.As the core structure of GDCN, Gated Cross Network (GCN) captures explicit high-order feature interactions and dynamically filters important interactions with an information gate in each order.Additionally, we use the FDO approach to learn condensed dimensions for each field based on their importance.Comprehensive experiments on five datasets demonstrate the effectiveness, superiority and interpretability of GDCN.Moreover, we verify the effectiveness of FDO in learning various dimensions and reducing model parameters.The code is available on https://github.com/anonctr/GDCN.
Fangye Wang, Hansu Gu, Dongsheng Li 0002, Tun Lu, Peng Zhang 0060, Ning Gu 0001
CIKM5
2023 Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendation
abstract
In dynamic interaction graphs, user-item interactions usually follow heterogeneous patterns, represented by different structural information, such as user-item co-occurrence, sequential information of user interactions and the transition probabilities of item pairs. However, the existing methods cannot simultaneously leverage all three structural information, resulting in suboptimal performance. To this end, we propose øurs, a triple structural information modeling method for accurate, explainable and interactive recommendation on dynamic interaction graphs. Specifically, øurs consists of 1) a dynamic ideal low-pass graph filter to dynamically mine co-occurrence information in user-item interactions, which is implemented by incremental singular value ecomposition (SVD); 2) a parameter-free attention module to capture sequential information of user interactions effectively and efficiently; and 3) an item transition matrix to store the transition probabilities of item pairs. Then, we fuse the predictions from the triple structural information sources to obtain the final recommendation results. By analyzing the relationship between the SVD-based and the recently emerging graph signal processing (GSP)-based collaborative filtering methods, we find that the essence of SVD is an ideal low-pass graph filter, so that the interest vector space in øurs can be extended to achieve explainable and interactive recommendation, making it possible for users to actively break through the information cocoons. Experiments on six public datasets demonstrated the effectiveness of øurs in accuracy, explainability and interactivity.
Jiahao Liu 0009, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Li Shang 0001, Ning Gu 0001
SIGIR5
2023 CL4CTR: A Contrastive Learning Framework for CTR Prediction
abstract
Many Click-Through Rate (CTR) prediction works focused on designing advanced architectures to model complex feature interactions but neglected the importance of feature representation learning, e.g., adopting a plain embedding layer for each feature, which results in sub-optimal feature representations and thus inferior CTR prediction performance. For instance, low frequency features, which account for the majority of features in many CTR tasks, are less considered in standard supervised learning settings, leading to sub-optimal feature representations. In this paper, we introduce self-supervised learning to produce high-quality feature representations directly and propose a model-agnostic Contrastive Learning for CTR (CL4CTR) framework consisting of three self-supervised learning signals to regularize the feature representation learning: contrastive loss, feature alignment, and field uniformity. The contrastive module first constructs positive feature pairs by data augmentation and then minimizes the distance between the representations of each positive feature pair by the contrastive loss. The feature alignment constraint forces the representations of features from the same field to be close, and the field uniformity constraint forces the representations of features from different fields to be distant. Extensive experiments verify that CL4CTR achieves the best performance on four datasets and has excellent effectiveness and compatibility with various representative baselines.
Fangye Wang, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Ning Gu 0001
WSDM6
2023 Personalized Graph Signal Processing for Collaborative Filtering
abstract
The collaborative filtering (CF) problem with only user-item interaction information can be solved by graph signal processing (GSP), which uses low-pass filters to smooth the observed interaction signals on the similarity graph to obtain the prediction signals. However, the interaction signal may not be sufficient to accurately characterize user interests and the low-pass filters may ignore the useful information contained in the high-frequency component of the observed signals, resulting in suboptimal accuracy. To this end, we propose a personalized graph signal processing (PGSP) method for collaborative filtering. Firstly, we design the personalized graph signal containing richer user information and construct an augmented similarity graph containing more graph topology information, to more effectively characterize user interests. Secondly, we devise a mixed-frequency graph filter to introduce useful information in the high-frequency components of the observed signals by combining an ideal low-pass filter that smooths signals globally and a linear low-pass filter that smooths signals locally. Finally, we combine the personalized graph signal, the augmented similarity graph and the mixed-frequency graph filter by proposing a pipeline consisting of three key steps: pre-processing, graph convolution and post-processing. Extensive experiments show that PGSP can achieve superior accuracy compared with state-of-the-art CF methods and, as a nonparametric method, PGSP has very high training efficiency.
Jiahao Liu 0009, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Li Shang 0001, Ning Gu 0001
WWW5
2023 Exploring How Workspace Awareness Cues Affect Distributed Meeting Outcome
abstract
Nowadays, using the online whiteboard to share knowledge in distributed meetings has become a common practice. Existing studies and practices have attempted to visualize attendees’ interactive activities in whiteboard tools to support the virtual team’s workspace awareness (WA). However, the impact of such visual cues on meeting success remains unclear. For this purpose, we primarily explore whether and to what extent WA cues are conducive to meeting outcome. This study applies activity theory to guide our prototype design and research analysis. A customized web-based whiteboard interface is implemented under two conditions. We conduct a study with 42 subjects in a distributed meeting scenario via a controlled experiment. Also, we analyze the system affordance via user experience. The results demonstrate that the benefits of WA cues to meeting outcome are especially embodied in goal attainment and quality of contributions, but not effectively supported in productivity and user satisfaction. Moreover, subjects report that they do not feel distracted by the system’s visual cues because they do not notice those cues most of the time and use them only when needed. Drawing upon findings from our trial work, we provide several implications for designing a collaborative knowledge-sharing environment to assist the visual support of WA in distributed meetings.
Fangyu Yu, Peng Zhang 0060, Xianghua Ding, Tun Lu, Ning Gu 0001
Int. J. Hum. Comput. Interact.2
2022 "As Uploaders, We Have the Responsibility": Individualized Professionalization of Bilibili Uploaders
abstract
The prevalence of social media blurs the boundaries between consumer and producer, work and play, and leads to new social roles, professions, and identities (e.g. blogger, YouTuber, micro-celebrity). However, we still lack a clear understanding of how people come to identify with these new roles and how individual professional development is digitally mediated. This paper presents a study based on Bilibili, a popular Chinese social media platform featuring user-generated videos, and highlights a professionalization process through which individuals consciously distinguish between the roles of uploaders and consumers, develop a shared work ethos around the role of the uploader, and, as uploaders, improve their technical-professional expertise. We conclude by discussing individualized professionalization as a concept that describes the bottom-up and community-based process of professional development for User Generated Content (UGC) taking place in contemporary digital media environments.
Xianghua Ding, Yubo Kou, Peng Zhang 0060
CHI4
2022 Understanding News Background Information Seeking from Readers' Perspective
abstract
Background information is very important for news reading and understanding, especially with today’s rapid new media development for news production and consumption. When researchers actively develop tools to automatically provide back-ground information for people, we still have little understanding of how people, from readers’ perspective, engage with news and what background information is needed. To address such a gap, we conducted a study with a news reading platform, observed participants’ news reading behaviors using the platform and interviewed them over the process. Our study highlighted that news reading is a learning activity between leisure and study, and their background information searching behavior is part of Gestalt knowing – to make their existing knowledge more complete, by deepening their prior understandings, broadening their horizons, filling the gaps, clearing their confusion, as well as tracking the progress of an event as a whole, so a more holistic understanding could be achieved. We end by discussing implications of our findings.
Zhenni Feng, Xianghua Ding, Yanqi Jiang, Yiying Wu, Peng Zhang 0060
CSCWD5
2022 Predicting Rollback Edits on Stack Overflow Based on Deep Fusion of Metadata and Text
abstract
Online question and answer (Q&A) communities have become an important platform for sharing and gaining knowledge. To ensure the quality of posts, Q&A sites support and encourage collaborative editing. However, some undesired, inaccurate, or poor quality edits will be rejected by rollbacks. Most Q&A communities identify rollback edits by human review, which is not efficient and timely enough. To address this problem, we aim to construct a model that can automatically predict whether an edit should be rolled back. Considering that in addition to changing the content of a post, editing activities usually generate metadata information. Therefore, we first conduct an empirical study to investigate the metadata factors that may be associated with edit rollbacks. The analysis results indicate that metadata features from multiple dimensions have different levels of significant effects on edit rollback, and edit textual contents are dependent on metadata. Based on these results, we propose a deep learning model, namely DFMT (Deep Fusion of Metadata and Text), for rollback prediction. Experimental results on a real Stack Overflow dataset demonstrates the effectiveness of DFMT compared to several baselines.
Peng Zhang 0060, Tun Lu, Ning Gu 0001
CSCWD2
2022 Team Formation and Task Recommendation for Disabled People in Crowdsourcing Systems
abstract
The barrier-free map is a new type of map, the demand for which is increasing in modern society, and it is necessary to rely on crowdsourcing platforms to complete the labeling work of barrier-free facilities. Nowadays more people with disabilities are participating in crowdsourcing work. They tend to work with familiar people and hope to maximize their value. However, there is very little research about automatic management of organizations and tasks for the disabled to assist them to complete the work on the crowdsourcing platform. In this paper, we design a new team formation method based on the theory of socially embedded work of the disabled (TFSEW) and a bi-objective task recommendation method (BOTR), in order to ensure the efficiency of task completion and promote the participation of the disabled, thereby realizing their value in the work environment. Our method proves to be superior through experiments. At the same time, through questionnaire, people with disabilities show great anticipation for participating in the tasks in form of team and receive tasks recommended by the system.
Yifan Liang, Zongzheng Zou, Peng Zhang 0060, Dongsheng Li 0002, Tun Lu, Ning Gu 0001
CSCWD3
2022 MCRF: Enhancing CTR Prediction Models via Multi-channel Feature Refinement Framework
Fangye Wang, Hansu Gu, Dongsheng Li 0002, Tun Lu, Peng Zhang 0060, Ning Gu 0001
DASFAA (2)5
2022 TxChain: Scaling Sharded Decentralized Ledger via Chained Transaction Sequences
Peng Zhang 0060, Tun Lu, Ning Gu 0001
DASFAA (1)3
2022 Parameter-free Dynamic Graph Embedding for Link Prediction
abstract
Dynamic interaction graphs have been widely adopted to model the evolution of user-item interactions over time. There are two crucial factors when modelling user preferences for link prediction in dynamic interaction graphs: 1) collaborative relationship among users and 2) user personalized interaction patterns. Existing methods often implicitly consider these two factors together, which may lead to noisy user modelling when the two factors diverge. In addition, they usually require time-consuming parameter learning with back-propagation, which is prohibitive for real-time user preference modelling. To this end, this paper proposes FreeGEM, a parameter-free dynamic graph embedding method for link prediction. Firstly, to take advantage of the collaborative relationships, we propose an incremental graph embedding engine to obtain user/item embeddings, which is an Online-Monitor-Offline architecture consisting of an Online module to approximately embed users/items over time, a Monitor module to estimate the approximation error in real time and an Offline module to calibrate the user/item embeddings when the online approximation errors exceed a threshold. Meanwhile, we integrate attribute information into the model, which enables FreeGEM to better model users belonging to some under represented groups. Secondly, we design a personalized dynamic interaction pattern modeller, which combines dynamic time decay with attention mechanism to model user short-term interests. Experimental results on two link prediction tasks show that FreeGEM can outperform the state-of-the-art methods in accuracy while achieving over 36X improvement in efficiency. All code and datasets can be found in https://github.com/FudanCISL/FreeGEM.
Jiahao Liu 0009, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Ning Gu 0001
NeurIPS5
2022 Enhancing CTR Prediction with Context-Aware Feature Representation Learning
abstract
CTR prediction has been widely used in the real world. Many methods model feature interaction to improve their performance. However, most methods only learn a fixed representation for each feature without considering the varying importance of each feature under different contexts, resulting in inferior performance. Recently, several methods tried to learn vector-level weights for feature representations to address the fixed representation issue. However, they only produce linear transformations to refine the fixed feature representations, which are still not flexible enough to capture the varying importance of each feature under different contexts. In this paper, we propose a novel module named Feature Refinement Network (FRNet), which learns context-aware feature representations at bit-level for each feature in different contexts. FRNet consists of two key components: 1) Information Extraction Unit (IEU), which captures contextual information and cross-feature relationships to guide context-aware feature refinement; and 2) Complementary Selection Gate (CSGate), which adaptively integrates the original and complementary feature representations learned in IEU with bit-level weights. Notably, FRNet is orthogonal to existing CTR methods and thus can be applied in many existing methods to boost their performance. Comprehensive experiments are conducted to verify the effectiveness, efficiency, and compatibility of FRNet.
Fangye Wang, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Ning Gu 0001
SIGIR6
2022 A Personalized Cross-Platform Post Style Transfer Method Based on Transformer and Bi-Attention Mechanism
abstract
To meet different social purposes, users usually share content related to the same topic or event to multiple social media platforms (cross-platform content sharing). As the differences of social norms and audiences among these social ecosystems, there are differences in the use of words and expressions in different platforms, resulting in different language styles among different platforms. In reality, it is usually difficult for users to grasp the consistency between the language style of posts to be published and that of a platform as the problem of context collapse. To address this problem, firstly, we conduct an study to investigate users' content sharing practices across two Chinese popular social media platforms (Douban and Weibo). The results indicate that: 1) there are significant linguistic differences between different platforms; 2) users' content sharing practices are personalized, and the style of their newly shared content is correlated with their historical posts. Secondly, based on the above findings, we propose a personalized cross-platform post style transfer model. The model can automatically transfer users' posts from one platform's language style to the target platform's language style, while preserving the content and reflecting users' personalized characteristics as much as possible. Experiments on the datasets collected from Douban and Weibo show that our model generally outperforms other comparison models on both style transfer and personalization metrics.
Baoxi Liu, Peng Zhang 0060, Tun Lu, Hansu Gu, Ning Gu 0001
WSDM3
2022 Cross-modal Ambiguity Learning for Multimodal Fake News Detection
abstract
Cross-modal learning is essential to enable accurate fake news detection due to the fast-growing multimodal contents in online social communities. A fundamental challenge of multimodal fake news detection lies in the inherent ambiguity across different content modalities, i.e., decisions made from unimodalities may disagree with each other, which may lead to inferior multimodal fake news detection. To address this issue, we formulate the cross-modal ambiguity learning problem from an information-theoretic perspective and propose CAFE — an ambiguity-aware multimodal fake news detection method. CAFE consists of 1) a cross-modal alignment module to transform the heterogeneous unimodality features into a shared semantic space, 2) a cross-modal ambiguity learning module to estimate the ambiguity between different modalities, and 3) a cross-modal fusion module to capture the cross-modal correlations. CAFE improves fake news detection accuracy by judiciously and adaptively aggregating unimodal features and cross-modal correlations, i.e., relying on unimodal features when cross-modal ambiguity is weak and referring to cross-modal correlations when cross-modal ambiguity is strong. Experimental studies on two widely used datasets (Twitter and Weibo) demonstrate that CAFE outperforms state-of-the-art fake news detection methods by 2.2-18.9% and 1.7-11.4% on accuracy, respectively.
Yixuan Chen 0003, Dongsheng Li 0002, Peng Zhang 0060, Jie Sui, Qin Lv, Tun Lu
WWW3
2022 An AST-based consistency maintenance scheme for cross-chain digital assets
Chaofan Liu, Peng Zhang 0060, Tun Lu, Ning Gu 0001
CCF Trans. Pervasive Comput. Interact.4
2022 A Semantic Embedding Enhanced Topic Model For User-Generated Textual Content Modeling In Social Ecosystems
abstract
Abstract The development of Information and Communication Technologies (ICT) and Web 2.0 promotes the emergence of diverse social ecosystems like social Internet of Things (IoT), social media and online communities. User-generated textual content (UGTC), which consists of unstructured texts, is the most important and common type of user-generated content in social ecosystems. UGTC in social ecosystems is generated according to two types of context information—global context (topics) and local context (semantic regularities). For UGTC modeling, topic models just consider global context but ignore semantic regularities, while semantic embedding models are on the opposite. So only utilizing topic models or semantic embedding models to model UGTC suffers from some drawbacks. For this problem, we propose a semantic embedding enhanced topic model named SEE-Twitter-LDA for accurately modeling UGTC in social ecosystems. The core of SEE-Twitter-LDA is that words are generated according to mutual semantic information of topics and semantic regularities. So global context and local context are jointly considered for UGTC modeling. By utilizing 553 098 tweets sampled from Twitter and 211 233 posts sampled from Weibo, we validate SEE-Twitter-LDA’s better performance on perplexity, topic divergence and topic coherence versus existing related models.
Peng Zhang 0060, Baoxi Liu, Tun Lu, Hansu Gu, Xianghua Ding, Ning Gu 0001
Comput. J.1
2022 Building a Personalized Model for Social Media Textual Content Censorship
abstract
Social media users often suffer from the problem of content over-disclosure. Most existing studies attempt to solve this problem by recommending proper audiences for users when sharing content. However, the audience management strategy cannot filter out sensitive information from the post and narrow the scope of content permeation. On the contrary, this paper conducts research from the content perspective and aims to design a content censorship model to help users evaluate the publicity of a post and find the sensitive information from it. The user can revise the content accordingly to achieve goals of sensitive information protection and broader content permeation. For this intention, we first built a dataset to explore the factors related to the public level of a post and the sensitive information. Based on the findings, a novel personalized multi-task content censorship model was built using several state-of-the-art deep learning techniques such as Seq2Seq and Co-training. We also implemented a prototype, i.e. a Browser plugin-based content censorship tool, by utilizing Weibo as a research site. Our model and its prototype were evaluated through automatic and human evaluations. The automatic evaluation suggests that our model outperforms the baseline methods on several metrics including precision, recall, and F1-score. The human evaluation also reveals that our model and prototype play an important role in helping users identify sensitive information. Based on these results, we proposed several insights for the future design of the social media content censorship system.
Baoxi Liu, Peng Zhang 0060, Yubo Shu, Zhengqing Guan, Tun Lu, Hansu Gu, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.2
2022 Alignment Work for Urban Accessibility: A Study of How Wheelchair Users Travel in Urban Spaces
abstract
Mobility is the key for people with disabilities to have full participation in life. To support their mobility, previous work primarily focused on accessibility as an attribute of the external environment to be evaluated, labeled, visualized, and improved. Relatively less work has looked at how people with disabilities go out and move around in practice and work to achieve mobility. This paper presents a qualitative study of 14 wheelchair users' travel practices in everyday life in China, highlighting urban accessibility as alignment work -- the use of an awareness of the conditions along the journey to continuously align and re-align various resources to ensure accessibility and mobility across contexts and moments. By highlighting alignment work, we present another side of the story of urban accessibility, and broaden design considerations to support mobility for wheelchair users.
Yiying Wu, Xianghua Ding, Xuelan Dai, Peng Zhang 0060, Tun Lu, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.4
2022 Building User-oriented Personalized Machine Translator based on User-Generated Textual Content
abstract
Machine Translation (MT) has been a very useful tool to assist multilingual communication and collaboration. In recent years, by taking advantage of the exciting developments of neural networks and deep learning, the accuracy and speed of machine translation have been continuously improved. However, most machine translation methods and systems are data-driven. They tend to select a consensus response represented in training data, while a user's preferred linguistic style, which is important for translation comprehension and user experience, is ignored. For this problem, we aim to build a user-oriented personalized machine translation model in this paper. The model aims to learn each user's linguistic style from the textual content that is generated by her/him (User-Generated Textual Content, UGTC) in social media context and generate personalized translation results utilizing several state-of-the-art deep learning techniques like Transformer and pre-training. We also implemented a user-oriented personalized machine translator using Weibo as a case of the source of UGTC to provide a systematical implementation scheme of a user-oriented personalized machine translation system based on our model. The translator was evaluated by automatic evaluation in combination with human evaluation. The results suggest that our model can generate more personalized, natural and lively translation results and enhance the comprehensibility of translation results, which makes its generations more preferred by users versus general translation results.
Peng Zhang 0060, Zhengqing Guan, Baoxi Liu, Xianghua Ding, Tun Lu, Hansu Gu, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.1
2022 Jointly Predicting Future Content in Multiple Social Media Sites Based on Multi-task Learning
abstract
User-generated contents (UGC) in social media are the direct expression of users’ interests, preferences, and opinions. User behavior prediction based on UGC has increasingly been investigated in recent years. Compared to learning a person’s behavioral patterns in each social media site separately, jointly predicting user behavior in multiple social media sites and complementing each other (cross-site user behavior prediction) can be more accurate. However, cross-site user behavior prediction based on UGC is a challenging task due to the difficulty of cross-site data sampling, the complexity of UGC modeling, and uncertainty of knowledge sharing among different sites. For these problems, we propose a Cross-Site Multi-Task (CSMT) learning method to jointly predict user behavior in multiple social media sites. CSMT mainly derives from the hierarchical attention network and multi-task learning. Using this method, the UGC in each social media site can obtain fine-grained representations in terms of words, topics, posts, hashtags, and time slices as well as the relevances among them, and prediction tasks in different social media sites can be jointly implemented and complement each other. By utilizing two cross-site datasets sampled from Weibo, Douban, Facebook, and Twitter, we validate our method’s superiority on several classification metrics compared with existing related methods.
Peng Zhang 0060, Baoxi Liu, Tun Lu, Xianghua Ding, Hansu Gu, Ning Gu 0001
ACM Trans. Inf. Syst.1
2021 Data Engagement Reconsidered: A Study of Automatic Stress Tracking Technology in Use
abstract
In today’s fast-paced world, stress has become a growing health concern. While more automatic stress tracking technologies have recently become available on wearable or mobile devices, there is still a limited understanding of how they are actually used in everyday life. This paper presents an empirical study of automatic stress-tracking technologies in use in China, based on semi-structured interviews with 17 users. The study highlights three challenges of stress-tracking data engagement that prevent effective technology usage: the lack of immediate awareness, the lack of pre-required knowledge, and the lack of corresponding communal support. Drawing on the stress-tracking practices uncovered in the study, we bring these issues to the fore, and unpack assumptions embedded in related works on self-tracking and how data engagement is approached. We end by calling for a reconsideration of data engagement as part of self-tracking practices with technologies rather than simply looking at the user interface.
Xianghua Ding, Shuhan Wei, Xinning Gui, Ning Gu 0001, Peng Zhang 0060
CHI5
2021 Incremental Graph Convolutional Network for Collaborative Filtering
abstract
Graph neural networks (GNN) recently achieved huge success in collaborative filtering (CF) due to the useful graph structure information. However, users will continuously interact with items, which causes the user-item interaction graphs to change over time and well-trained GNN models to be out-of-date soon. Naive solutions such as periodic retraining lose important temporal information and are computationally expensive. Recent works that leverage recurrent neural networks to keep GNN up-to-date may suffer from the "catastrophic forgetting'' issue, and experience a cold start with new users and items. To this end, we propose the incremental graph convolutional network (IGCN) --- a pure graph convolutional network (GCN) based method to update GNN models when new user-item interactions are available. IGCN consists of two main components: 1) a historical feature generation layer, which generates the initial user/item embedding via model agnostic meta-learning and ensures good initial states and fast model adaptation; 2) a temporal feature learning layer, which first aggregates the features from local neighborhood to update the embedding of each user/item within each subgraph via graph convolutional network and then fuses the user/item embeddings from last subgraph and current subgraph via incremental temporal convolutional network. Experimental studies on real-world datasets show that IGCN can outperform state-of-the-art CF algorithms in sequential recommendation tasks.
Jiafeng Xia, Dongsheng Li 0002, Hansu Gu, Tun Lu, Peng Zhang 0060, Ning Gu 0001
CIKM5
2021 ProvSum4MC: A Novel Provenance Summarization Approach for Multidisciplinary Collaboration
abstract
Multidisciplinary provenance helps to record the detailed processes about data derivation during multidisciplinary collaboration, which is vital to result reproducibility, trustworthiness reinforcement and other further usage. However, too detailed multidisciplinary provenance information often overwhelms user due to provenance bushiness, provenance deepness and semantic complexity. This paper presents a summarization approach to simplify provenance information based on homogeneity and semantic distance. We first specify a collaborative provenance model to records multidisciplinary collaboration processes. By analyzing the difficulties of understanding multidisciplinary provenance information, a multi-granular provenance summarization approach is given. Finally, discipline-specified provenance views are provided to meet different concerns. Experimental analysis shows the effectiveness our approach from the perspectives of conciseness.
Beisi Zhou, Tun Lu, Fangyu Yu, Peng Zhang 0060, Ning Gu 0001
CSCWD4
2021 URIM: Utility-Oriented Role-Centric Incentive Mechanism Design for Blockchain-Based Crowdsensing
Chaofan Liu, Peng Zhang 0060, Tun Lu, Ning Gu 0001
DASFAA (3)3
2021 SANS: Setwise Attentional Neural Similarity Method for Few-Shot Recommendation
Tun Lu, Dongsheng Li 0002, Peng Zhang 0060, Hansu Gu, Ning Gu 0001
DASFAA (3)4
2021 Studying and Understanding Characteristics of Post-Syncing Practice and Goal in Social Network Sites
abstract
Many popular social network sites (SNSs) provide the post-syncing functionality, which allows users to synchronize posts automatically among different SNSs. Nowadays there exists divergence on this functionality from the view of sink SNS. The key to solving this problem is to understand the characteristics of users’ post-syncing practice and goals and evaluate whether they are consistent with an SNS’s norms, cultures, and goals. However, studying and understanding the characteristics of post-syncing practice and goal are challenging tasks as a result of the difficulty of data sampling and the complexity of post-syncing behavior. In this article, we focus on investigating this question by quantitative analysis in combination with qualitative analysis. In the quantitative study, by utilizing 211,233 synced-posts sampled from Weibo, we aim to investigate characteristics of post-syncing from three perspectives: user, content, and goal. The results suggest that post-syncing plays an important role in exhibiting one’s current activities, creations, and skills as well as advertisements but involves a risk of exhibiting personal sensitive profiles. To understand the results, we present an interview-based qualitative study based on thematic analysis. It indicates that the publicity, urgency, and remarkableness of contents and differences of social affordances and social circles between sink SNS and source SNS as well as the one-time consent of post-syncing authentication jointly account for the major role of post-syncing. Based on these results, we propose insights for post-syncing functionality’s adoption, design, and promotion.
Peng Zhang 0060, Baoxi Liu, Xianghua Ding, Tun Lu, Hansu Gu, Ning Gu 0001
ACM Trans. Web1
2020 Domain problem-solving expert identification in community question answering
abstract
Abstract Question‐Answering (Q&A) services provide internet users with platforms to exchange knowledge and ideas. The development of Q&A sites, or Community Question Answering (CQA), mainly depends on the high‐quality content continuously contributed by users with high‐level expertise, who can be recognized as experts. Expert finding is an important task for the authorities of Q&A communities to encourage commitment. In a highly competitive market environment, CQA managers have to take measures to retain and nurture users, especially superior contributors. However, current expertise scoring techniques adopted in CQA often give much credit to very active users and fail to identify real experts. This study aims to develop a robust and practical expert identification framework for Q&A communities, by combining well‐designed expertise scoring technique and probabilistic clustering model. With regard to expert identification, a numerical metric of users' expertise is developed as the optimal expert finding strategy, and a clustering algorithm based on Gaussian‐Gamma mixture model (GGMM) is proposed to efficiently distinguish experts from nonexperts. In the experiments, the proposed method is applied to real‐world datasets collected from subcommunities of Stack Exchange Q&A networks. Results obtained from comparative experiments show that our method achieves better performance than the state‐of‐the‐art methods and demonstrate the effectiveness of the proposed framework. The analysis shows that the framework which combines the proposed expertise scoring technique and Gaussian–Gamma mixture clustering model is capable of detecting excellent domain problem‐solving experts who exhibit both domain interest and expertise.
Weizhao Tang, Tun Lu, Hansu Gu, Peng Zhang 0060, Ning Gu 0001
Expert Syst. J. Knowl. Eng.4
2020 Understanding Social Interaction across Social Network Sites
abstract
People tend to utilize multiple social network sites (SNSs) simultaneously to maintain some social relationships, which results that there are many overlapping relationships and interactions among SNSs. Although many studies have focused on social interaction and cross-SNS user footprint analysis and understanding, little research investigates social interaction from a perspective of two or more SNSs, and the interplay of interaction among SNSs has been unknown. In this paper, we aim to explore whether interaction building in a new SNS hinders the interaction frequency in an existing site, and if so, what kinds of users and relationships’ interactions are more or less likely to be affected. For these questions, we sampled 7,015 pairs of overlapping identities, 23,590 pairs of overlapping relationships and 6,771 pairs of overlapping interactions from Weibo and Douban and made analysis by combining multiple methods like Regression Discontinuity Design and Random-effects Negative Binomial Regression model. Our results suggest that no matter from the perspective of individuals or from the perspective of relationships, interaction construction in a new SNS is detrimental to interaction frequency in an existing site. Based on our findings, we also propose several valuable insights about how to enhance social interaction and promote its retention when users are involved into interacting practice in multiple platforms.
Peng Zhang 0060, Tun Lu, Baoxi Liu, Hansu Gu, Ning Gu 0001
Int. J. Hum. Comput. Interact.1
2020 A reliable cross-site user generated content modeling method based on topic model
Baoxi Liu, Peng Zhang 0060, Tun Lu, Ning Gu 0001
Knowl. Based Syst.2
2020 Exploring Antecedents and Consequences of Toxicity in Online Discussions: A Case Study on Reddit
abstract
Toxicity in online discussions has been an intriguing phenomenon and an important problem. In this paper, we seek to better understand toxicity dynamics in online discussions via a case study on Reddit that explores the antecedents and consequences of toxicity in text. We inspected two dimensions of toxicity: language toxicity, i.e. how toxic the text itself is; and toxicity elicitation, i.e. how much toxicity it elicits in its response. Through regression analyses on Reddit comments, we found that both author propensity and toxicity in discussion context were strong positive antecedents of language toxicity; meanwhile, language toxicity significantly increased the volume and user evaluation of the discussion in some sub-communities, while toxicity elicitation showed mixed effects. We then discuss how our results help understand and regulate toxicity in online discussions by interpreting the complicated triggers and outcomes of toxicity.
Haiyi Zhu, Tun Lu, Peng Zhang 0060, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.4
2018 Exploring the Effect of Politeness on User Contribution in Q&A sites: A Case Study of Stack Overflow
abstract
Online question and answer (Q&A) sites are platforms allowing users to seek information or social support, which is sometimes socially uncomfortable. A major challenge in Q&A sites is how to encourage user contribution. Theory of linguistic politeness informs us that politeness is able to ease the tension resulting from face-threatening acts (FTA), and it is applicable to Q&A sites. However, Stack Overflow (SO), one of the most popular Q&A site for programmers, denies the use of linguistic politeness (e.g., greetings, salutations, and gratitude expressions), aiming at building a nonsocial platform. This paper focuses on a specific politeness strategy-expressing gratitude-in Q&A sites, and examines its effect on answerers' future contributions from the aspects of quality. Results indicate that gratitude expressions in comments can motivate answerers to generate higher quality content.
Yiru Fangl, Tun Lu, Peng Zhang 0060, Hansu Gu, Ning Gu 0001
CSCWD3
2017 Credit scoring using ensemble classification based on variable weighting clustering
abstract
Credit scoring plays an important role in financial institutions and debt based crowdfunding platforms as well as peer to peer lending platforms. In the last few years, adopting ensemble methods for credit scoring has become much more popular. However, the performance of ensemble methods is easily affected by the parameter settings and the number of base classifiers. Ensemble classification based on clustering is able to determine the best number of base classifiers automatically by clustering and find optimal parameter settings for base classifiers by training them individually on the training subsets combined by clusters. By this way, the adverse effect of manually setting the parameters and the number of base classifiers can be avoided. However, the different contributions of attributes to the distance metrics are not considered in conventional clustering methods, which may decrease the performance of ensemble classifiers based on them. Moreover, unbalanced training subsets decrease the performance of base classifiers, which results in the bad performance of ensemble classifiers. In our approach, to address the above problems, we first assign different weights to different variables when measuring the distance between two instances in the clustering step, and then adopt Subagging resampling method to deal with unbalanced training subsets in the training process. Experimental results show that our approach can improve the performance of the ensemble classifier.
Haiyang Ding, Peng Zhang 0060, Tun Lu, Hansu Gu, Ning Gu 0001
CSCWD2
2017 Multi-task matrix factorization for collaborative filtering
abstract
Collaborative Filtering (CF) is widely applied to personalized recommendation systems. Traditional collaborative filtering techniques make predictions through a user-item matrix of ratings which explicitly presents user preference. With the increasingly growing number of users and items, insufficient rating data still leads to the decreasing predictive accuracy with traditional collaborative filtering approaches. In the real world, however, many different types of user feedback, e.g. review, like or not, votes etc., co-exist in many online content providers. In this paper we integrate rating data with some other new types of user feedback and propose a multi-task matrix factorization model in order for flexibly using multiple data. We use a common user feature space shared across sub-models in this model and thus the model can simultaneously train the corresponding sub-models with every training sample. Our experiments indicate that new types of user feedback really work and show improvements on predictive accuracy compared to state-of-the-art algorithms.
Wanlu Shi, Tun Lu, Dongsheng Li 0002, Peng Zhang 0060, Ning Gu 0001
CSCWD4
2017 Hybrid recommendation model based on incremental collaborative filtering and content-based algorithms
abstract
In the past decade, online news consumption has been steadily growing. New articles are published every few minutes, and user preferences are also constantly changing. Traditional recommender systems update model at regular intervals, which cannot adjust recommendation list dynamically according to the changes of user preferences. In this paper, we propose a hybrid recommendation model which contains two key components: incremental update item-based collaborative filtering (CF) and latent semantic analysis based relative term frequency algorithms. The hybrid recommendation model adjusts recommendation list dynamically by updating similarity table of items incrementally in incremental update item-based CF module, moreover, combining collaborative filtering and content-based algorithm ensures the relevance of recommendation articles. Results show that our proposed hybrid recommendation model outperforms traditional recommender approaches.
Peng Zhang 0060, Tun Lu, Hansu Gu, Ning Gu 0001
CSCWD2
2017 Understanding Relationship Overlapping on Social Network Sites: A Case Study of Weibo and Douban
abstract
Nowadays people have many overlapping relationships across different social network sites. Will the communication frequency of a relationship on a focal SNS increase or decrease after the corresponding parties begin interacting with each other on a new SNS? What kinds of relationships and parties on the focal SNS are more robust to relationship overlapping across different sites? We conducted a case study on two Chinese popular social network sites (Weibo and Douban). Our results indicate that relationships' interactions on a new SNS have negative effect on the parties' communication frequency on the focal SNS. The communication frequency of older relationships on the focal SNS is more susceptible to the influence of the interacting on the new SNS, while relationships with more common groups and more extensive posts are less likely to be influenced. Our findings imply opportunities for SNS designers to strengthen their existing fragile ties and help users to build much more robust relationships.
Peng Zhang 0060, Haiyi Zhu, Tun Lu, Hansu Gu, Ning Gu 0001
Proc. ACM Hum. Comput. Interact.1
2016 Behavior prediction using an improved Hidden Markov Model to support people with disabilities in smart homes
abstract
Smart environment has been evolved as a hot research topic with the development of machine learning algorithms and wireless communication technologies. Existing smart home solutions usually need inhabitants to operate device controllers directly. However, for people with disabilities, it is inconvenient and difficult to perform such manual operations. Therefore, it is important to develop automatic and intelligent services to reduce operation inconvenience and improve comfort level. In this paper, an Improved Hidden Markov Model (IHMM) is presented to support personalized behavior prediction for people with disabilities. The model can learn behavior patterns of users and provide services to inhabitants automatically. Moreover, by breaking the time invariant hypothesis in Hidden Markov Model, we incorporate time information as positions of states, and develop a temporal state transition matrix to replace the fixed state transition matrix to demonstrate the probabilities of state transitions. As a result, different values of daily temperature sections are characterized and identified as hidden variables, which guide user activities. Evaluation of proposed work has shown that IHMM improves the prediction accuracy by at least 10% compared to the traditional HMM.
Eying Wu, Peng Zhang 0060, Tun Lu, Hansu Gu, Ning Gu 0001
CSCWD2
2016 Group-based Latent Dirichlet Allocation (Group-LDA): Effective audience detection for books in online social media
Peng Zhang 0060, Hansu Gu, Mike Gartrell, Tun Lu, Dayi Yang, Xianghua Ding, Ning Gu 0001
Knowl. Based Syst.1