Black hole algorithm as a heuristic approach for rare event classification problem

被引:0
|
作者
Yildirim, Elif [1 ,2 ]
机构
[1] Konya Tech Univ, Dept Stat & Qual Coordinator, Konya, Turkiye
[2] Hacettepe Univ, Dept Stat, Ankara, Turkiye
关键词
Black hole algorithm; Meta heuristics algorithm; Rare events; Logistic regression; Simulation study; Bias; LOGISTIC-REGRESSION;
D O I
10.18187/pjsor.v19i4.4211
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The logistic regression is generally preferred when there is no big difference in the occurrence frequencies of two possible results for the considered event. However, for the events occurring rarely such as wars, economic crisis and natural disasters, namely having relatively small occurrence frequency when compared to the general events, the logistic regression gives biased parameter estimations. Therefore, the logistic regression underestimates the occurrence probability of the rare events. In this study, a modification of the black hole algorithm (BHA) is proposed as an alternative to the classical logistic regression method in order to obtain more reliable and unbiased rare event parameter estimates. To examine the performance of the proposed approach, we calculate bias and root mean square errors based on Monte Carlo (MC) simulations. We used logistic regression to generate data for the rare event in the simulations and gave values to the beta(0) parameter to obtain different rarity levels. The performance of the methods was examined in different scenarios using comprehensive MC simulations under different conditions for the rarity level and number of subjects. In addition, real-life data was used to examine the classification performance of the proposed approach and the precision, sensitivity and specificity values of the two methods were compared. As a result, we obtained that the proposed BHA gives less biased predictions than logistic regression in simulation and real-life data and has higher classification performance. Additionally, rareness levels have a significant impact on the parameter estimates of the methods.
引用
收藏
页码:623 / 635
页数:13
相关论文
共 50 条
  • [31] Heuristic approach to a multitransshipment problem
    LOCKETT AG
    PORTLOCK MK
    INFOR Journal, 1971, 9 (02): : 132 - 139
  • [32] A heuristic algorithm for the fixed charge problem
    Adlakha V.
    Kowalski K.
    OPSEARCH, 2010, 47 (2) : 166 - 175
  • [33] HEURISTIC ALGORITHM FOR TRANSPORTATION LOCATION PROBLEM
    COOPER, L
    OPERATIONS RESEARCH, 1975, 23 : B295 - B295
  • [34] Heuristic Algorithm for the Cell Formation Problem
    Bychkov, Ilya
    Batsyn, Mikhail
    Sukhov, Pavel
    Pardalos, Panos M.
    MODELS, ALGORITHMS, AND TECHNOLOGIES FOR NETWORK ANALYSIS, 2013, 59 : 43 - 69
  • [35] A Heuristic Algorithm for Flowshop Scheduling Problem
    Tang, Dan
    Shu, Hong Ping
    MANUFACTURING ENGINEERING AND AUTOMATION II, PTS 1-3, 2012, 591-593 : 626 - 630
  • [36] A Heuristic Algorithm for the Network Design Problem
    Tuba, Milan
    RECENT ADVANCES IN NEURAL NETWORKS, FUZZY SYSTEMS & EVOLUTIONARY COMPUTING, 2010, : 173 - 178
  • [37] A Heuristic Algorithm for the Band Collocation Problem
    Gursoy, Arif
    Kurt, Mehmet
    Kutucu, Hakan
    Nuriyev, Urfat
    2016 IEEE 10TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT), 2016, : 473 - 476
  • [38] Heuristic algorithm for univariate stratification problem
    Brito, Jose Andre
    Semaan, Gustavo
    De Lima, Leonardo
    Fadel, Augusto
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (06) : 3033 - 3060
  • [39] A Heuristic Algorithm for the Network Design Problem
    Tuba, Milan
    RECENT ADVANCES IN NEURAL NETWORKS, FUZZY SYSTEMS & EVOLUTIONARY COMPUTING, 2010, : 14 - 14
  • [40] A HEURISTIC PARTITIONING ALGORITHM FOR A PACKAGING PROBLEM
    KORCHEMKIN, MB
    COMPUTING, 1983, 31 (03) : 203 - 209