Mostafa A. El-Gayar

Prof. Dr. Mostafa A. El-Gayar

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
RARadwan Ahmad Abu-Gdairi
Radwan Ahmad Abu-Gdairi
MEMostafa A. El-Gayar
Mostafa A. El-Gayar
Tareq Al-shamiTareq Al-shami
Tareq Al-shami
ANAshraf S. Nawar
Ashraf S. Nawar
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
The rough set principle was proposed as a methodology to cope with vagueness or uncertainty of data in the information systems. Day by day, this theory has proven its efficiency in handling and modeling many real-life problems. To contribute to this area, we present new topological approaches as a generalization of Pawlak’s theory by using j-adhesion neighborhoods and elucidate the relationship between them and some other types of approximations with the aid of examples. Topologically, we give another generalized rough approximation using near open sets. Also, we generate generalized approximations created from the topological models of j-adhesion approximations. Eventually, we compare the approaches given herein with previous ones to obtain a more affirmative solution for decision-making problems.


16 September 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
RARadwan Ahmad Abu-Gdairi
Radwan Ahmad Abu-Gdairi
MEMostafa A. El-Gayar
Mostafa A. El-Gayar
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
KFKamel K. Fleifel
Kamel K. Fleifel
Rough set philosophy is a significant methodology in the knowledge discovery of databases. In the present paper, we suggest new sorts of rough set approximations using a multi-knowledge base; that is, a family of the finite number of general binary relations via different methods. The proposed methods depend basically on a new neighborhood (called basic-neighborhood). Generalized rough approximations (so-called, basic-approximations) represent a generalization to Pawlak’s rough sets and some of their extensions as confirming in the present paper. We prove that the accuracy of the suggested approximations is the best. Many comparisons between these approaches and the previous methods are introduced. The main goal of the suggested techniques was to study the multi-information systems in order to extend the application field of rough set models. Thus, two important real-life applications are discussed to illustrate the importance of these methods. We applied the introduced approximations in a set-valued ordered information system in order to be accurate tools for decision-making. To illustrate our methods, we applied them to find the key foods that are healthy in nutrition modeling, as well as in the medical field to make a good decision regarding the heart attacks problem.

18 January 2015 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
Mohamed Abd El-MonsefMohamed Abd El-Monsef
Mohamed Abd El-Monsef
MEMostafa A. El-Gayar
Mostafa A. El-Gayar
RAR. M. Aqeel
R. M. Aqeel

5 May 2023 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
MEMostafa A. El-Gayar
Mostafa A. El-Gayar
RARadwan Ahmad Abu-Gdairi
Radwan Ahmad Abu-Gdairi
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
DTD. I. Taher
D. I. Taher
This paper suggests new approximations that are inspired by topological structures. The primary goal of this work is to define four neighborhoods resulting from a binary relation. Thus, we have four distinct techniques for approximating rough sets. The suggested approaches represent topological generalizations of the previous works. The characteristics and connections of these approaches are investigated. For the sake of the application, we provide some useful examples to compare our techniques to those in the published literature. The merit of the current technique is to obtain a more accurate decision for the problems in which these cases are the appropriate frame to describe them; for instance, machine learning (ML, for short) applications of finance, etc. To demonstrate this fact, an economic application is proposed. We employ the proposed technique in defining accurate decisions to identify the growth of countries. An algorithm for decision-making problems is proposed and tested on fictitious data to compare our methods with the previous approaches.

1 January 2022 in Complexity
Verified
Journal Article
Open access
MEMostafa A. El-Gayar
Mostafa A. El-Gayar
Abdelfattah A. El-AtikAbdelfattah A. El-Atik
Abdelfattah A. El-Atik
The basic methodology of rough set theory depends on an equivalence relation induced from the generated partition by the classification of objects. However, the requirements of the equivalence relation restrict the field of applications of this philosophy. To begin, we describe two kinds of closure operators that are based on right and left adhesion neighbourhoods by any binary relation. Furthermore, we illustrate that the suggested techniques are an extension of previous methods that are already available in the literature. As a result of these topological techniques, we propose extended rough sets as an extension of Pawlak’s models. We offer a novel topological strategy for making a topological reduction of an information system for COVID‐19 based on these techniques. We provide this medical application to highlight the importance of the offered methodologies in the decision‐making process to discover the important component for coronavirus (COVID‐19) infection. Furthermore, the findings obtained are congruent with those of the World Health Organization. Finally, we create an algorithm to implement the recommended ways in decision‐making.