RETRACTED: Hybrid harmony search algorithm for social network contact tracing of COVID-19 (Retracted article. See MAY, 2023)

被引:23
作者
Al-Shaikh, Ala'a [1 ]
Mahafzah, Basel A. [2 ]
Alshraideh, Mohammad [2 ]
机构
[1] Al Balqa Appl Univ, Learning & Teaching Technol Ctr, Al Salt 19117, Jordan
[2] Univ Jordan, King Abdulla II Sch Informat Technol, Dept Comp Sci, Amman 11942, Jordan
关键词
Harmony search algorithm; Hill climbing; Metaheuristic approach; Social networks; Contact tracing; COVID-19; Coronavirus; STRONGLY CONNECTED COMPONENTS; OPTIMIZATION ALGORITHM; SELECTION;
D O I
10.1007/s00500-021-05948-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The coronavirus disease 2019 (COVID-19) was first reported in December 2019 in Wuhan, China, and then moved to almost every country showing an unprecedented outbreak. The world health organization declared COVID-19 a pandemic. Since then, millions of people were infected, and millions have lost their lives all around the globe. By the end of 2020, effective vaccines that could prevent the fast spread of the disease started to loom on the horizon. Nevertheless, isolation, social distancing, face masks, and quarantine are the best-known measures, in the time being, to fight the pandemic. On the other hand, contact tracing is an effective procedure in tracking infections and saving others' lives. In this paper, we devise a new approach using a hybrid harmony search (HHS) algorithm that casts the problem of finding strongly connected components (SCCs) to contact tracing. This new approach is named as hybrid harmony search contact tracing (HHS-CT) algorithm. The hybridization is achieved by integrating the stochastic hill climbing into the operators' design of the harmony search algorithm. The HHS-CT algorithm is compared to other existing algorithms of finding SCCs in directed graphs, where it showed its superiority over these algorithms. The devised approach provides a 77.18% enhancement in terms of run time and an exceptional average error rate of 1.7% compared to the other existing algorithms of finding SCCs.
引用
收藏
页码:3343 / 3365
页数:23
相关论文
共 80 条
[31]   Directed Graphs Without Short Cycles [J].
Fox, Jacob ;
Keevash, Peter ;
Sudakov, Benny .
COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (02) :285-301
[32]   A new heuristic optimization algorithm: Harmony search [J].
Geem, ZW ;
Kim, JH ;
Loganathan, GV .
SIMULATION, 2001, 76 (02) :60-68
[33]  
Geldenhuys J, 2004, LECT NOTES COMPUT SC, V2988, P205
[34]   Metaheuristics: review and application [J].
Gogna, Anupriya ;
Tayal, Akash .
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2013, 25 (04) :503-526
[35]  
Government of Singapore, 2020, HELP FIGHT COVID 19
[36]   On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs [J].
Hong, Sungpack ;
Rodia, Nicole C. ;
Olukotun, Kunle .
2013 INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SC), 2013,
[37]  
Jordan Ministry of Health, 2020, AM
[38]   Modeling and Analyzing the Corona-Virus Warning App with the Isabelle Infrastructure Framework [J].
Kammueller, Florian ;
Lutz, Bianca .
DATA PRIVACY MANAGEMENT, CRYPTOCURRENCIES AND BLOCKCHAIN TECHNOLOGY, ESORICS 2020, DPM 2020, CBT 2020, 2020, 12484 :128-144
[39]  
Kunegis J, 2013, PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'13 COMPANION), P1343
[40]   SNAP: A General-Purpose Network Analysis and Graph-Mining Library [J].
Leskovec, Jure ;
Sosic, Rok .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2016, 8 (01)