Xiao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiao Liu has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Peng Jiang
Department of Industrial Engineering and Management, Business School, Sichuan University, Chengdu 610064, China
7 shared publications Jieyu Zhou
NUS Environmental Research Institute (NERI), National University of Singapore, Singapore 117411, Singapore
3 shared publicationsPeng Jiang
Department of Industrial Engineering and Engineering Management, Business School, Sichuan University, Chengdu 610064, China
3 shared publications- Wenjun J. Zhang
Department of Mechanical Engineering, College of Engineering, University of Saskatchewan, SK, Canada
3 shared publications Y. L. Tu
University of Calgary
3 shared publications- Jian Zhang
Northeastern University
2 shared publications
Latest Publications
- 13 June 2022
- Published by Taylor & Francis in IISE Transactions
- Vol. 55 (3) , 229-241
Online non-convex learning for river pollution source identification
In this article, novel gradient-based online learning algorithms are developed to investigate an important environmental application: real-time river pollution source identification, which aims at estimating the released mass, location, and time of a river pollution source based on downstream sensor data monitoring the pollution concentration. The pollution is assumed to be instantaneously released once. The problem can be formulated as a non-convex loss minimization problem in statistical learning, and our online algorithms have vectorized and adaptive step sizes to ensure high estimation accuracy in three dimensions which have different magnitudes. In order to keep the algorithm from sticking in the saddle points of non-convex loss, the “escaping from saddle points” module and multi-start setting are derived to further improve the estimation accuracy by searching for the global minimizer of the loss functions. This can be shown theoretically and experimentally as the O(N) local regret of the algorithms and the high probability cumulative regret bound O(N) under a particular error bound condition in loss functions. A real-life river pollution source identification example shows the superior performance of our algorithms compared with existing methods in terms of estimation accuracy. Managerial insights for the decision maker to use the algorithms are also provided.
- 13 June 2022
- Published by Taylor & Francis in IISE Transactions
- Vol. 55 (3) , 229-241
Online non-convex learning for river pollution source identification
In this article, novel gradient-based online learning algorithms are developed to investigate an important environmental application: real-time river pollution source identification, which aims at estimating the released mass, location, and time of a river pollution source based on downstream sensor data monitoring the pollution concentration. The pollution is assumed to be instantaneously released once. The problem can be formulated as a non-convex loss minimization problem in statistical learning, and our online algorithms have vectorized and adaptive step sizes to ensure high estimation accuracy in three dimensions which have different magnitudes. In order to keep the algorithm from sticking in the saddle points of non-convex loss, the “escaping from saddle points” module and multi-start setting are derived to further improve the estimation accuracy by searching for the global minimizer of the loss functions. This can be shown theoretically and experimentally as the O(N) local regret of the algorithms and the high probability cumulative regret bound O(N) under a particular error bound condition in loss functions. A real-life river pollution source identification example shows the superior performance of our algorithms compared with existing methods in terms of estimation accuracy. Managerial insights for the decision maker to use the algorithms are also provided.
- Open Access
Online non-convex learning for river pollution source identification
In this paper, novel gradient-based online learning algorithms are developed to investigate an important environmental application: real-time river pollution source identification, which aims at estimating the released mass, location, and time of a river pollution source based on downstream sensor data monitoring the pollution concentration. The pollution is assumed to be instantaneously released once. The problem can be formulated as a non-convex loss minimization problem in statistical learning, and our online algorithms have vectorized and adaptive step sizes to ensure high estimation accuracy in three dimensions which have different magnitudes. In order to keep the algorithm from stucking to the saddle points of non-convex loss, the escaping from saddle points module and multi-start setting are derived to further improve the estimation accuracy by searching for the global minimizer of the loss functions. This can be shown theoretically and experimentally as the $O(N)$ local regret of the algorithms and the high probability cumulative regret bound $O(N)$ under a particular error bound condition in loss functions. A real-life river pollution source identification example shows the superior performance of our algorithms compared to existing methods in terms of estimation accuracy. Managerial insights for the decision maker to use the algorithms are also provided.Open AccessOnline non-convex learning for river pollution source identification
In this paper, novel gradient-based online learning algorithms are developed to investigate an important environmental application: real-time river pollution source identification, which aims at estimating the released mass, location, and time of a river pollution source based on downstream sensor data monitoring the pollution concentration. The pollution is assumed to be instantaneously released once. The problem can be formulated as a non-convex loss minimization problem in statistical learning, and our online algorithms have vectorized and adaptive step sizes to ensure high estimation accuracy in three dimensions which have different magnitudes. In order to keep the algorithm from stucking to the saddle points of non-convex loss, the escaping from saddle points module and multi-start setting are derived to further improve the estimation accuracy by searching for the global minimizer of the loss functions. This can be shown theoretically and experimentally as the $O(N)$ local regret of the algorithms and the high probability cumulative regret bound $O(N)$ under a particular error bound condition in loss functions. A real-life river pollution source identification example shows the superior performance of our algorithms compared to existing methods in terms of estimation accuracy. Managerial insights for the decision maker to use the algorithms are also provided. - 23 February 2022
- Published by Elsevier in Waste Management
- Vol. 142, 120-131
Investigating the influencing factors of incentive-based household waste recycling using structural equation modelling
- 23 February 2022
- Published by Elsevier in Waste Management
- Vol. 142, 120-131
Investigating the influencing factors of incentive-based household waste recycling using structural equation modelling
- 1 March 2021
- Published by Elsevier in Waste Management
- Vol. 123, 142-153
Designing a smart incentive-based recycling system for household recyclable waste
- 1 March 2021
- Published by Elsevier in Waste Management
- Vol. 123, 142-153
Designing a smart incentive-based recycling system for household recyclable waste
- 11 November 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (24) , 7423-7440
Intermittent demand forecasting for spare parts in the heavy-duty vehicle industry: a support vector machine model
Intermittent demand occurs commonly for spare parts in the heavy-duty vehicle industry. Demand uncertainty and intermittency pose challenges to demand forecasting by conventional models. Support vector machine (SVM) models have been observed to yield competitive accuracy with existing models. However, there are still limitations for basic SVM models. First, the time-consuming computation does not bring a statistically significant accuracy improvement. Second, the forecasting-based inventory performance has not been sufficiently explored. Third, scarce explanations of model robustness are offered for demand forecasting. We build an adaptive univariate SVM (AUSVM) model to forecast intermittent demand. Its effectiveness, compared to 12 existing models and an improved neural-network, is demonstrated by real-world data from a heavy-duty vehicle spare-part company. AUSVM has an apparent advantage in computation time over basic SVM and neural networks. The computational results of the heavy-duty vehicle case indicate that, compared to well-known parametric models, AUSVM achieves a statistically significant accuracy improvement and better inventory performance for the group of non-smooth demand series. Discussions are presented on why AUSVM works for demand forecasting and inventory control of heavy-duty vehicle spare parts. Several insights are revealed for practitioners in the heavy-duty vehicle industry.
- 11 November 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (24) , 7423-7440
Intermittent demand forecasting for spare parts in the heavy-duty vehicle industry: a support vector machine model
Intermittent demand occurs commonly for spare parts in the heavy-duty vehicle industry. Demand uncertainty and intermittency pose challenges to demand forecasting by conventional models. Support vector machine (SVM) models have been observed to yield competitive accuracy with existing models. However, there are still limitations for basic SVM models. First, the time-consuming computation does not bring a statistically significant accuracy improvement. Second, the forecasting-based inventory performance has not been sufficiently explored. Third, scarce explanations of model robustness are offered for demand forecasting. We build an adaptive univariate SVM (AUSVM) model to forecast intermittent demand. Its effectiveness, compared to 12 existing models and an improved neural-network, is demonstrated by real-world data from a heavy-duty vehicle spare-part company. AUSVM has an apparent advantage in computation time over basic SVM and neural networks. The computational results of the heavy-duty vehicle case indicate that, compared to well-known parametric models, AUSVM achieves a statistically significant accuracy improvement and better inventory performance for the group of non-smooth demand series. Discussions are presented on why AUSVM works for demand forecasting and inventory control of heavy-duty vehicle spare parts. Several insights are revealed for practitioners in the heavy-duty vehicle industry.
- 1 April 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 282 (2) , 660-676
Maximum excess dominance: Identifying impractical solutions in linear problems with interval coefficients
- 1 April 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 282 (2) , 660-676
Maximum excess dominance: Identifying impractical solutions in linear problems with interval coefficients
- 24 March 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (8) , 2537-2557
Bayesian Stackelberg game model for water supply networks against interdictions with mixed strategies
We address a problem of preventing an interdiction on water supply networks by building a Bayesian Stackelberg game model involving stakeholders of a defender and an interdictor. The defender initiates to allocate resource to network components to make a trade-off between network resilience measured by water satisfaction rate and the defender's cost, whereas the interdictor follows to interdict a component with the objectives of maximising the destruction level on the network structure and minimising the interdictor's cost. Specifically, the defender adopts mixed defence strategies, which implies that the interdictor is uncertain of the defender's resource allocation. Moreover, we propose sufficient conditions for the elimination of the dominated defence and interdiction strategies. A decomposed iterative learning algorithm (DILA) and a smallest-depth binary-partition based hierarchical algorithm (SBHA) are developed to reduce the sizes of the defence and interdiction strategy sets, respectively, thus analysing the optimal mixed defence strategies. Finally, a real case study with private information is conducted, thus providing valuable suggestions for the defender's resource allocation against interdictions.
- 24 March 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (8) , 2537-2557
Bayesian Stackelberg game model for water supply networks against interdictions with mixed strategies
We address a problem of preventing an interdiction on water supply networks by building a Bayesian Stackelberg game model involving stakeholders of a defender and an interdictor. The defender initiates to allocate resource to network components to make a trade-off between network resilience measured by water satisfaction rate and the defender's cost, whereas the interdictor follows to interdict a component with the objectives of maximising the destruction level on the network structure and minimising the interdictor's cost. Specifically, the defender adopts mixed defence strategies, which implies that the interdictor is uncertain of the defender's resource allocation. Moreover, we propose sufficient conditions for the elimination of the dominated defence and interdiction strategies. A decomposed iterative learning algorithm (DILA) and a smallest-depth binary-partition based hierarchical algorithm (SBHA) are developed to reduce the sizes of the defence and interdiction strategy sets, respectively, thus analysing the optimal mixed defence strategies. Finally, a real case study with private information is conducted, thus providing valuable suggestions for the defender's resource allocation against interdictions.
- 1 February 2020
- Published by Elsevier in Waste Management
- Vol. 103, 285-295
Data-driven analytical framework for waste-dumping behaviour analysis to facilitate policy regulations
- 1 February 2020
- Published by Elsevier in Waste Management
- Vol. 103, 285-295
Data-driven analytical framework for waste-dumping behaviour analysis to facilitate policy regulations
- Open Access
YouTube for Patient Education: A Deep Learning Approach for Understanding Medical Knowledge from User-Generated Videos
YouTube presents an unprecedented opportunity to explore how machine learning methods can improve healthcare information dissemination. We propose an interdisciplinary lens that synthesizes machine learning methods with healthcare informatics themes to address the critical issue of developing a scalable algorithmic solution to evaluate videos from a health literacy and patient education perspective. We develop a deep learning method to understand the level of medical knowledge encoded in YouTube videos. Preliminary results suggest that we can extract medical knowledge from YouTube videos and classify videos according to the embedded knowledge with satisfying performance. Deep learning methods show great promise in knowledge extraction, natural language understanding, and image classification, especially in an era of patient-centric care and precision medicine.
Open AccessYouTube for Patient Education: A Deep Learning Approach for Understanding Medical Knowledge from User-Generated Videos
YouTube presents an unprecedented opportunity to explore how machine learning methods can improve healthcare information dissemination. We propose an interdisciplinary lens that synthesizes machine learning methods with healthcare informatics themes to address the critical issue of developing a scalable algorithmic solution to evaluate videos from a health literacy and patient education perspective. We develop a deep learning method to understand the level of medical knowledge encoded in YouTube videos. Preliminary results suggest that we can extract medical knowledge from YouTube videos and classify videos according to the embedded knowledge with satisfying performance. Deep learning methods show great promise in knowledge extraction, natural language understanding, and image classification, especially in an era of patient-centric care and precision medicine.