Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yuan Yuan 0032
dblp:64/5845-32
· DBLP profile ↗
20ranked-venue papers
10as first author
20since 2021 · last 2026
0000-0003-1701-2588ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 15 · 7 first-author · 15 since 2021Artificial intelligence and machine learning · 9 · 5 first-author · 9 since 2021Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author · 5 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
13 papers |
Generative modeling · 22% Reinforcement learning · 17% Deep learning architectures and training · 16% | |
| Interdisciplinary, comprehensive, and emerging computing
7 papers |
Smart cities and intelligent transportation · 94% Medical and health informatics · 3% Computational social science and digital humanities · 3% | |
| Databases, data mining, and information retrieval
6 papers |
Data mining · 52% Data integration and cleaning · 23% Recommender systems · 13% |
Topics — the 27 heaviest of 34, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
2.5 | 4 | 2025 | Noise Matters: Diffusion Model-based Urban Mobility Generation with Collaborative Noise Priors · WWW 2025 Spatio-Temporal Few-Shot Learning via Diffusive Neural Network Generation · ICLR 2024 Spatio-temporal Diffusion Point Processes · KDD 2023 |
Smart cities and intelligent transportation › spatio-temporal prediction
urban spatio-temporal prediction |
1.6 | 2 | 2025 | A Universal Pre-Training and Prompting Framework for General Urban Spatio-Temporal Prediction · IEEE Trans. Knowl. Data Eng. 2025 UniST: A Prompt-Empowered Universal Model for Urban Spatio-Temporal Prediction · KDD 2024 |
Machine learning › Deep learning architectures and training › transformer
spatio-temporal transformer |
1.0 | 1 | 2026 | UniFlow: A Foundation Model for Unified Urban Spatio-Temporal Flow Prediction · IEEE Trans. Mob. Comput. 2026 |
Machine learning › Deep learning architectures and training
transformer |
1.0 | 1 | 2026 | UniFlow: A Foundation Model for Unified Urban Spatio-Temporal Flow Prediction · IEEE Trans. Mob. Comput. 2026 |
Data integration and cleaning › data generation
synthetic data generation |
1.0 | 1 | 2026 | Generating Realistic Human Mobility Data with Hybrid Large Language Model Agent · KDD (1) 2026 |
Machine learning › Reinforcement learning › reward learning
reward modeling |
0.9 | 1 | 2025 | Reinforcement Learning with Adaptive Reward Modeling for Expensive-to-Evaluate Systems · ICML 2025 |
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning |
0.9 | 1 | 2025 | Reinforcement Learning with Adaptive Reward Modeling for Expensive-to-Evaluate Systems · ICML 2025 |
Smart cities and intelligent transportation › spatio-temporal prediction
human mobility prediction |
0.9 | 1 | 2025 | A Universal Model for Human Mobility Prediction · KDD (1) 2025 |
Smart cities and intelligent transportation › spatio-temporal prediction
trajectory prediction |
0.9 | 1 | 2025 | A Universal Model for Human Mobility Prediction · KDD (1) 2025 |
Smart cities and intelligent transportation
urban mobility |
0.9 | 1 | 2025 | Noise Matters: Diffusion Model-based Urban Mobility Generation with Collaborative Noise Priors · WWW 2025 |
Machine learning › Learning theory › neural network theory
neural network parameterization |
0.8 | 1 | 2024 | Spatio-Temporal Few-Shot Learning via Diffusive Neural Network Generation · ICLR 2024 |
Machine learning › Representation and self-supervised learning
pre-training |
0.8 | 1 | 2024 | UniST: A Prompt-Empowered Universal Model for Urban Spatio-Temporal Prediction · KDD 2024 |
Machine learning › Representation and self-supervised learning › pre-training
spatio-temporal pre-training |
0.8 | 1 | 2024 | UniST: A Prompt-Empowered Universal Model for Urban Spatio-Temporal Prediction · KDD 2024 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
point process |
0.7 | 1 | 2023 | Spatio-temporal Diffusion Point Processes · KDD 2023 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
spatio-temporal point process |
0.7 | 1 | 2023 | Spatio-temporal Diffusion Point Processes · KDD 2023 |
Data mining › probabilistic model
probabilistic generative model |
0.7 | 1 | 2023 | Learning to Simulate Daily Activities via Modeling Dynamic Human Needs · WWW 2023 |
Spatial and temporal data management › trajectory data management
trajectory generation |
0.6 | 1 | 2022 | Activity Trajectory Generation via Modeling Spatiotemporal Dynamics · KDD 2022 |
Machine learning › Graph learning
graph neural network |
0.5 | 1 | 2021 | Community Value Prediction in Social E-commerce · WWW 2021 |
Natural language and speech › Language models and text generation
LLM agents |
0.3 | 1 | 2026 | Generating Realistic Human Mobility Data with Hybrid Large Language Model Agent · KDD (1) 2026 |
Data mining
spatiotemporal data mining |
0.3 | 1 | 2026 | UniFlow: A Foundation Model for Unified Urban Spatio-Temporal Flow Prediction · IEEE Trans. Mob. Comput. 2026 |
Machine learning › Generative modeling › diffusion model
diffusion transformer |
0.3 | 1 | 2025 | A Universal Model for Human Mobility Prediction · KDD (1) 2025 |
Privacy and data protection › privacy-preserving data sharing
privacy-preserving data synthesis |
0.3 | 1 | 2025 | Noise Matters: Diffusion Model-based Urban Mobility Generation with Collaborative Noise Priors · WWW 2025 |
Machine learning › Reinforcement learning › imitation learning › generative imitation learning
generative adversarial imitation learning |
0.2 | 1 | 2022 | Activity Trajectory Generation via Modeling Spatiotemporal Dynamics · KDD 2022 |
Machine learning › Graph learning › graph neural network
graph convolutional network |
0.2 | 1 | 2022 | Modeling Persuasion Factor of User Decision for Recommendation · KDD 2022 |
Machine learning › Reinforcement learning
imitation learning |
0.2 | 1 | 2022 | Activity Trajectory Generation via Modeling Spatiotemporal Dynamics · KDD 2022 |
Medical and health informatics
epidemic modeling |
0.2 | 1 | 2022 | Activity Trajectory Generation via Modeling Spatiotemporal Dynamics · KDD 2022 |
Computational social science and digital humanities › marketing
social commerce |
0.1 | 1 | 2021 | Community Value Prediction in Social E-commerce · WWW 2021 |
Methods — techniques the papers use, named apart from their topics
diffusion model · 4.0pre-training · 3.3spatio-temporal patching · 3.0memory retrieval augmentation · 3.0foundation model · 3.0large language model agents · 2.0diffusion transformer · 1.7collaborative noise prior · 1.7bidirectional alignment · 1.7generative adversarial imitation learning · 1.2graph convolutional network · 1.1neural network reward approximation · 0.9multi-view tokenizer · 0.9few-shot learning · 0.9neural stochastic differential equations · 0.7multi-task learning · 0.7maslow's need theory · 0.7disentangled representation learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Generating Realistic Human Mobility Data with Hybrid Large Language Model Agent
Chenyang Shao, Bingbing Fan, Jingtao Ding, Yuan Yuan 0032, Meng Wang 0001, Fengli Xu |
KDD (1) | 4 |
| 2026 | UniFlow: A Foundation Model for Unified Urban Spatio-Temporal Flow PredictionabstractUrban spatio-temporal flow prediction, encompassing traffic flows and crowd flows, is crucial for optimizing city infrastructure and managing traffic and emergency responses. Traditional approaches have relied on separate models tailored to either grid-based data, representing cities as uniform cells, or graph-based data, modeling cities as networks of nodes and edges. In this paper, we build UniFlow, a foundational model for general urban flow prediction that unifies both grid-based and graph based data. We first design a multi-view spatio-temporal patching mechanism to standardize different data into a consistent sequential format and then introduce a spatio-temporal transformer architecture to capture complex correlations and dynamics. To leverage shared spatio-temporal patterns across different data types and facilitate effective cross-learning, we propose Spatio Temporal Memory Retrieval Augmentation (ST-MRA). By creating structured memory modules to store shared spatio-temporal patterns, ST-MRA enhances predictions through adaptive memory retrieval. Extensive experiments demonstrate that UniFlow outperforms existing models in both grid-based and graph-based f low prediction, excelling particularly in scenarios with limited data availability, showcasing its superior performance and broad applicability. The datasets and code implementation have been released on https://github.com/YuanYuan98/UniFlow. Yuan Yuan 0032, Jingtao Ding, Chonghua Han, Zhi Sheng, Depeng Jin, Yong Li 0008 |
IEEE Trans. Mob. Comput. | 1 |
| 2025 | Reinforcement Learning with Adaptive Reward Modeling for Expensive-to-Evaluate SystemsabstractTraining reinforcement learning (RL) agents requires extensive trials and errors, which becomes prohibitively time-consuming in systems with costly reward evaluations.
To address this challenge, we propose adaptive reward modeling (AdaReMo) which accelerates RL training by decomposing the complicated reward function into multiple localized fast reward models approximating direct reward evaluation with neural networks.
These models dynamically adapt to the agent’s evolving policy by fitting the currently explored subspace with the latest trajectories, ensuring accurate reward estimation throughout the entire training process while significantly reducing computational overhead.
We empirically show that AdaReMo not only achieves over 1,000 times speedup but also improves the performance by 14.6% over state-of-the-art approaches across three expensive-to-evaluate systems---molecular generation, epidemic control, and spatial planning.
Code and data for the project are provided at https://github.com/tsinghua-fib-lab/AdaReMo. Hongyuan Su, Yu Zheng 0010, Yuan Yuan 0032, Yuming Lin 0003, Depeng Jin, Yong Li 0008 |
ICML | 3 |
| 2025 | A Universal Model for Human Mobility PredictionabstractPredicting human mobility is crucial for urban planning, traffic control, and emergency response. Mobility behaviors can be categorized into individual and collective, and these behaviors are recorded by diverse mobility data, such as individual trajectory and crowd flow. As different modalities of mobility data, individual trajectory and crowd flow have a close coupling relationship. Crowd flows originate from the bottom-up aggregation of individual trajectories, while the constraints imposed by crowd flows shape these individual trajectories. Existing mobility prediction methods are limited to single tasks due to modal gaps between individual trajectory and crowd flow. In this work, we aim to unify mobility prediction to break through the limitations of task-specific models. We propose a universal human mobility prediction model (named UniMob), which can be applied to both individual trajectory and crowd flow. UniMob leverages a multi-view mobility tokenizer that transforms both trajectory and flow data into spatiotemporal tokens, facilitating unified sequential modeling through a diffusion transformer architecture. To bridge the gap between the different characteristics of these two data modalities, we implement a novel bidirectional individual and collective alignment mechanism. This mechanism enables learning common spatiotemporal patterns from different mobility data, facilitating mutual enhancement of both trajectory and flow predictions. Extensive experiments on real-world datasets validate the superiority of our model over state-of-the-art baselines in trajectory and flow prediction. Especially in noisy and scarce data scenarios, our model achieves the highest performance improvement of more than 14% and 25% in MAPE and Accuracy@5. The codes are available online: https://github.com/tsinghua-fib-lab/UniMob. Qingyue Long, Yuan Yuan 0032, Yong Li 0008 |
KDD (1) | 2 |
| 2025 | Diffusion Transformers as Open-World Spatiotemporal Foundation ModelsabstractThe urban environment is characterized by complex spatio-temporal dynamics arising from diverse human activities and interactions. Effectively modeling these dynamics is essential for understanding and optimizing urban systems. In this work, we introduce UrbanDiT, a foundation model for open-world urban spatio-temporal learning that successfully scales up diffusion transformers in this field. UrbanDiT pioneers a unified model that integrates diverse data sources and types while learning universal spatio-temporal patterns across different cities and scenarios. This allows the model to unify both multi-data and multi-task learning, and effectively support a wide range of spatio-temporal applications. Its key innovation lies in the elaborated prompt learning framework, which adaptively generates both data-driven and task-specific prompts, guiding the model to deliver superior performance across various urban applications. UrbanDiT offers three advantages: 1) It unifies diverse data types, such as grid-based and graph-based data, into a sequential format; 2) With task-specific prompts, it supports a wide range of tasks, including bi-directional spatio-temporal prediction, temporal interpolation, spatial extrapolation, and spatio-temporal imputation; and 3) It generalizes effectively to open-world scenarios, with its powerful zero-shot capabilities outperforming nearly all baselines with training data. UrbanDiT sets up a new benchmark for foundation models in the urban spatio-temporal domain. Code and datasets are publicly available at \url{https://github.com/tsinghua-fib-lab/UrbanDiT}. Yuan Yuan 0032, Chonghua Han, Jingtao Ding, Guozhen Zhang 0001, Depeng Jin, Yong Li 0008 |
NeurIPS | 1 |
| 2025 | Noise Matters: Diffusion Model-based Urban Mobility Generation with Collaborative Noise PriorsabstractWith global urbanization, the focus on sustainable cities has largely grown, driving research into equity, resilience, and urban planning, which often relies on mobility data. The rise of web-based apps and mobile devices has provided valuable user data for mobility-related research. However, real-world mobility data is costly and raises privacy concerns. To protect privacy while retaining key features of real-world movement, the demand for synthetic data has steadily increased. Recent advances in diffusion models have shown great potential for mobility trajectory generation due to their ability to model randomness and uncertainty. However, existing approaches often directly apply identically distributed (i.i.d.) noise sampling from image generation techniques, which fail to account for the spatiotemporal correlations and social interactions that shape urban mobility patterns. In this paper, we propose CoDiffMob, a diffusion model for urban mobility generation with collaborative noise priors, we emphasize the critical role of noise in diffusion models for generating mobility data. By leveraging both individual movement characteristics and population-wide dynamics, we construct novel collaborative noise priors that provide richer and more informative guidance throughout the generation process. Extensive experiments demonstrate the superiority of our method, with generated data accurately capturing both individual preferences and collective patterns, achieving an improvement of over 32%. Furthermore, it can effectively replace web-derived mobility data to better support downstream applications, while safeguarding user privacy and fostering a more secure and ethical web. This highlights its tremendous potential for applications in sustainable city-related research. The code and data are available at https://github.com/tsinghua-fib-lab/CoDiffMob. Yuan Yuan 0032, Jingtao Ding, Yong Li 0008 |
WWW | 2 |
| 2025 | A Universal Pre-Training and Prompting Framework for General Urban Spatio-Temporal PredictionabstractUrban spatio-temporal prediction is crucial for informed decision-making, such as traffic management, resource optimization, and emergency response. Despite remarkable breakthroughs in pretrained natural language models that enable one model to handle diverse tasks, a universal solution for spatio-temporal prediction remains challenging. Existing prediction approaches are typically tailored for specific spatio-temporal scenarios, requiring task-specific model designs and extensive domain-specific training data. In this study, we introduce UniST, a universal model designed for general urban spatio-temporal prediction across a wide range of scenarios. Inspired by large language models, UniST achieves success through: (i) utilizing diverse spatio-temporal data from different scenarios, (ii) effective pre-training to capture complex spatio-temporal dynamics, (iii) knowledge-guided prompts to enhance generalization capabilities. These designs together unlock the potential of building a universal model for various scenarios. Extensive experiments on more than 20 spatio-temporal scenarios, including grid-based data and graph-based data, demonstrate UniST’s efficacy in advancing state-of-the-art performance, especially in few-shot and zero-shot prediction. Yuan Yuan 0032, Jingtao Ding, Jie Feng 0002, Depeng Jin, Yong Li 0008 |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2024 | Spatio-Temporal Few-Shot Learning via Diffusive Neural Network GenerationabstractSpatio-temporal modeling is foundational for smart city applications, yet it is often hindered by data scarcity in many cities and regions. To bridge this gap, we propose a novel generative pre-training framework, GPD, for spatio-temporal few-shot learning with urban knowledge transfer. Unlike conventional approaches that heavily rely on common feature extraction or intricate few-shot learning designs, our solution takes a novel approach by performing generative pre-training on a collection of neural network parameters optimized with data from source cities. We recast spatio-temporal few-shot learning as pre-training a generative diffusion model, which generates tailored neural networks guided by prompts, allowing for adaptability to diverse data distributions and city-specific characteristics. GPD employs a Transformer-based denoising diffusion model, which is model-agnostic to integrate with powerful spatio-temporal neural networks. By addressing challenges arising from data gaps and the complexity of generalizing knowledge across cities, our framework consistently outperforms state-of-the-art baselines on multiple real-world datasets for tasks such as traffic speed prediction and crowd flow prediction. The implementation of our approach is available: https://github.com/tsinghua-fib-lab/GPD. Yuan Yuan 0032, Chenyang Shao, Jingtao Ding, Depeng Jin, Yong Li 0008 |
ICLR | 1 |
| 2024 | UniST: A Prompt-Empowered Universal Model for Urban Spatio-Temporal PredictionabstractUrban spatio-temporal prediction is crucial for informed decision-making, such as traffic management, resource optimization, and emergence response. Despite remarkable breakthroughs in pretrained natural language models that enable one model to handle diverse tasks, a universal solution for spatio-temporal prediction remains challenging. Existing prediction approaches are typically tailored for specific spatio-temporal scenarios, requiring task-specific model designs and extensive domain-specific training data. In this study, we introduce UniST, a universal model designed for general urban spatio-temporal prediction across a wide range of scenarios. Inspired by large language models, UniST achieves success through: (i) utilizing diverse spatio-temporal data, (ii) effective pre-training to capture complex spatio-temporal relationships, (iii) spatio-temporal knowledge-guided prompts to enhance generalization capabilities. These designs together unlock the potential of building a universal model for various scenarios. Extensive experiments on more than 20 spatio-temporal scenarios demonstrate UniST's efficacy in advancing state-of-the-art performance, especially in few-shot and zero-shot prediction. The datasets and code implementation are released on https://github.com/tsinghua-fib-lab/UniST. Yuan Yuan 0032, Jingtao Ding, Jie Feng 0002, Depeng Jin, Yong Li 0008 |
KDD | 1 |
| 2024 | Generating Daily Activities with Need DynamicsabstractDaily activity data recording individuals’ various activities in daily life are widely used in many applications such as activity scheduling, activity recommendation, and policymaking. Though with high value, its accessibility is limited due to high collection costs and potential privacy issues. Therefore, simulating human activities to produce massive high-quality data is of great importance. However, existing solutions, including rule-based methods with simplified behavior assumptions and data-driven methods directly fitting real-world data, both cannot fully qualify for matching reality. In this article, motivated by the classic psychological theory, Maslow’s need theory describing human motivation, we propose a knowledge-driven simulation framework based on generative adversarial imitation learning. Our core idea is to model the evolution of human needs as the underlying mechanism that drives activity generation in the simulation model. Specifically, a hierarchical model structure that disentangles different need levels and the use of neural stochastic differential equations successfully capture the piecewise-continuous characteristics of need dynamics. Extensive experiments demonstrate that our framework outperforms the state-of-the-art baselines regarding data fidelity and utility. We also present the insightful interpretability of the need modeling. Moreover, privacy preservation evaluations validate that the generated data does not leak individual privacy. The code is available at https://github.com/tsinghua-fib-lab/Activity-Simulation-SAND . Yuan Yuan 0032, Jingtao Ding, Huandong Wang, Depeng Jin |
ACM Trans. Intell. Syst. Technol. | 1 |
| 2024 | Demand-driven Urban Facility Visit PredictionabstractPredicting citizens’ visiting behaviors to urban facilities is instrumental for city governors and planners to detect inequalities in urban opportunities and optimize the distribution of facilities and resources. Previous works predict facility visits simply using observed visit behavior, yet citizens’ intrinsic demands for facilities are not characterized explicitly, causing potential incorrect learned relations in the prediction results. In this article, to make up for this deficiency, we present a demand-driven urban facility visit prediction method that decomposes citizens’ visits to facilities into their unobservable demands and their capability to fulfill them. Demands are expressed as the function of regional demographic attributes by a neural network, and the fulfillment capability is determined by the urban region’s spatial accessibility to facilities. Extensive evaluations of datasets of three large cities confirm the efficiency and rationality of our model. Our method outperforms the best state-of-the-art model by 8.28% on average in facility visit prediction tasks. Further analyses demonstrate the reasonableness of recovered facility demands and their relationship with citizen demographics. For instance, senior citizens tend to have higher medical demands but lower shopping demands. Meanwhile, estimated capabilities and accessibilities provide deeper insights into the decaying accessibility with respect to spatial distance and facilities’ diverse functions in the urban environment. Our findings shed light on demand-driven urban data mining and demand-based urban facility planning. Yunke Zhang, Tong Li 0013, Yuan Yuan 0032, Fengli Xu, Fan Yang 0136, Funing Sun, Yong Li 0008 |
ACM Trans. Intell. Syst. Technol. | 3 |
| 2023 | Spatio-temporal Diffusion Point ProcessesabstractSpatio-temporal point process (STPP) is a stochastic collection of events accompanied with time and space. Due to computational complexities, existing solutions for STPPs compromise with conditional independence between time and space, which consider the temporal and spatial distributions separately. The failure to model the joint distribution leads to limited capacities in characterizing the spatio-temporal entangled interactions given past events. In this work, we propose a novel parameterization framework for STPPs, which leverages diffusion models to learn complex spatio-temporal joint distributions. We decompose the learning of the target joint distribution into multiple steps, where each step can be faithfully described by a Gaussian distribution. To enhance the learning of each step, an elaborated spatio-temporal co-attention module is proposed to capture the interdependence between the event time and space adaptively. For the first time, we break the restrictions on spatio-temporal dependencies in existing solutions, and enable a flexible and accurate modeling paradigm for STPPs. Extensive experiments from a wide range of fields, such as epidemiology, seismology, crime, and urban mobility, demonstrate that our framework outperforms the state-of-the-art baselines remarkably. Further in-depth analyses validate its ability to capture spatio-temporal interactions, which can learn adaptively for different scenarios. The datasets and source code are available online: https://github.com/tsinghua-fib-lab/Spatio-temporal-Diffusion-Point-Processes. Yuan Yuan 0032, Jingtao Ding, Chenyang Shao, Depeng Jin, Yong Li 0008 |
KDD | 1 |
| 2023 | Learning to Simulate Daily Activities via Modeling Dynamic Human NeedsabstractDaily activity data that records individuals’ various types of activities in daily life are widely used in many applications such as activity scheduling, activity recommendation, and policymaking. Though with high value, its accessibility is limited due to high collection costs and potential privacy issues. Therefore, simulating human activities to produce massive high-quality data is of great importance to benefit practical applications. However, existing solutions, including rule-based methods with simplified assumptions of human behavior and data-driven methods directly fitting real-world data, both cannot fully qualify for matching reality. In this paper, motivated by the classic psychological theory, Maslow’s need theory describing human motivation, we propose a knowledge-driven simulation framework based on generative adversarial imitation learning. To enhance the fidelity and utility of the generated activity data, our core idea is to model the evolution of human needs as the underlying mechanism that drives activity generation in the simulation model. Specifically, this is achieved by a hierarchical model structure that disentangles different need levels, and the use of neural stochastic differential equations that successfully captures piecewise-continuous characteristics of need dynamics. Extensive experiments demonstrate that our framework outperforms the state-of-the-art baselines in terms of data fidelity and utility. Besides, we present the insightful interpretability of the need modeling. The code is available at https://github.com/tsinghua-fib-lab/Activity-Simulation-SAND. Yuan Yuan 0032, Huandong Wang, Jingtao Ding, Depeng Jin, Yong Li 0008 |
WWW | 1 |
| 2023 | Understanding the Influence of Social Hubs in Diffusion Processes Driven by Incentivized Friend InvitationabstractWith the prevalence of social media, rewarding users to invite their friends to use an application or adopt a service has become one of the most successful designs in recent years. As the application or service spreads, a diffusion process driven by incentivized invitation forms. However, despite the extensive attention from both industry and academia, this newly-emerging diffusion process remains under-explored. To bridge this gap between academic research and industrial practice, we set out to examine the influence of social hubs, i.e., people with a considerable number of social ties, in the diffusion process driven by incentivized friend invitation. Through a large-scale empirical data analysis, we found that under three different measures, the influence of social hubs on the growth of the diffusion process is saturated as their number of contacts increases. Following this observation, we further explored possible causes of this phenomenon by a mixed method that combines a large-scale empirical data analysis and a semi-structured interview to deepen our understanding of social hubs’ influence in the diffusion process. We revealed two main causes. First, large social hubs lacked the will to keep engaging in sending invitations, and the anchoring effects on the cost-utility trade-off could explain their behaviors. Second, social hubs’ broadcasting capability decreased in the invitation-based diffusion process because hubs are better at informing rather than persuading compared with non-hubs. Our findings provide in-depth insights into the understanding of the nature of social hubs’ influence, and we further discuss practical implications for designs to facilitate invitation-based online diffusion processes. Guozhen Zhang 0001, Fengli Xu, Yuan Yuan 0032, Depeng Jin |
IEEE Trans. Comput. Soc. Syst. | 3 |
| 2023 | Discovering Causes of Traffic Congestion via Deep Transfer ClusteringabstractTraffic congestion incurs long delay in travel time, which seriously affects our daily travel experiences. Exploring why traffic congestion occurs is significantly important to effectively address the problem of traffic congestion and improve user experience. Traditional approaches to mine the congestion causes depend on human efforts, which is time consuming and cost-intensive. Hence, we aim at discovering the known and unknown causes of traffic congestion in a systematic way. However, to achieve it, there are three challenges: (1) traffic congestion is affected by several factors with complex spatio-temporal relations; (2) there are a few samples of congestion data with known causes due to the limitation of human label; (3) more unknown congestion causes are unexplored since several factors contribute to traffic congestion. To address above challenges, we design a congestion cause discovery system consisting of two modules: (1) congestion feature extraction module, which extracts the important features distinguishing between different causes of congestion; and (2) congestion cause discovery module, which designs a deep semi-supervised learning based framework to discover the causes of traffic congestion with limited labeled data. Specifically, in pre-training stage, it first leverages a few labeled data as prior knowledge to pre-train the model. Then, in clustering stage, we propose two different clustering methods to discover the congestion causes. For the first clustering method, we extend the classic deep embedded clustering model to produce clusters via soft assignment. For the second one, we iteratively usek-means to group the latent features extracted from the pre-trained model, and use the cluster results as pseudo-labels to fine-tune the network. Extensive experiments show that the performance of our methods is superior to the state-of-the-art baselines, which demonstrates the effectiveness of the proposed cause discovery system. Additionally, our system is deployed and used in the practical production environment at Amap. Mudan Wang, Yuan Yuan 0032, Huan Yan 0003, Hongjie Sui, Fan Zuo, Yue Liu 0020, Yong Li 0008, Depeng Jin |
ACM Trans. Intell. Syst. Technol. | 2 |
| 2023 | Persuade to Click: Context-Aware Persuasion Model for Online Textual AdvertisementabstractIn recent years, due to the prevalence of online textual advertisements, increasing businesses recognize their huge potential in product promotion. The high-quality textual content has been empirically shown to have a substantial impact on consumers’ attitudes and decisions. As a result, persuasive tactics play an essential role in online textual advertisements, which are employed to increase the attractiveness, and sequentially increase the conversion rate and sales volume. As the context of persuasion, product attributes, e.g., category and price, also greatly influence the persuasion outcomes. However, they are largely overlooked by existing works. In this paper, we propose a novel framework to study context-aware persuasion by designing a multi-task learning model and performing extensive causal analysis. First, the prediction model recognizes the persuasive tactics employed in an advertising text and predicts their promotion effectiveness. Specifically, we design a disentangled representation learning algorithm to capture the persuasive tactics, and then develop a novel context-aware attention module to model the relationships between persuasive tactics and product attributes. Experiments on a large-scale real-world dataset demonstrate the superior performance of our proposed model over state-of-the-art baselines. Then we show its great practical value by conducting an in-depth causal analysis of context-aware results that our model learns, which offers insightful interpretations and guidelines for marketers to employ persuasive tactics in textual advertisements. Yuan Yuan 0032, Fengli Xu, Hancheng Cao, Guozhen Zhang 0001, Pan Hui 0001, Yong Li 0008, Depeng Jin |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2022 | Modeling Persuasion Factor of User Decision for RecommendationabstractIn online information systems, users make decisions based on factors of several specific aspects, such as brand, price, etc. Existing recommendation engines ignore the explicit modeling of these factors, leading to sub-optimal recommendation performance. In this paper, we focus on the real-world scenario where these factors can be explicitly captured (the users are exposed with decision factor-based persuasion texts, i.e., persuasion factors). Although it allows us for explicit modeling of user-decision process, there are critical challenges including the persuasion factor's representation learning and effect estimation, along with the data-sparsity problem. To address them, in this work, we present our POEM (short for Persuasion factOr Effect Modeling) system. We first propose the persuasion-factor graph convolutional layers for encoding and learning representations from the persuasion-aware interaction data. Then we develop a prediction layer that fully considers the user sensitivity to the persuasion factors. Finally, to address the data-sparsity issue, we propose a counterfactual learning-based data augmentation method to enhance the supervision signal. Real-world experiments demonstrate the effectiveness of our proposed framework of modeling the effect of persuasion factors. Chang Liu 0092, Chen Gao 0001, Yuan Yuan 0032, Lingrui Luo, Xiaoyi Du, Xinlei Shi, Hengliang Luo, Depeng Jin, Yong Li 0008 |
KDD | 3 |
| 2022 | Activity Trajectory Generation via Modeling Spatiotemporal DynamicsabstractHuman daily activities, such as working, eating out, and traveling, play an essential role in contact tracing and modeling the diffusion patterns of the COVID-19 pandemic. However, individual-level activity data collected from real scenarios are highly limited due to privacy issues and commercial concerns. In this paper, we present a novel framework based on generative adversarial imitation learning, to generate artificial activity trajectories that retain both the fidelity and utility of the real-world data. To tackle the inherent randomness and sparsity of irregular-sampled activities, we innovatively capture the spatiotemporal dynamics underlying trajectories by leveraging neural differential equations. We incorporate the dynamics of continuous flow between consecutive activities and instantaneous updates at observed activity points in temporal evolution and spatial transformation. Extensive experiments on two real-world datasets show that our proposed framework achieves superior performance over state-of-the-art baselines in terms of improving the data fidelity and data utility in facilitating practical applications. Moreover, we apply the synthetic data to model the COVID-19 spreading, and it achieves better performance by reducing the simulation MAPE over the baseline by more than 50%. The source code is available online: https://github.com/tsinghua-fib-lab/Activity-Trajectory-Generation. Yuan Yuan 0032, Jingtao Ding, Huandong Wang, Depeng Jin, Yong Li 0008 |
KDD | 1 |
| 2021 | Understanding the Invitation Acceptance in Agent-initiated Social E-commerce
Fengli Xu, Guozhen Zhang 0001, Yuan Yuan 0032, Hongjia Huang, Diyi Yang, Depeng Jin, Yong Li 0008 |
ICWSM | 3 |
| 2021 | Community Value Prediction in Social E-commerceabstractThe phenomenal success of the newly-emerging social e-commerce has demonstrated that utilizing social relations is becoming a promising approach to promote e-commerce platforms. In this new scenario, one of the most important problems is to predict the value of a community formed by closely connected users in social networks due to its tremendous business value. However, few works have addressed this problem because of 1) its novel setting and 2) its challenging nature that the structure of a community has complex effects on its value. To bridge this gap, we develop a Multi-scale Structure-aware Community value prediction network (MSC) that jointly models the structural information of different scales, including peer relations, community structure, and inter-community connections, to predict the value of given communities. Specifically, we first proposed a Masked Edge Learning Graph Convolutional Network (MEL-GCN) based on a novel masked propagation mechanism to model peer influence. Then, we design a Pair-wise Community Pooling (PCPool) module to capture critical community structures. Finally, we model the inter-community connections by distinguishing intra-community edges from inter-community edges and employing a Multi-aggregator Framework (MAF). Extensive experiments on a large-scale real-world social e-commerce dataset demonstrate our method’s superior performance over state-of-the-art baselines, with a relative performance gain of 11.40%, 10.01%, and 10.97% in MAE, RMSE, and NRMSE, respectively. Further ablation study shows the effectiveness of our designed components. Our code and dataset are available1. Guozhen Zhang 0001, Yong Li 0008, Yuan Yuan 0032, Fengli Xu, Hancheng Cao, Yujian Xu, Depeng Jin |
WWW | 3 |