Energy Saving via a Minimal Structure
Not only mathematical statistics, differential equations, and mathematical models were used to analyze and reduce data, but a rough set model is also employed in medical, engineering, and other fields to analyze and reduce them. The goal of this paper is to introduce a minimal structure concept to produce new rough set models and show that it is suitable for analyzing most real-life problems, reduction of attributes, and decision making. We examine the effectiveness of the following method in the problem of electric power generators and decision making. We also offer a comparison of our method and Pawlak’s method. Finally, the variable precision model improves the accuracy of decision making.
The current era is distinguished by its ability to collect and store large amount of data on any topic we want, to make, and take a decision regarding it. Uncertainty is a characteristic of almost all real life problems and mathematics plays a vital role in processing these data to obtain the best decisions.
The analysis process has many mathematical methods that we can use. Since the current statement of a rough set theory, topology and decision making have had a long history together. The theory of rough set is a useful tool for analyzing unclear data. Pawlak first introduced the rough set model in 1982  and constructed a topological space using the equivalent class of equivalence relations on the items as its foundation [2–4]. These equivalence classes is a base for a special type of topological structure in which every open set is closed. This condition is a constrain which limits the range of application. Some extensions under other relations, such as 1998 [5, 6], have been proposed in an attempt to solve such unreasonableness. New types of neighborhoods were added for various goals, including improving the set’s accuracy values, such as intersection neighborhoods, which contained some topology expansions such as the minimal structure [2, 7]. The manuscript contributes to this trend by employing a simple structure to generalize rough set approximation. The data are formatted as an information system and are processed in several stages. The first of which is the selection of effective features (reduction) and the second is an approximation. This method was used for many medical applications such as those in [7, 8] and engineering applications such as those in [9, 10], and others such as those in [2, 11–15].
Many researchers all over the world attempted to overcome the shortcomings that the original model of rough set theory may lose in the classification or have a discrete classification in which every class has a single element. This paper aims to construct lower and upper approximations based on a similarity degree between objects of and demonstrate that a minimal structure framework can be used to solve a variety of real-world challenges. Consequently, we apply these concepts to obtain reducts and core of using the accuracy measure of decision sets.
We use a variable precision to improve the decision accuracy in our approach. Also, we provide a comparison between our strategy and Pawlak’s strategy.
The following is the structure of this paper:
We go over the fundamental ideas in the second segment. In the third section, we describe our proposed method for reducing the characteristics. In the fourth section, there are some examples that explain the method used.
Definition 1.  Information system
An information system can be written as a where is the universe of finite objects, attribute values, and is the set of attributes .(1)These objects, for example: patients, electric generators, students, ….(2)The attributes can be features or characteristics of objects.
Example 1. An information system for an exam of five students in Table 1, where are four courses, mathematics M, chemistry C, physics P, and English language E. The entries of the table represent the set of the scores for the students.
Adding the column values B, C, C, B, and D is an example of the decision table [Table 2].
Definition 2. [17, 18]. A minimal structre (short for -structure on a set is defined as (the collection of all subsets) containing ). A minimal structure space is defined by the pair (simplify, -space). Members of are known as open sets, and the complement of is known as closed sets. .
Definition 3. [17, 18]. Let be an -structure on and be a nonempty set. Let be an -structure on and be a non empty set.(i),(ii).
Definition 4. [3, 19]. If is a set of objects that is not empty, and an equivalence relation on is named , the approximation space is named after the pair . Let , the rough set approximation is as follows:(i)The set of all objects that can be categorized as concerning is called upper approximation of concerning and is denoted by . That is, , where determines the equivalence class and is the equivalence class.(ii)The lower approximation of concerning is , which denotes the set of all objects that may absolutely be classed as concerning . To put it another way, , where denotes the equivalence class determined by .(iii) boundary region of for . That is,which is the collection of all elements that cannot be categorized as either or . The set is said to be rough concerning If . That is, . Then, the set is called rough to .
Definition 5. [3, 19]. Let be a decision approximation space, with being an approximation space and being a decision equivalence relation on . Hence, is a partition on . In terms of, The lower and upper approximations of with respect to denoted as follows:and
2.1. Variable Precision Model(1)For all such that denotes a non-null finite universe set and that all elements of are contained in .(2) with an error ratio based on the value of measure is discussed in [4, 7]. i.e., if and only if , where if , if , where the allowable error must be .
3. Similarity Approach for Reduction
We demonstrate the usefulness of a minimal structural space in engineering science for use in decision-making situations in this section. Therefore, we have decided to use it to solve a technical problem. This data collection contains the results of four attributes for eight different generators. The research study was carried out at the Princess Nourah bint Abdulrahman University’s Mathematical Department in Riyadh, Saudi Arabia. The study included eight different generators presenting to this university with different presenting features, where the first two are two different transmission lines and the second two for self-generation and self-load. 1 denotes low, 2 denotes medium, and 3 denotes high. Finally, the heart failure diagnosis is normal or rest.
The equivalence relation is a condition that sometimes generates a discrete equivalence classes, that is, each class contains one object, and this makes all concepts exactly as in .
The following example for an when applying Pawlak methods gives equivalence classes each of which contains singleton.
Example 3. Consider the table of (Table 3).
Using the original model, the classes are , but the similarity degrees are as follows:which produce no discrete classes that give nontrivial approximation.
Definition 6. Attribute similarity.
In an , for an attribute , the similarity value for two objects is denoted by ,The similarity degree among two objects is as follows:where is ’s cardinality.
3.1. Discussion of the Results of the Experiment
We explain the experimental results in this paragraph by introducing a preparatory study that was conducted on four features for eight generators. The study was conducted at the Mathematical department, Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The remaining 8 records were offered to this university with comparable presenting qualities, such as comprehensive history, date of manufacture, volume, power, and wren done. Due to similar features, the data in the information system for just eight features, as shown in Table 4, discuss energy conservation.
The following example is taken from an engineering problem.
Example 3. In Table 4, our universe contains eight different generators, . Moreover, there are four features and a decision. The feature set is where the first two are two different transmission lines and the second two are for self-generation and self-load. 1 denotes low, 2 denotes medium, and 3 denotes high.
Now, using the connection that is relevant to the nature of the examined problem, we design a minimal structure space. It is worth noting that we define the relationship in each case based on the expert’s specifications. In this instance, , where is the sum of the similar features between and divided on the number of features.
From Table 5, we have , , , , , . Then, the minimal structure space on is as follows:(i) and(ii).We can calculate the accuracy of decision making for two groups of features using the rough set theory:(1), the set of normal generators.(2), the set of rest generators.Therefore, the lower, the upper, and the accuracy of are calculated as follows:respectively.
Also, the lower, the upper, and the accuracy of are calculated as follows:respectively.
Another technique to determine accuracy is to create a dissimilarity table instead of a similarity table. In dissimilarity, a variable precision model can be used to improve it. When we compare our method to Pawlak’s method  for determining decision-making accuracy, we get the same result.
We use the degree of similarity between futures using Definition 6 to find Table 5.
Moreover, this gives the accuracy as shown in Table 6.
3.2. Reduction of Attributes
Here begins the reduction for the attributes by constructing similarity matrices by removing one of the features and noticing how that will affect the accuracy of the decision set.
The results in Table 7 denote the values by removing , while Table 8 shows the accuracy.
The variable is not superfluous and is not a reduction. We repeat the same steps for all possible subsets of .
The variable is superfluous and is a reduction.
The variable is superfluous and is a reduction.
The variable is not superfluous and is not a reduction.
We conclude that is the class of 2 effective feature subsets and the core of effective features is .
3.3. Using a Variable Precision Rough Set Model to Improve Accuracy
Because decision making is so important in engineering situations, we can use a variable precision as suggested in [21, 22] to try to improve accuracy. We may see the inconsistency when we compare the definitions of -interior and -closure with a majority to traditional definitions. As a result, we present a novel -interior and -closure generalization concept as follows:
Definition 7. Let be a nonempty set and a -structure on . For a subset of and variable precision ,(1)-.(2)-.
Example 4. Comparison between our improved method and Pawlak’s approach.
From Table 9, at the variable in the original information system, then(1), , and .(2), , and .Based on a variable precision rough set model, we can see that the accuracy is improving in Example 4. Furthermore, when it comes to removing and , the accuracy does not change. Table 9 illustrates that our method is improving in comparison to Pawlak’s method .
The suggested approach helps in selecting effective features in some type of information system for which we cannot get reducts using the original rough set model.
The approach is suitable for researchers from application fields since it does not need lot of mathematics. The subsequent work will consider control strategies (related to medicine) and mathematical models (related to fuzzy with a minimal structure) in the incipient stage of cancer [23–25].
|:||A minimal structure|
|:||The collection of all subsets|
|:||The -closure of|
|:||The -interior of .|
The data sets generated during the current study are available from the corresponding author on reasonable request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
The authors extend their appreciation to Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia, for funding this research work through the project number PNURSP2022R216.
Z. Pawlak, “Rough sets,” Rough Sets and Data Mining, vol. 11, pp. 3–7, 1997.View at: Publisher Site | Google Scholar
M. Atef, A. M. Khalil, A. A. Azzam, S. G. Li, and H. Liu, “Comparison of twelve types of rough approximations based on j-neighborhood space and j-adhesion neighborhood spac,” Soft Computing, vol. 26, 2021.View at: Google Scholar
Z. Pawlak, “Rough Set theory and its applications,” Journal of Telecommunications and Information Technology, vol. 3, pp. 7–10, 2002.View at: Google Scholar
O. Tantawy, M. Abd Allah, and A. Nawar, “Generalization of Pawlak's rough approximation spaces by using ij-χ-open sets and its applications open sets and its applications,” Journal of Intelligent and Fuzzy Systems, vol. 33, no. 3, pp. 1327–1337, 2017.View at: Publisher Site | Google Scholar
Y. Y. Yao, “Two views of the theory of rough sets in finite universes,” International Journal of Approximate Reasoning, vol. 15, no. 4, pp. 291–317, 1996.View at: Publisher Site | Google Scholar
Y. Yao, “Relational interpretations of neighborhood operators and rough set approximation operators,” Information Sciences, vol. 111, no. 1-4, pp. 239–259, 1998.View at: Publisher Site | Google Scholar
A. A. Azzam, A. M. Khalil, and S. G. Li, “Medical applications via minimal topological structure,” Journal of Intelligent and Fuzzy Systems, vol. 39, no. 3, pp. 4723–4730, 2020.View at: Publisher Site | Google Scholar
J. C. Pomerol, “Artifcial intelligence and human decision making,” European Journal of Operational Research, vol. 99, no. 1, p. 325, 1997.View at: Google Scholar
M. K. El-Sayed, “Nano topological analysis for power system control,” INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, vol. 15, no. 14, pp. 7416–7422, 2016.View at: Publisher Site | Google Scholar
S. M. Shaaban and S. Z. Tawfik, “Classification of volcanic rocks based on rough set theory,” Engineering, Technology & Applied Science Research, vol. 10, no. 2, pp. 5501–5504, 2020.View at: Publisher Site | Google Scholar
G. Lambert-Torres, “Application of rough sets in power system control center data mining,” in Proceedings of the 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309), IEEE, New York, NY, USA, January 2002.View at: Google Scholar
G. Lang, M. Cai, H. Fujita, and Q. Xiao, “Related families-based attribute reduction of dynamic covering decision information systems,” Knowledge-Based Systems, vol. 162, pp. 161–173, 2018.View at: Publisher Site | Google Scholar
E. A. Rady, A. M. Kozae, and M. M. E. Abd El-Monsef, “Generalized rough sets,” Chaos, Solitons & Fractals, vol. 21, no. 1, pp. 49–53, 2004.View at: Publisher Site | Google Scholar
L. Thivagar and C. Richard, “On Nano forms of weakly open sets,” International Journal of Mathematical and Statistics Invention, vol. 1, no. 1, pp. 31–37, 2012.View at: Google Scholar
F. Zafar and M. Akram, “A novel decision-making method based on rough fuzzy information,” International Journal of Fuzzy Systems, vol. 20, no. 3, pp. 1000–1014, 2018.View at: Publisher Site | Google Scholar
Y. Chuangyin Dang, J. Liang, and D. Tang, Set- valued information systems, Information Sciences, vol. 179, pp. 2809–2832, 2009.View at: Publisher Site
V. Popa and T. Noiri, “On M-continuous functions,” Anal. Univ. “Dunarea de Jos” Galati, Ser. Mat. Fiz. Mec. Teor. Fasc. II, vol. 18, no. 23, pp. 31–41, 2000.View at: Google Scholar
V. Popa and T. Noiri, “A generalization of some forms of girresolute functions,” European Journal of Pure and Applied Mathematics, vol. 2, no. 4, pp. 473–493, 2009.View at: Google Scholar
E. F. Lashin and T. Medhat, “Topological reduction of information systems,” Chaos, Solitons & Fractals, vol. 25, no. 2, pp. 277–286, 2005.View at: Publisher Site | Google Scholar
C. C. Chan, “A rough set approach to attribute generalization in data mining,” Information Sciences, vol. 107, no. 1-4, pp. 169–176, 1998.View at: Publisher Site | Google Scholar
M. E. Abdel Monsef, A. M. Kozae, and A. A. Azzam, “Topological variable precision rough set model,” Journal of Institute of Mathematics and Computer Sciences, vol. 20, no. 3, pp. 299–310, 2009.View at: Google Scholar
W. Ziarko, “Variable precision rough set model,” Journal of Computer and System Sciences, vol. 46, no. 1, pp. 39–59, 1993.View at: Publisher Site | Google Scholar
M. Akram, M. Arshad, and Shumaiza, “Fuzzy rough graph theory with applications,” International Journal of Computational Intelligence Systems, vol. 12, no. 1, pp. 90–107, 2018.View at: Publisher Site | Google Scholar
Tareq M. Al-shami, “Topological approach to generate new rough set models,” Complex and Intellgent Systems, vol. 2022, 2022.View at: Publisher Site | Google Scholar
Z. Meng and Z. Shi, “A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets,” Information Sciences, vol. 179, no. 16, pp. 2774–2793, 2009.View at: Publisher Site | Google Scholar