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

Zidong Yang

dblp:183/0173 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
3since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 4 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1

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.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Smart cities and intelligent transportation · 100%
Databases, data mining, and information retrieval
2 papers
Spatial and temporal data management · 49% Recommender systems · 37% Web and social media mining · 15%
Computer networks
2 papers
Wireless sensing and localization · 85% Network measurement and analytics · 15%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%

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

TopicWeightPapersLastEvidence papers
Smart cities and intelligent transportation
bike sharing systems
0.932019
Utilization-Aware Trip Advisor in Bike-Sharing Systems Based on User Behavior Analysis · IEEE Trans. Knowl. Data Eng. 2019
Data-Driven Utilization-Aware Trip Advisor for Bike-Sharing Systems · ICDM 2017
Mobility Modeling and Prediction in Bike-Sharing Systems · MobiSys 2016
Wireless sensing and localization › localization
user localization
0.412020
GotU: leverage social ties for efficient user localization · Sci. China Inf. Sci. 2020
Smart cities and intelligent transportation › bike sharing systems
bike rebalancing
0.312017
Data-Driven Utilization-Aware Trip Advisor for Bike-Sharing Systems · ICDM 2017
Smart cities and intelligent transportation
spatio-temporal prediction
0.212016
Mobility Modeling and Prediction in Bike-Sharing Systems · MobiSys 2016
Ubiquitous computing and smart environments › mobile crowdsourcing › crowdsensing
mobile crowdsensing
0.112020
GotU: leverage social ties for efficient user localization · Sci. China Inf. Sci. 2020
Web and social media mining
user behavior analysis
0.112019
Utilization-Aware Trip Advisor in Bike-Sharing Systems Based on User Behavior Analysis · IEEE Trans. Knowl. Data Eng. 2019
Network measurement and analytics › mobile network measurement
mobility trace analysis
0.112016
Mobility Modeling and Prediction in Bike-Sharing Systems · MobiSys 2016

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

social network analysis · 0.9station activeness · 0.8demand prediction · 0.8station activeness modeling · 0.6data-driven optimization · 0.6traffic prediction · 0.5spatio-temporal modeling · 0.5
YearPublicationVenuePosition
2026 Octopus: An ABR-RAN Closed-Loop Approach Towards High QoE Multi-User 5G VR Gaming
Chengke Wang, Junchen Guo, Zidong Yang, Yinian Zhou, Tao Sun 0010, Kai Lei, Yunhuai Liu, Chenren Xu
SECON4
2022 Interblock Flow Prediction With Relation Graph Network for Cold Start on Bike-Sharing System
abstract
As the IoT technology becomes well established and sharing economy expands worldwide, the bike-sharing system (BSS) has spread fast in the last decade. When introducing the BSS in a new city, the operator often faces many challenges: e.g., optimizing station siting (physical or electric), constructing bike lanes, and making strategies for the initial distribution and rebalancing of bikes. These challenges require an accurate interblock flow prediction before deploying the BSS. In this article, we derive blocks from the urban road network and extract blocks’ features based on the distribution and types of POI. Then, the interblock flow can be predicted based on the features of both start/end block and neighbor blocks. We propose a unified architecture with a generalized attention mechanism named the relation graph network (RGN) to extract block features and make predictions across cities. The evaluations on real-world data sets show that RGN outperforms other popular graph neural networks in multiple metrics. We further simulate the applications of station site selection and bike lane planning based on the prediction from RGN, and the result provides a noticeable increase in the BSS’s deployment/operation efficiency.
Mingda Jiang, Chao Li 0062, Kehan Li 0001, Zidong Yang, Hao Liu 0023
IEEE Internet Things J.4
2022 Multiple B-Value Model-Based Residual Network (MORN) for Accelerated High-Resolution Diffusion-Weighted Imaging
abstract
Single-Shot Echo Planar Imaging (SSEPI) based Diffusion Weighted Imaging (DWI) has shortcomings such as low resolution and severe distortions. In contrast, Multi-Shot EPI (MSEPI) provides optimal spatial resolution but increases scan time. This study proposed a Multiple b-value mOdel-based Residual Network (MORN) model to reconstruct multiple b-value high-resolution DWI from undersampled k-space data simultaneously. We incorporated Parallel Imaging (PI) into a residual U-net to reconstruct multiple b-value multi-coil data with the supervision of MUltiplexed Sensitivity-Encoding (MUSE) reconstructed Multi-Shot DWI (MSDWI). Moreover, asymmetric concatenations among different b-values and the combined loss to back propagate helped the feature transfer. After training and validation of the MORN in a dataset of 32 healthy cases, additional assessments were performed on 6 patients with different tumor types. The experimental results demonstrated that the MORN model outperformed conventional PI reconstruction (i.e. SENSE) and two state-of-the-art deep learning methods (SENSE-GAN and VSNet) in terms of PSNR (Peak Signal-to-Noise Ratio), SSIM (Structual SIMilarity) and apparent diffusion coefficient maps. In addition, using the pre-trained model under DWI, the MORN achieved consistent fractional anisotrophy and mean diffusivity reconstructed from multiple diffusion directions. Hence, the proposed method shows potential in clinical application according to the observations on tumor patients as well as images of multiple diffusion directions.
Fanwen Wang, Hui Zhang 0005, Weibo Chen, Zidong Yang, Dinggang Shen, Chengyan Wang, He Wang 0016
IEEE J. Biomed. Health Informatics6
2020 GotU: leverage social ties for efficient user localization
Zidong Yang, Shibo He, Jiming Chen 0001
Sci. China Inf. Sci.1
2019 TERP: Time-Event-Dependent Route Planning in Stochastic Multimodal Transportation Networks With Bike Sharing System
abstract
Advanced traveler information systems (ATISs) provide travelers with public transportation information to improve the quality of individual life and alleviate congestion as well as air pollution. However, existing works have not fully incorporated bike sharing systems within ATIS, providing no interaction with other modalities nor taking bike stocks into account. In addition, the uncertainty of traffic conditions and multimodal routing makes it challenging to accurately estimate the travel time. In this paper, we leverage large-scale historical data collected in London and construct a multimodal transportation network, including bus, tube, public bikes, and walking. We solve the modalities aggregation problem by practically modeling the travel time, arrival time, bike stock, and transfer time between different transport modalities. Furthermore, we propose TERP, a time-event-dependent route planner that optimizes both trip duration and reliability. We conduct experiments on extensive real-world data with over 23 million arrival records and 15 million stock records on more than 10 000 stations from transport for London platform (TfL). The results validates 14.91% reduction of actual total trip duration and 56.28% improvement in terms of route reliability in rush hours comparing with TfL.
Peng Cheng 0001, Congwei Xu, Pierre R. Lebreton, Zidong Yang, Jiming Chen 0001
IEEE Internet Things J.4
2019 Mobility Modeling and Data-Driven Closed-Loop Prediction in Bike-Sharing Systems
abstract
As an innovative mobility strategy, public bike-sharing has grown dramatically worldwide. Though it provides convenient, low-cost, and environmental-friendly transportation, the unique features of bike-sharing systems give rise to problems for both users and operators. The primary issue is the uneven distribution of bikes caused by ever-changing usage and (available) supply. This imbalance necessitates efficient bike rebalancing strategies, which depends highly on bike mobility modeling and prediction. In this paper, a trace-driven simulation-based prediction approach is proposed by simultaneously taking user mobility demand and real-time status of stations into consideration. We extensively evaluate the performance of our design with the dataset from one of the world's largest public bike-sharing systems located in Hangzhou, China, which owns more than 2800 stations. The evaluation results show an 85 percentile relative error of 0.6 for checkout and 0.4 for checkin prediction. The preliminary results on how the predictions can be used for bike rebalancing are also provided. We believe that this new mobility modeling and prediction approach can improve the bike-sharing system operation algorithm design and pave the way for rapid deployment and adoption of bike-sharing systems across the globe.
Zidong Yang, Jiming Chen 0001, Yuanchao Shu, Peng Cheng 0001
IEEE Trans. Intell. Transp. Syst.1
2019 Utilization-Aware Trip Advisor in Bike-Sharing Systems Based on User Behavior Analysis
abstract
The rapid development of bike-sharing systems has brought people enormous convenience during the past decade. On the other hand, high transport flexibility gives rise to problems for both users and operators. For users, dynamic distribution of shared bikes caused by uneven user demand often leads to the check in or check out service unavailable at some stations. For operators, unbalanced bike usage comes with more bike broken and growing maintenance cost. In this paper, we consider enhancing user experiences and rebalance bicycle utilization by directing users to different stations with a higher success rate of rental and return. For the first time, we devise a trip advisor that recommends bike check-in and check-out stations with joint consideration of service quality and bicycle utilization. To ensure service quality, we firstly predict the user demand of each station to obtain the success rate of rental and return in the future. Experiments indicate that the precision of our method is as much as 0.826, which has raised by 25.9 percent as compared with that of the historical average method. To rebalance bike usage, from historical data, we identify that biased bike usage is rooted from circumscribed bicycle circulation among few active stations. Therefore, with defined station activeness, we optimize the bike circulation by leading users to shift bikes between highly active stations and inactive ones. We extensively evaluate the performance of our design through real-world datasets. Evaluation results show that the percentage of frequently used bikes decreases by 33.6 percent on usage number and 28.6 percent on usage time.
Peng Cheng 0001, Zidong Yang, Yuanchao Shu, Jiming Chen 0001
IEEE Trans. Knowl. Data Eng.3
2017 Data-Driven Utilization-Aware Trip Advisor for Bike-Sharing Systems
abstract
Rapid development of bike-sharing systems has brought people enormous convenience during the past decade. On the other hand, high transport flexibility comes with dynamic distribution of shared bikes, leading to an unbalanced bike usage and growing maintenance cost. In this paper, we consider to rebalance bicycle utilization by means of directing users to different stations. For the first time, we devise a trip advisor that recommends bike check-in and check-out stations with joint consideration of service quality and bicycle utilization. From historical data, we firstly identify that biased bike usage is rooted from circumscribed bicycle circulation among few active stations. Therefore, with defined station activeness, we optimize the bike circulation by leading users to shift bikes between highly active stations and inactive ones. We extensively evaluate the performance of our design through real-world datasets. Evaluation results show that the percentage of frequent used bikes decreases by 33.6% on usage number and 28.6% on usage time.
Zidong Yang, Yuanchao Shu, Peng Cheng 0001, Jiming Chen 0001
ICDM2
2016 Mobility Modeling and Prediction in Bike-Sharing Systems
abstract
As an innovative mobility strategy, public bike-sharing has grown dramatically worldwide. Though providing convenient, low-cost and environmental-friendly transportation, the unique features of bike-sharing systems give rise to problems to both users and operators. The primary issue among these problems is the uneven distribution of bicycles caused by the ever-changing usage and (available) supply. This bicycle imbalance issue necessitates efficient bike re-balancing strategies, which depends highly on bicycle mobility modeling and prediction. In this paper, for the first time, we propose a spatio-temporal bicycle mobility model based on historical bike-sharing data, and devise a traffic prediction mechanism on a per-station basis with sub-hour granularity. We extensively evaluated the performance of our design through a one-year dataset from the world's largest public bike-sharing system (BSS) with more than 2800 stations and over 103 million check in/out records. Evaluation results show an 85 percentile relative error of 0.6 for both check in and check out prediction. We believe this new mobility modeling and prediction approach can advance the bike re-balancing algorithm design and pave the way for the rapid deployment and adoption of bike-sharing systems across the globe.
Zidong Yang, Yuanchao Shu, Peng Cheng 0001, Jiming Chen 0001, Thomas Moscibroda
MobiSys1