Yuandong Wang

Yuandong Wang

Auto-generated profile, based on publicly available information

Yuandong Wang

Capital Normal University, Beijing, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2024
Verified
Conference Paper
Open access
DZDongcheng Zou
Dongcheng Zou
WSWang Senzhang
Wang Senzhang
XLXuefeng Li
Xuefeng Li
HPHao Peng
Hao Peng
YWYuandong Wang
Yuandong Wang
BZBo Zhang
Bo Zhang
Traffic forecasting is a complex multivariate time-series regression task of paramount importance for traffic management and planning. However, existing approaches often struggle to model complex multi-range dependencies using local spatiotemporal features and road network hierarchical knowledge. To address this, we propose MultiSPANS. First, considering that an individual recording point cannot reflect critical spatiotemporal local patterns, we design multi-filter convolution modules for generating informative ST-token embeddings to facilitate attention computation. Then, based on ST-token and spatial-temporal position encoding, we employ the Transformers to capture long-range temporal and spatial dependencies. Furthermore, we introduce structural entropy theory to optimize the spatial attention mechanism. Specifically, The structural entropy minimization algorithm is used to generate optimal road network hierarchies, i.e., encoding trees. Based on this, we propose a relative structural entropy-based position encoding and a multi-head attention masking scheme based on multi-layer encoding trees. Extensive experiments demonstrate the superiority of the presented framework over several state-of-the-art methods in real-world traffic datasets, and the longer historical windows are effectively utilized. The code is available at https://github.com/SELGroup/MultiSPANS.

30 April 2023
Verified
Conference Paper
Open access
DZDan Zhang
Dan Zhang
Yifan ZhuYifan Zhu
Yifan Zhu
YDYuxiao Dong
Yuxiao Dong
YWYuandong Wang
Yuandong Wang
WFWenzheng Feng
Wenzheng Feng
JTJie Tang
Jie Tang
In recent years, graph neural networks (GNNs) have made great progress in recommendation. The core mechanism of GNNs-based recommender system is to iteratively aggregate neighboring information on the user-item interaction graph. However, existing GNNs treat users and items equally and cannot distinguish diverse local patterns of each node, which makes them suboptimal in the recommendation scenario. To resolve this challenge, we present a node-wise adaptive graph neural network framework ApeGNN. ApeGNN develops a node-wise adaptive diffusion mechanism for information aggregation, in which each node is enabled to adaptively decide its diffusion weights based on the local structure (e.g., degree). We perform experiments on six widely-used recommendation datasets. The experimental results show that the proposed ApeGNN is superior to the most advanced GNN-based recommender methods (up to 48.94%), demonstrating the effectiveness of node-wise adaptive aggregation.

29 November 2021 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
YWYuandong Wang
Yuandong Wang
HYHongzhi Yin
Hongzhi Yin
TCTong Chen
Tong Chen
CLChunyang Liu
Chunyang Liu
BWBen Wang
Ben Wang
JXJie Xu
Jie Xu
In recent years, ride-hailing services have been increasingly prevalent, as they provide huge convenience for passengers. As a fundamental problem, the timely prediction of passenger demands in different regions is vital for effective traffic flow control and route planning. As both spatial and temporal patterns are indispensable passenger demand prediction, relevant research has evolved from pure time series to graph-structured data for modeling historical passenger demand data, where a snapshot graph is constructed for each time slot by connecting region nodes via different relational edges (origin-destination relationship, geographical distance, etc.). Consequently, the spatiotemporal passenger demand records naturally carry dynamic patterns in the constructed graphs, where the edges also encode important information about the directions and volume (i.e., weights) of passenger demands between two connected regions. aspects in the graph-structure data. representation for DDW is the key to solve the prediction problem. However, existing graph-based solutions fail to simultaneously consider those three crucial aspects of dynamic, directed, and weighted graphs, leading to limited expressiveness when learning graph representations for passenger demand prediction. Therefore, we propose a novel spatiotemporal graph attention network, namely Gallat ( G raph prediction with all at tention) as a solution. In Gallat, by comprehensively incorporating those three intrinsic properties of dynamic directed and weighted graphs, we build three attention layers to fully capture the spatiotemporal dependencies among different regions across all historical time slots. Moreover, the model employs a subtask to conduct pretraining so that it can obtain accurate results more quickly. We evaluate the proposed model on real-world datasets, and our experimental results demonstrate that Gallat outperforms the state-of-the-art approaches.

15 October 2019 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
PDF file
YWYuandong Wang
Yuandong Wang
XLXuelian Lin
Xuelian Lin
HWHua Wei
Hua Wei
TWTianyu Wo
Tianyu Wo
ZHZhou Huang
Zhou Huang
JXJie Xu
Jie Xu
Ride-hailing applications have been offering convenient ride services for people in need. However, such applications still suffer from the issue of supply-demand disequilibrium, which is a typical problem for traditional taxi services. With effective predictions on passenger demands, we can alleviate the disequilibrium by pre-dispatching, dynamic pricing or avoiding dispatching cars to zero-demand areas. Existing studies of demand predictions mainly utilize limited data sources, trajectory data, or orders of ride services or both of them, which also lacks a multi-perspective consideration. In this article, we present a unified framework with a new combined model and a road-network-based spatial partition to leverage multi-source data and model the passenger demands from temporal, spatial, and zero-demand-area perspectives. In addition, our framework realizes offline training and online predicting, which can satisfy the real-time requirement more easily. We analyze and evaluate the performance of our combined model using the actual operational data from UCAR. The experimental results indicate that our model outperforms baselines on both Mean Absolute Error and Root Mean Square Error on average.

21 October 2023
Verified
Conference Paper
Open access
MZMing Zhou
Ming Zhou
DZDan Zhang
Dan Zhang
YWYuandong Wang
Yuandong Wang
YGYangli-ao Geng
Yangli-ao Geng
JTJie Tang
Jie Tang
Social bot detection is becoming a task of wide concern in social security. All along, the development of social bot detection technology is hindered by the lack of high-quality annotated data. Besides, the rapid development of AI Generated Content (AIGC) technology is dramatically improving the creative ability of social bots. For example, the recently released ChatGPT [2] can fool the state-of-the-art AI-text-detection method with a probability of 74%, bringing a large challenge to content-based bot detection methods. To address the above drawbacks, we propose a Contrastive Learning-driven Social Bot Detection framework (CBD). The core of CBD is characterized by a two-stage model learning strategy: a contrastive pre-training stage to mine generalization patterns from massive unlabeled social graphs, followed by a semi-supervised fine-tuning stage to model task-specific knowledge latent in social graphs with a few annotations. The above strategy endows our model with promising detection performance under an extreme scarcity of labeled data. In terms of system architecture, we propose a smart feedback mechanism to further improve detection performance. Comprehensive experiments on a real bot detection dataset show that CBD consistently outperforms 10 state-of-the-art baselines by a large margin for few-shot bot detection using very little (5-shot) labeled data. CBD has been deployed online.

10 April 2013 in Wetlands
Verified
Journal Article
Open access
PDF file
YWYuandong Wang
Yuandong Wang
XHXiyong Hou
Xiyong Hou
PSPing Shi
Ping Shi
LYLiangju Yu
Liangju Yu
Coastal wetland shoreline change represents one of the most important land-ocean interaction processes in complex and dynamic coastal environment. This paper presents the detecting of shoreline changes in four typical coastal wetlands of ecological importance along Bohai rim based on multi-temporal shorelines extracted from obtained Normalized Difference Water Index (NDWI) images using automatic binarization algorithm. Results showed that although there were statistical uncertainties dominant trends of the shoreline changes could be detected and sections that had significant area changes could be identified from satellite images. The reasons for corresponding changes occurred in these wetlands were stated in terms of natural processes and anthropogenic activities. It is our anticipation that this work would help future studies to reveal the regional/national pattern of wetland changes and support wetland protection and management in China’s coast zone.