A graph model for preventing railway accidents based on the maximal information coefficient

被引:5
|
作者
Shao, Fubo [1 ]
Li, Keping [1 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, 3 Shangyuancun, Beijing 100044, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
Railway accidents; graph model; the maximal information coefficient (MIC); artificial neural networks; SMALL-WORLD NETWORKS; BIG DATA; STAMP; CHALLENGES; ACCIMAP; HFACS;
D O I
10.1142/S0217979217500102
中图分类号
O59 [应用物理学];
学科分类号
摘要
A number of factors influences railway safety. It is an important work to identify im portant influencing factors and to build the relationship between railway accident its influencing factors. The maximal information coefficient (MIC) is a good measure of dependence for two-variable relationships which can capture a wide range of associactions. Employing MIC, a graph model is proposed for preventing railway accidents which avoids complex mathematical computation. In the graph, nodes denote influencing factors of railway accidents and edges represent dependence of the two linked factors. With the increasing of dependence level, the graph changes from a globally coupled graph to isolated points. Moreover, the important influencing factors are identified from many o factors which are the monitor key. Then the relationship between railway accident and ti important influencing factors is obtained by employing the artificial neural networks. With the relationship, a warning mechanism is built by giving the dangerous zone. If the related factors fall into the dangerous zone in railway operations, the warning level should be raised. The built warning mechanism can prevent railway accidents and can promote railway safety.
引用
收藏
页数:19
相关论文
共 50 条
  • [31] A Graph Model for Clustering Based on Mutual Information
    Yoshida, Tetsuya
    PRICAI 2010: TRENDS IN ARTIFICIAL INTELLIGENCE, 2010, 6230 : 339 - 350
  • [32] Assembly Information Model Based on Knowledge Graph
    Chen Z.
    Bao J.
    Zheng X.
    Liu T.
    Journal of Shanghai Jiaotong University (Science), 2020, 25 (05) : 578 - 588
  • [33] A graph model for mutual information based clustering
    Yoshida, Tetsuya
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2011, 37 (02) : 187 - 216
  • [34] A Novel Algorithm for the Precise Calculation of the Maximal Information Coefficient
    Yi Zhang
    Shili Jia
    Haiyun Huang
    Jiqing Qiu
    Changjie Zhou
    Scientific Reports, 4
  • [35] Resolution dependence of the maximal information coefficient for noiseless relationship
    Shih-Chang Lee
    Ning-Ning Pang
    Wen-Jer Tzeng
    Statistics and Computing, 2014, 24 : 845 - 852
  • [36] Cleaning up the record on the maximal information coefficient and equitability
    Reshef, David N.
    Reshef, Yakir A.
    Mitzenmacher, Michael
    Sabeti, Pardis C.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2014, 111 (33) : E3362 - E3363
  • [37] An improved algorithm for the maximal information coefficient and its application
    Cao, Dan
    Chen, Yuan
    Chen, Jin
    Zhang, Hongyan
    Yuan, Zheming
    ROYAL SOCIETY OPEN SCIENCE, 2021, 8 (02):
  • [38] Resolution dependence of the maximal information coefficient for noiseless relationship
    Lee, Shih-Chang
    Pang, Ning-Ning
    Tzeng, Wen-Jer
    STATISTICS AND COMPUTING, 2014, 24 (05) : 845 - 852
  • [39] A Novel Algorithm for the Precise Calculation of the Maximal Information Coefficient
    Zhang, Yi
    Jia, Shili
    Huang, Haiyun
    Qiu, Jiqing
    Zhou, Changjie
    SCIENTIFIC REPORTS, 2014, 4
  • [40] Feature Selection with Attributes Clustering by Maximal Information Coefficient
    Zhao, Xi
    Deng, Wei
    Shi, Yong
    FIRST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT, 2013, 17 : 70 - 79