Abstract
The neighborhood structure can represent information or knowledge about relationships between a universe's object. In other words, such elements or objects are somewhat similar to that element in an element's neighborhood. Pawlak presented the idea of rough sets as useful tools for learning computer science and information systems. Neighborhood structures used this principle to be generalized and studied. This paper uses a neighborhood method to solve several rough set theory problems. By using a neighborhood of objects in the information system and illustrative examples to apply it, we introduce some new definitions of attributes, membership function and accuracy measurement. A decision making of our method gives an accurate decision and helps with decision correlation to calculate the accuracy of each attribute that builds an approach to decision making.
Publisher
Sociedade Paranaense de Matematica
Reference37 articles.
1. Sierpinski W., General Topology:(Mathematical Expositions No.7), translated by C. Cecilia Krieger, University of Toronto press (1952).
2. Zhong N., Rough Sets in Knowledge Discovery and Data Mining, J. Japan Soc. for Fuzzy Theory and Systems, 13(6) (2001), 581-591.
3. Nawar A. S., El Atik A. A., A model of a human heart via graph nano topological spaces, International Journal of Biomathematics, 12(1) (2019). Doi: 10.1142/S1793524519500062.
4. Yao Y. Y., Generalized Rough Set Models, Rough Sets in knowledge Discovery 1, L. Polkowski, A. Skowron (Eds.), Physica Verlag, Heidelberg, (1998), 286-318.
5. Yao Y. Y., A Comparative Study of Fuzzy Sets and Rough Sets Information Sciences, 109 (1998), 227-242.