New feature selection methods based on opposition-based learning and self-adaptive cohort intelligence for predicting patient no-shows

被引:39
作者
Aladeemy, Mohammed [1 ]
Adwan, Linda [1 ]
Booth, Amy [2 ]
Khasawneh, Mohammad T. [1 ]
Poranki, Srikanth [2 ]
机构
[1] SUNY Binghamton, Dept Syst Sci & Ind Engn, Binghamton, NY 13902 USA
[2] United Hlth Serv Hosp, Binghamton, NY 13903 USA
关键词
Artificial intelligence; Machine learning; Feature selection; Opposition-based learning; Metaheuristic; Cohort intelligence; Health care; Classification; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; BROKEN APPOINTMENTS; SEARCH ALGORITHM; TIME; CLASSIFICATION; RANDOMNESS; WRAPPER;
D O I
10.1016/j.asoc.2019.105866
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Patient no-shows have significant adverse effects on healthcare systems. Therefore, predicting patients' no-shows is necessary to use their appointment slots effectively. In the literature, filter feature selection methods have been prominently used for patient no-show prediction. However, filter methods are less effective than wrapper methods. This paper presents new wrapper methods based on three variants of the proposed algorithm, Opposition-based Self-Adaptive Cohort Intelligence (OSACI). The three variants of OSACI are referred to in this paper as OSACI-Init, OSACI-Update, and OSACI-Init_Update, which are formed by the integration of Self-Adaptive Cohort Intelligence (SACI) with three Opposition-based Learning (OBL) strategies; namely: OBL initialization, OBL update, and OBL initialization and update, respectively. The performance of the proposed algorithms was examined and compared with that of Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), and SACI in terms of AUC, sensitivity, specificity, dimensionality reduction, and convergence speed. Patient no-show data of a primary care clinic in upstate New York was used in the numerical experiments. The results showed that the proposed algorithms outperformed the other compared algorithms by achieving higher dimensionality reduction and better convergence speed while achieving comparable AUC, sensitivity, and specificity scores. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 91 条
  • [1] An improved Opposition-Based Sine Cosine Algorithm for global optimization
    Abd Elaziz, Mohamed
    Oliva, Diego
    Xiong, Shengwu
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 90 : 484 - 500
  • [2] Opposition-based learning in the shuffled bidirectional differential evolution algorithm
    Ahandani, Morteza Alinia
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2016, 26 : 64 - 85
  • [3] Opposition-based learning in the shuffled differential evolution algorithm
    Ahandani, Morteza Alinia
    Alavi-Rad, Hosein
    [J]. SOFT COMPUTING, 2012, 16 (08) : 1303 - 1337
  • [4] Al-Mashraie M., 2016, THESIS
  • [5] A new hybrid approach for feature selection and support vector machine model selection based on self-adaptive cohort intelligence
    Aladeemy, Mohammed
    Tutun, Salih
    Khasawneh, Mohammad T.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 88 : 118 - 131
  • [6] A probabilistic model for predicting the probability of no-show in hospital appointments
    Alaeddini, Adel
    Yang, Kai
    Reddy, Chandan
    Yu, Susan
    [J]. HEALTH CARE MANAGEMENT SCIENCE, 2011, 14 (02) : 146 - 157
  • [7] Asynchronous accelerating multi-leader salp chains for feature selection
    Aljarah, Ibrahim
    Mafarja, Majdi
    Heidari, Ali Asghar
    Faris, Hossam
    Zhang, Yong
    Mirjalili, Seyedali
    [J]. APPLIED SOFT COMPUTING, 2018, 71 : 964 - 979
  • [8] ALPERT JJ, 1964, PEDIATRICS, V34, P127
  • [9] A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm
    Amoshahy, Mohammad Javad
    Shamsi, Mousa
    Sedaaghi, Mohammad Hossein
    [J]. PLOS ONE, 2016, 11 (08):
  • [10] [Anonymous], NAT HLTH EXP PROJ 20