Xun Zhou

Xun Zhou

Auto-generated profile, based on publicly available information

Xun Zhou

Harbin Institute of Technology, Shenzhen, Shenzhen, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
SSShashi Shekhar
Shashi Shekhar
ZJZhe Jiang
Zhe Jiang
RAReem Y. Ali
Reem Y. Ali
EEEmre Eftelioglu
Emre Eftelioglu
XTXun Tang
Xun Tang
XZXun Zhou
Xun Zhou
Explosive growth in geospatial and temporal data as well as the emergence of new technologies emphasize the need for automated discovery of spatiotemporal knowledge. Spatiotemporal data mining studies the process of discovering interesting and previously unknown, but potentially useful patterns from large spatiotemporal databases. It has broad application domains including ecology and environmental management, public safety, transportation, earth science, epidemiology, and climatology. The complexity of spatiotemporal data and intrinsic relationships limits the usefulness of conventional data science techniques for extracting spatiotemporal patterns. In this survey, we review recent computational techniques and tools in spatiotemporal data mining, focusing on several major pattern families: spatiotemporal outlier, spatiotemporal coupling and tele-coupling, spatiotemporal prediction, spatiotemporal partitioning and summarization, spatiotemporal hotspots, and change detection. Compared with other surveys in the literature, this paper emphasizes the statistical foundations of spatiotemporal data mining and provides comprehensive coverage of computational approaches for various pattern families. ISPRS Int. J. Geo-Inf. 2015, 4 2307 We also list popular software tools for spatiotemporal data analysis. The survey concludes with a look at future research needs.

24 February 2018 in Big Data and Cognitive Computing
Verified
Journal Article
Open access
PDF file
DZDixian Zhu
Dixian Zhu
CCChangjie Cai
Changjie Cai
TYTianbao Yang
Tianbao Yang
XZXun Zhou
Xun Zhou
In this paper, we tackle air quality forecasting by using machine learning approaches to predict the hourly concentration of air pollutants (e.g., ozone, particle matter ( PM 2.5 ) and sulfur dioxide). Machine learning, as one of the most popular techniques, is able to efficiently train a model on big data by using large-scale optimization algorithms. Although there exist some works applying machine learning to air quality prediction, most of the prior studies are restricted to several-year data and simply train standard regression models (linear or nonlinear) to predict the hourly air pollution concentration. In this work, we propose refined models to predict the hourly air pollution concentration on the basis of meteorological data of previous days by formulating the prediction over 24 h as a multi-task learning (MTL) problem. This enables us to select a good model with different regularization techniques. We propose a useful regularization by enforcing the prediction models of consecutive hours to be close to each other and compare it with several typical regularizations for MTL, including standard Frobenius norm regularization, nuclear norm regularization, and ℓ 2 , 1 -norm regularization. Our experiments have showed that the proposed parameter-reducing formulations and consecutive-hour-related regularizations achieve better performance than existing standard regression models and existing regularizations.

9 October 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TZTongxin Zhu
Tongxin Zhu
TSTuo Shi
Tuo Shi
JLJianzhong Li
Jianzhong Li
ZCZhipeng Cai
Zhipeng Cai
XZXun Zhou
Xun Zhou
Mobile Edge Computing(MEC) is a new computing approach in which computation tasks carried by Mobile Devices (MD) can be offloaded to MEC servers or computed locally. Since the mobile devices are always battery limited and computation tasks have strict deadlines, how to schedule the execution of each task energy effectively is important. Comparing with existing works, we consider a much more complexed scenario, in which multiple moving mobile devices sharing multiple heterogeneous MEC servers, and a problem named as Minimum Energy Consumption problem in Deadline-aware MEC system is formulated. Such problem is proved to be NP-Hard, and two approximation algorithms are proposed focusing on single and multiple MD scenarios, respectively. The performances of these algorithms are varied by theoretical analysis and simulations.

15 October 2018 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
XZXun Zhou
Xun Zhou
HRHuigui Rong
Huigui Rong
CYChang Yang
Chang Yang
QZQun Zhang
Qun Zhang
AKAmin Vahedian Khezerlou
Amin Vahedian Khezerlou
ALAlex X. Liu
Alex X. Liu
Taxi services play an important role in the public transportation system of large cities. Improving taxi business efficiency is an important societal problem. Most of the recent analytical approaches on this topic only considered how to maximize the pickup chance, energy efficiency, or profit for the immediate next trip when recommending seeking routes, therefore may not be optimal for the overall profit over an extended period of time due to ignoring the destination choice of potential passengers. To tackle this issue, we propose a novel Spatial Network-based Markov Decision Process (SN-MDP) with a rolling horizon configuration to recommend better driving directions. Given a set of historical taxi records and the current status (e.g., road segment and time) of a vacant taxi, we find the best move for this taxi to maximize the profit in the near future. We propose statistical models to estimate the necessary time-variant parameters of SN-MDP from data to avoid competition between drivers. In addition, we take into account fuel cost to assess profit, rather than only income. A case study and several experimental evaluations on a real taxi dataset from a major city in China show that our proposed approach improves the profit efficiency by up to 13.7 percent and outperforms baseline methods in all the time slots.

5 January 2022 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
YZYingxue Zhang
Yingxue Zhang
YLYanhua Li
Yanhua Li
XZXun Zhou
Xun Zhou
JLJun Luo
Jun Luo
ZZZhi-Li Zhang
Zhi-Li Zhang
Urban traffic status (e.g., traffic speed and volume) is highly dynamic in nature, namely, varying across space and evolving over time. Thus, predicting such traffic dynamics is of great importance to urban development and transportation management. However, it is very challenging to solve this problem due to spatial-temporal dependencies and traffic uncertainties. In this article, we solve the traffic dynamics prediction problem from Bayesian meta-learning perspective and propose a novel continuous spatial-temporal meta-learner (cST-ML), which is trained on a distribution of traffic prediction tasks segmented by historical traffic data with the goal of learning a strategy that can be quickly adapted to related but unseen traffic prediction tasks. cST-ML tackles the traffic dynamics prediction challenges by advancing the Bayesian black-box meta-learning framework through the following new points: (1) cST-ML captures the dynamics of traffic prediction tasks using variational inference, and to better capture the temporal uncertainties within tasks, cST-ML performs as a rolling window within each task; (2) cST-ML has novel designs in architecture, where CNN and LSTM are embedded to capture the spatial-temporal dependencies between traffic status and traffic-related features; (3) novel training and testing algorithms for cST-ML are designed. We also conduct experiments on two real-world traffic datasets (taxi inflow and traffic speed) to evaluate our proposed cST-ML. The experimental results verify that cST-ML can significantly improve the urban traffic prediction performance and outperform all baseline models especially when obvious traffic dynamics and temporal uncertainties are presented.

23 November 2020 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
XZXin Zhang
Xin Zhang
YLYanhua Li
Yanhua Li
XZXun Zhou
Xun Zhou
JLJun Luo
Jun Luo
Smart passenger-seeking strategies employed by taxi drivers contribute not only to drivers’ incomes, but also higher quality of service passengers received. Therefore, understanding taxi drivers’ behaviors and learning the good passenger-seeking strategies are crucial to boost taxi drivers’ well-being and public transportation quality of service. However, we observe that drivers’ preferences of choosing which area to find the next passenger are diverse and dynamic across locations and drivers. It is hard to learn the location-dependent preferences given the partial data (i.e., an individual driver's trajectory may not cover all locations). In this paper, we make the first attempt to develop conditional generative adversarial imitation learning (cGAIL) model, as a unifying collective inverse reinforcement learning framework that learns the driver's decision-making preferences and policies by transferring knowledge across taxi driver agents and across locations. Our evaluation results on three months of taxi GPS trajectory data in Shenzhen, China, demonstrate that the driver's preferences and policies learned from cGAIL are on average 34.7% more accurate than those learned from other state-of-the-art baseline approaches.