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

Rough Approximation Spaces via Maximal Union Neighborhoods and Ideals with a Medical Application

Author

Listed:
  • Mona Hosny
  • Tareq M. Al-shami
  • Abdelwaheb Mhemdi
  • Yongqiang Fu

Abstract

One of the most popular and important tools to deal with imperfect knowledge is the rough set theory. It starts from dividing the universe to obtain blocks utilizing an equivalence relation. To make it more flexibility and expand its scope of applications, many generalized rough set models have been proposed and studied. To contribute to this area, we introduce new generalized rough set models inspired by “maximal union neighborhoods and ideals.†These models are created with the aim to help decision-makers to analysis and evaluate the given data more accurately by decreasing the ambiguity regions. We confirm this aim by illustrating that the current models improve the approximations operators (lower and upper) and accuracy measures more than some existing method approaches. We point out that almost all major properties with respect to rough set model can be kept using the current models. One of the interesting obtained characterizations of the current models is preserving the monotonic property, which enables us to evaluate the vagueness in the data and enhance the confidence in the outcomes. Moreover, we compare the current approximation spaces with the help of concrete examples. Finally, we show the performance of the current models to discuss the information system of dengue fever disease and eliminate the ambiguity of the medical diagnosis, which produces an accurate decision.

Suggested Citation

  • Mona Hosny & Tareq M. Al-shami & Abdelwaheb Mhemdi & Yongqiang Fu, 2022. "Rough Approximation Spaces via Maximal Union Neighborhoods and Ideals with a Medical Application," Journal of Mathematics, Hindawi, vol. 2022, pages 1-17, September.
  • Handle: RePEc:hin:jjmath:5459796
    DOI: 10.1155/2022/5459796
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/5459796.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jmath/2022/5459796.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/5459796?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:jjmath:5459796. 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.