To read this content please select one of the options below:

An improved density-based approach to risk assessment on railway investment

Jingwei Guo (Henan Polytechnic University, Jiaozuo, China)
Ji Zhang (Henan Polytechnic University, Jiaozuo, China)
Yongxiang Zhang (Southwest Jiaotong University, Chengdu, China)
Peijuan Xu (Chang'an University, Xi'an, China)
Lutian Li (Henan Polytechnic University, Jiaozuo, China)
Zhongqi Xie (Henan Polytechnic University, Jiaozuo, China)
Qinglin Li (Southwest Jiaotong University, Chengdu, China)

Data Technologies and Applications

ISSN: 2514-9288

Article publication date: 1 November 2021

Issue publication date: 22 June 2022

224

Abstract

Purpose

Density-based spatial clustering of applications with noise (DBSCAN) is the most commonly used density-based clustering algorithm, while it cannot be directly applied to the railway investment risk assessment. To overcome the shortcomings of calculation method and parameter limits of DBSCAN, this paper proposes a new algorithm called Improved Multiple Density-based Spatial clustering of Applications with Noise (IM-DBSCAN) based on the DBSCAN and rough set theory.

Design/methodology/approach

First, the authors develop an improved affinity propagation (AP) algorithm, which is then combined with the DBSCAN (hereinafter referred to as AP-DBSCAN for short) to improve the parameter setting and efficiency of the DBSCAN. Second, the IM-DBSCAN algorithm, which consists of the AP-DBSCAN and a modified rough set, is designed to investigate the railway investment risk. Finally, the IM-DBSCAN algorithm is tested on the China–Laos railway's investment risk assessment, and its performance is compared with other related algorithms.

Findings

The IM-DBSCAN algorithm is implemented on China–Laos railway's investment risk assessment and compares with other related algorithms. The clustering results validate that the AP-DBSCAN algorithm is feasible and efficient in terms of clustering accuracy and operating time. In addition, the experimental results also indicate that the IM-DBSCAN algorithm can be used as an effective method for the prospective risk assessment in railway investment.

Originality/value

This study proposes IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set to study the railway investment risk. Different from the existing clustering algorithms, AP-DBSCAN put forward the density calculation method to simplify the process of optimizing DBSCAN parameters. Instead of using Euclidean distance approach, the cutoff distance method is introduced to improve the similarity measure for optimizing the parameters. The developed AP-DBSCAN is used to classify the China–Laos railway's investment risk indicators more accurately. Combined with a modified rough set, the IM-DBSCAN algorithm is proposed to analyze the railway investment risk assessment. The contributions of this study can be summarized as follows: (1) Based on AP, DBSCAN, an integrated methodology AP-DBSCAN, which considers improving the parameter setting and efficiency, is proposed to classify railway risk indicators. (2) As AP-DBSCAN is a risk classification model rather than a risk calculation model, an IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set is proposed to assess the railway investment risk. (3) Taking the China–Laos railway as a real-life case study, the effectiveness and superiority of the proposed IM-DBSCAN algorithm are verified through a set of experiments compared with other state-of-the-art algorithms.

Keywords

Acknowledgements

This work was supported by the National Natural Science Foundation of China (No. 61803147), in part by the Key Scientific and Technological Project of Henan Province (No. 182102310799).

Citation

Guo, J., Zhang, J., Zhang, Y., Xu, P., Li, L., Xie, Z. and Li, Q. (2022), "An improved density-based approach to risk assessment on railway investment", Data Technologies and Applications, Vol. 56 No. 3, pp. 382-408. https://doi.org/10.1108/DTA-11-2020-0291

Publisher

:

Emerald Publishing Limited

Copyright © 2021, Emerald Publishing Limited

Related articles