{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:47:45Z","timestamp":1754156865479,"version":"3.41.2"},"reference-count":48,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2022,6,22]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>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.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>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\u2013Laos railway's investment risk assessment, and its performance is compared with other related algorithms.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The IM-DBSCAN algorithm is implemented on China\u2013Laos 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.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>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\u2013Laos 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\u2013Laos 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.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-11-2020-0291","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T10:13:30Z","timestamp":1635416010000},"page":"382-408","source":"Crossref","is-referenced-by-count":7,"title":["An improved density-based approach to risk assessment on railway investment"],"prefix":"10.1108","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8282-8431","authenticated-orcid":false,"given":"Jingwei","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4682-5249","authenticated-orcid":false,"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2746-801X","authenticated-orcid":false,"given":"Yongxiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peijuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5154-0870","authenticated-orcid":false,"given":"Lutian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7072-4085","authenticated-orcid":false,"given":"Zhongqi","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2540-6416","authenticated-orcid":false,"given":"Qinglin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2021,11,1]]},"reference":[{"issue":"1","key":"key2022062212532463200_ref001","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.bbe.2020.01.008","article-title":"A robust method for early diagnosis of autism spectrum disorder from EEG signals based on feature selection and DBSCAN method","volume":"40","year":"2020","journal-title":"Biocybernetics and Biomedical Engineering"},{"year":"1998","first-page":"94","article-title":"Automatic subspace clustering of high dimensional data for data mining applications","key":"key2022062212532463200_ref002"},{"year":"1999","first-page":"49","article-title":"OPTICS: ordering points to identify the clustering structure","key":"key2022062212532463200_ref003"},{"year":"2017","article-title":"Substantiation of K-means and affinity propagation algorithm","key":"key2022062212532463200_ref004"},{"issue":"01","key":"key2022062212532463200_ref005","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0218195919400028","article-title":"Faster DB-scan and HDB-scan in low-dimensional Euclidean spaces","volume":"29","year":"2019","journal-title":"International Journal of Computational Geometry and Applications"},{"year":"2017","article-title":"Lithology mapping by affinity propagation algorithm","key":"key2022062212532463200_ref006"},{"issue":"10","key":"key2022062212532463200_ref007","doi-asserted-by":"crossref","first-page":"3872","DOI":"10.1016\/j.eswa.2012.12.040","article-title":"Application of decision-making techniques in supplier selection: a systematic review of literature","volume":"40","year":"2013","journal-title":"Expert System Application"},{"issue":"11","key":"key2022062212532463200_ref008","first-page":"375","article-title":"A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data","volume":"83","year":"2018","journal-title":"Pattern Recognit"},{"issue":"1","key":"key2022062212532463200_ref009","article-title":"BLOCK-DBSCAN: fast clustering for large scale data","volume":"109","year":"2021","journal-title":"Pattern Recognit."},{"issue":"9","key":"key2022062212532463200_ref010","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1016\/j.ins.2010.01.014","article-title":"A hybrid model based on rough sets theory and genetic algorithms for stock price forecasting","volume":"180","year":"2010","journal-title":"Information Science"},{"year":"2015","first-page":"749","article-title":"An alternating optimization approach based on hierarchical adaptations of DBSCAN","key":"key2022062212532463200_ref011"},{"issue":"34","key":"key2022062212532463200_ref012","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","year":"1996","journal-title":"Data Mining Knowledge Discovery"},{"year":"1987","first-page":"461","article-title":"Improving inference through conceptual clustering","key":"key2022062212532463200_ref013"},{"issue":"458","key":"key2022062212532463200_ref014","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1198\/016214502760047131","article-title":"Model-based clustering, discriminant analysis, and density estimation","volume":"97","year":"2002","journal-title":"Journal American Statistical Association"},{"issue":"5814","key":"key2022062212532463200_ref015","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","year":"2007","journal-title":"Science"},{"year":"2018","first-page":"1067","article-title":"Fast Euclidean optics with bounded precision in low dimensional space","key":"key2022062212532463200_ref016"},{"issue":"3","key":"key2022062212532463200_ref017","doi-asserted-by":"crossref","first-page":"5163","DOI":"10.1109\/JIOT.2019.2897434","article-title":"Identification of vulnerable lines in smart grid systems based on affinity propagation clustering","volume":"6","year":"2019","journal-title":"IEEE Internet of Things Journal"},{"year":"2013","article-title":"A faster algorithm for DBSCAN\/Ade Gunawan; supervisor M.T","key":"key2022062212532463200_ref018"},{"issue":"2","key":"key2022062212532463200_ref019","first-page":"26885","article-title":"Railway passenger flow recognition algorithm for terminal station based on cost theory and automatic frequency control","volume":"8","year":"2020","journal-title":"IEEE Access"},{"key":"key2022062212532463200_ref020","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.ins.2016.02.009","article-title":"Transfer affinity propagation-based clustering","volume":"348","year":"2016","journal-title":"Information Science"},{"issue":"1","key":"key2022062212532463200_ref021","first-page":"100","article-title":"Algorithm AS 136: a k-means clustering algorithm","volume":"28","year":"1979","journal-title":"Application Statistics"},{"year":"2020","article-title":"Rough sets: a bibliometric analysis from 2014 to 2018","key":"key2022062212532463200_ref022"},{"issue":"7","key":"key2022062212532463200_ref023","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1109\/TIP.2016.2559803","article-title":"DSets-DBSCAN: a parameter-free clustering algorithm","volume":"25","year":"2016","journal-title":"IEEE Transactions Image Processing"},{"issue":"4","key":"key2022062212532463200_ref024","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1109\/TBME.2018.2866764","article-title":"A novel extension tofuzzy connectivity for body composition analysis: applications in thigh, brain, and whole bodytissue segmentation","volume":"66","year":"2019","journal-title":"IEEE Transactions on Biomedical Engineering"},{"issue":"7","key":"key2022062212532463200_ref025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5120\/15890-5059","article-title":"Choosing DBSCAN parameters automatically using differential evolution","volume":"91","year":"2014","journal-title":"International Journal Computing Application"},{"volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","year":"1990","key":"key2022062212532463200_ref026"},{"year":"2010","article-title":"TI-DBSCAN: clustering with DBSCAN by means of theTriangle inequality","key":"key2022062212532463200_ref027"},{"issue":"5","key":"key2022062212532463200_ref028","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.knosys.2007.01.002","article-title":"A rough sets based characteristic relation approach for dynamic attribute generalization in data mining","volume":"20","year":"2007","journal-title":"Knowledge-Based System"},{"issue":"5","key":"key2022062212532463200_ref029","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.1109\/TIM.2019.2919375","article-title":"Damage localization of stacker's track based on EEMD-EMD and DBSCAN cluster algorithms","volume":"69","year":"2020","journal-title":"IEEE Transactions on Instrumentation and Measurement"},{"issue":"5","key":"key2022062212532463200_ref030","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","article-title":"CLARANS: a method for clustering objects for spatial data mining","volume":"14","year":"2002","journal-title":"IEEE Transactions Knowledge Data Engineering"},{"issue":"6","key":"key2022062212532463200_ref031","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1109\/TKDE.2019.2901853","article-title":"Semi-supervised learning with auto-weighting feature and adaptive graph","volume":"32","year":"2020","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"key2022062212532463200_ref032","first-page":"247","article-title":"A new approach to determine Eps parameter of DBSCAN algorithm","volume":"5","year":"2017","journal-title":"International Journal Intelligent System Application Engineering"},{"issue":"5","key":"key2022062212532463200_ref033","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","year":"1982","journal-title":"International Journal Computing Information Science"},{"issue":"1","key":"key2022062212532463200_ref034","first-page":"1","article-title":"Rough sets and intelligent data analysis","volume":"147","year":"2002","journal-title":"Information Sciences"},{"issue":"1","key":"key2022062212532463200_ref035","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","article-title":"Rudiments of rough sets","volume":"177","year":"2007","journal-title":"Information Sciences"},{"issue":"1","key":"key2022062212532463200_ref036","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ins.2006.06.006","article-title":"Rough sets: some extensions","volume":"177","year":"2007","journal-title":"Information Sciences"},{"year":"2020","first-page":"129","article-title":"Multiple ellipse detection by using RANSAC and DBSCAN method","key":"key2022062212532463200_ref037"},{"year":"2020","article-title":"Multiple ellipse detection by using RANSAC and DBSCAN method","key":"key2022062212532463200_ref038"},{"volume-title":"Research on Technical Problems Related to \u201cGoing Global\u201d Strategy-Study on Construction and Operation of China-Laos Railway Project [R]","year":"2014","author":"Southwest Jiaotong University, China Railway Corporation","key":"key2022062212532463200_ref039"},{"issue":"16","key":"key2022062212532463200_ref040","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1016\/j.patrec.2009.08.008","article-title":"Rough-DBSCAN: a fast hybrid density based clustering method for large data sets","volume":"30","year":"2009","journal-title":"Pattern Recognition Letters"},{"issue":"12","key":"key2022062212532463200_ref041","doi-asserted-by":"crossref","first-page":"2670","DOI":"10.1109\/TNNLS.2015.2495268","article-title":"K-MEAP: multiple exemplars affinity propagation with specified k clusters","volume":"27","year":"2016","journal-title":"IEEE Transaction Neural Network Learning System"},{"year":"1997","first-page":"186","article-title":"STING: a statistical information grid approach to spatial data mining","key":"key2022062212532463200_ref042"},{"year":"2015","first-page":"445","article-title":"Adaptive density-based spatial clustering of applications with noise (DBSCAN) according to data","key":"key2022062212532463200_ref043"},{"key":"key2022062212532463200_ref044","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2012.02.065","article-title":"Covering based rough set approximations","volume":"200","year":"2012","journal-title":"Information Science"},{"key":"key2022062212532463200_ref045","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ins.2018.10.016","article-title":"Covering based multigranulation (I,T)-fuzzy rough set models and applications in multi-attribute group decision-making","volume":"476","year":"2019","journal-title":"Information Science"},{"year":"1996","first-page":"103","article-title":"BIRCH: an efficient data clustering method for very large databases","key":"key2022062212532463200_ref046"},{"issue":"7","key":"key2022062212532463200_ref047","first-page":"1967","article-title":"Research on adaptive parameters determination in DBSCAN algorithm","volume":"9","year":"2012","journal-title":"Journal of Information and Computational Science"},{"issue":"8","key":"key2022062212532463200_ref048","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1109\/TKDE.2007.1044","article-title":"On three types of covering-based rough sets","volume":"19","year":"2007","journal-title":"IEEE Transactions Knowledge Data Engineering"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-11-2020-0291\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-11-2020-0291\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:28Z","timestamp":1753398928000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/56\/3\/382-408\/511176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":48,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,11,1]]},"published-print":{"date-parts":[[2022,6,22]]}},"alternative-id":["10.1108\/DTA-11-2020-0291"],"URL":"https:\/\/doi.org\/10.1108\/dta-11-2020-0291","relation":{},"ISSN":["2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2021,11,1]]}}}