IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i10p2204-2215.html
   My bibliography  Save this article

Gaussian relevance vector MapReduce-based annealed Glowworm optimization for big medical data scheduling

Author

Listed:
  • Rizwan Patan
  • Suresh Kallam
  • Amir H. Gandomi
  • Thomas Hanne
  • Manikandan Ramachandran

Abstract

Various big-data analytics tools and techniques have been developed for handling massive amounts of data in the healthcare sector. However, scheduling is a significant problem to be solved in smart healthcare applications to provide better quality healthcare services and improve the efficiency of related processes when considering large medical files. For this purpose, a new hybrid model called Gaussian Relevance Vector MapReduce-based Annealed Glowworm Optimization Scheduling (GRVM-AGS) was designed to improve the balancing of large medical data files between different physicians with higher scheduling efficiency and minimal time. First, a GRVM model was developed for the predictive analysis of input medical data. This model reduces the storage complexity of large medical data analysis by means of eliminating unwanted patient information and predicts the disease class with help of a Gaussian kernel function. Afterwards, GRVM performs AGS to schedule the efficient workloads among multiple datacenters based on the luciferin value in the smart healthcare environment with reduced scheduling time. Through computational experiments, we demonstrate that GRVM-AGS increases the scheduling efficiency and reduces the scheduling time of large medical data analysis compared to state-of-the-art approaches.

Suggested Citation

  • Rizwan Patan & Suresh Kallam & Amir H. Gandomi & Thomas Hanne & Manikandan Ramachandran, 2022. "Gaussian relevance vector MapReduce-based annealed Glowworm optimization for big medical data scheduling," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(10), pages 2204-2215, October.
  • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:10:p:2204-2215
    DOI: 10.1080/01605682.2021.1960908
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1960908
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2021.1960908?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:73:y:2022:i:10:p:2204-2215. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.