IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1539563.html
   My bibliography  Save this article

BISGA: Recalculating the Entire Boolean-Valued Information System from Aggregates Using a Genetic Algorithm

Author

Listed:
  • Salman Ali
  • Muhammad Sadiq Khan
  • Habib Shah
  • Harish Garg
  • Abdullah Alsheddy
  • Alex Alexandridis

Abstract

A Boolean-valued information system (BIS) is an application of a soft set in which the data are mapped in a binary form and used in making applications not limited to decision-making, medical diagnoses, game theory, and economics. BIS may be lost for several reasons including virus attacks, improper entry, and machine errors. A concept was presented that the entire lost BIS can be regenerated from four aggregate sets through supposition. Based on that concept, this paper presents an algorithm to recalculate the entire BIS through a genetic algorithm (GA), named BISGA which is more general and easy to implement than the supposition method. A solved example is presented which explains how BISGA works. Furthermore, BISGA is implemented in Python and evaluated on both UCI benchmark datasets and randomized datasets for checking its efficiency and accuracy. Results show that the lost BIS is recovered significantly and accurately; however, the efficiency drops when the size of the BIS increases. This novel approach may help practitioners recalculate the entire lost BIS, which in turn helps in the decision-making process and conclusions.

Suggested Citation

  • Salman Ali & Muhammad Sadiq Khan & Habib Shah & Harish Garg & Abdullah Alsheddy & Alex Alexandridis, 2023. "BISGA: Recalculating the Entire Boolean-Valued Information System from Aggregates Using a Genetic Algorithm," Complexity, Hindawi, vol. 2023, pages 1-11, April.
  • Handle: RePEc:hin:complx:1539563
    DOI: 10.1155/2023/1539563
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2023/1539563.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2023/1539563.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/1539563?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
    ---><---

    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:hin:complx:1539563. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.