Mostafa K. El-Bably

Dr. Mostafa K. El-Bably

Mathematics, Tanta University, Ţanţā, Al Gharbīyah, Egypt
+1
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 January 2014 in International Journal of Granular Computing, Rough Sets and Intelligent Systems
Verified
Journal Article
Closed access
MMM.E. Abd El Monsef
M.E. Abd El Monsef
OEO.A. Embaby
O.A. Embaby
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
Considering the generalised approximation space, this paper aims to introduce and study eight approaches for approximating rough sets. The approximations are based on different topologies. Comparisons between the accuracy of these types of approximations are superimposed. Some fundamental properties of the suggested approximation operators are obtained.

20 May 2021 in TURKISH JOURNAL OF MATHEMATICS
Verified
Journal Article
Closed access
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
Abdelfattah A. El-AtikAbdelfattah A. El-Atik
Abdelfattah A. El-Atik

1 January 2021 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
MSM. El Sayed
M. El Sayed
MSM. A. El Safty
M. A. El Safty
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
The conditions of the equivalence relation limit the application fields of the methodology of Pawlak's rough sets. So, to expand the application areas of this theory, it is generalized to any binary relation. Neighborhoods induced from the relations represent a core bridge between rough sets and application since it represents easy tools for dealing with daily-life problems. Accordingly, the first core objective of the current research is to propose a novel neighborhood (so-called an initial-neighborhood) generated from any binary relation. Based on this neighborhood, we suggest a new generalization to Pawlak rough sets and some of their extensions. The proposed approaches satisfy all properties of classical rough sets without adding any extra restrictions and hence we can apply them in any real-life problem. The second aim is to generalize the notion of nano-topology into any binary relation to extend the applications of this concept. Properties of the suggested methods are introduced with many counter-examples. Comparisons between the suggested techniques and the others studies published in the literature are examined. We proved that the proposed techniques are extra precise than the earlier approaches. Finally, the medical application of COVID-19 is provided to illustrate the significance of our approaches in deciding the impact factors for COVID-19 infection. The proposed application is based on a reflexive relation, so Pawlak rough sets and some of its generalizations couldn't be applied to solve this problem. Accordingly, we have successes in solving this problem using the suggested techniques. Hence, we write an algorithm to be a useful tool that may help the doctor in diagnosing the infection of COVID-19.

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.

15 September 2021 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Verified
Journal Article
Closed access
PDF file
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
EAE. A. Abo-Tabl
E. A. Abo-Tabl
The present work proposes new styles of rough sets by using different neighborhoods which are made from a general binary relation. The proposed approximations represent a generalization to Pawlak’s rough sets and some of its generalizations, where the accuracy of these approximations is enhanced significantly. Comparisons are obtained between the methods proposed and the previous ones. Moreover, we extend the notion of “nano-topology”, which have introduced by Thivagar and Richard [49], to any binary relation. Besides, to demonstrate the importance of the suggested approaches for deciding on an effective tool for diagnosing lung cancer diseases, we include a medical application of lung cancer disease to identify the most risk factors for this disease and help the doctor in decision-making. Finally, two algorithms are given for decision-making problems. These algorithms are tested on hypothetical data for comparison with already existing methods.

1 October 2015 in Journal of the Egyptian Mathematical Society
Verified
Journal Article
Open access
MEM.E. Abd El-Monsef
M.E. Abd El-Monsef
AKA.M. Kozae
A.M. Kozae
Mostafa K. El-BablyMostafa K. El-Bably
Mostafa K. El-Bably
In this paper, we present the covering rough sets based on neighborhoods by approximation operations as a new type of extended covering rough set models. In fact, we have introduced generalizations to W. Zhu approaches (Zhu, 2007). Based on the notion of neighborhood induced from any binary relation, four different pairs of dual approximation operators are defined with their properties being discussed. The relationships among these operators are investigated. Finally, an interesting theorem to generate different topologies is provided. Comparisons between these topologies are discussed. In addition, several examples and counter examples to indicate counter connections are investigated