ORCID Profile
0000-0002-7481-4854
Current Organisation
Yarmouk University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Hindawi Limited
Date: 22-11-2020
DOI: 10.1155/2020/8865808
Abstract: Healthcare information systems can reduce the expenses of treatment, foresee episodes of pestilences, help stay away from preventable illnesses, and improve personal life satisfaction. As of late, considerable volumes of heterogeneous and differing medicinal services data are being produced from different sources covering clinic records of patients, lab results, and wearable devices, making it hard for conventional data processing to handle and manage this amount of data. Confronted with the difficulties and challenges facing the process of managing healthcare big data such as volume, velocity, and variety, healthcare information systems need to use new methods and techniques for managing and processing such data to extract useful information and knowledge. In the recent few years, a large number of organizations and companies have shown enthusiasm for using semantic web technologies with healthcare big data to convert data into knowledge and intelligence. In this paper, we review the state of the art on the semantic web for the healthcare industry. Based on our literature review, we will discuss how different techniques, standards, and points of view created by the semantic web community can participate in addressing the challenges related to healthcare big data.
Publisher: Springer Science and Business Media LLC
Date: 20-10-2018
Publisher: Walter de Gruyter GmbH
Date: 25-09-2019
Abstract: Simulated annealing (SA) proved its success as a single-state optimization search algorithm for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the well-known population-based search algorithms that could be used for optimizing some problems with continuous domains. This paper provides a hybrid algorithm using the CS and SA algorithms. The main goal behind our hybridization is to improve the solutions generated by CS using SA to explore the search space in an efficient manner. More precisely, we introduce four variations of the proposed hybrid algorithm. The proposed variations together with the original CS and SA algorithms were evaluated and compared using 10 well-known benchmark functions. The experimental results show that three variations of the proposed algorithm provide a major performance enhancement in terms of best solutions and running time when compared to CS and SA as stand-alone algorithms, whereas the other variation provides a minor enhancement. Moreover, the experimental results show that the proposed hybrid algorithms also outperform some well-known optimization algorithms.
Publisher: Springer Science and Business Media LLC
Date: 08-10-2022
Publisher: Springer Science and Business Media LLC
Date: 31-03-2022
Publisher: Springer Science and Business Media LLC
Date: 23-06-2017
Publisher: Springer Science and Business Media LLC
Date: 23-11-2020
Publisher: Springer Science and Business Media LLC
Date: 10-09-2021
Publisher: Springer Science and Business Media LLC
Date: 19-06-2023
Publisher: Springer Science and Business Media LLC
Date: 27-07-2021
Publisher: Springer Science and Business Media LLC
Date: 27-06-2023
Publisher: Springer Science and Business Media LLC
Date: 12-06-2021
Publisher: ScopeMed
Date: 2017
Publisher: Elsevier BV
Date: 02-2020
Publisher: Walter de Gruyter GmbH
Date: 13-11-2018
Abstract: The Cuckoo search (CS) algorithm is an efficient evolutionary algorithm inspired by the nesting and parasitic reproduction behaviors of some cuckoo species. Mutation is an operator used in evolutionary algorithms to maintain the ersity of the population from one generation to the next. The original CS algorithm uses the Lévy flight method, which is a special mutation operator, for efficient exploration of the search space. The major goal of the current paper is to experimentally evaluate the performance of the CS algorithm after replacing the Lévy flight method in the original CS algorithm with seven different mutation methods. The proposed variations of CS were evaluated using 14 standard benchmark functions in terms of the accuracy and reliability of the obtained results over multiple simulations. The experimental results suggest that the CS with polynomial mutation provides more accurate results and is more reliable than the other CS variations.
Publisher: Springer Science and Business Media LLC
Date: 29-01-2022
Publisher: ScopeMed
Date: 2018
Publisher: Elsevier BV
Date: 04-2021
Publisher: Inderscience Publishers
Date: 2019
No related grants have been discovered for Bilal Abed-alguni.