REDUCTION OF KNOWLEDGE VIA MINIMAL APPROXIMATION SPACE AND GRAPHS
| Autor: | M. M. El-Sharkasy |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
Binary relation Graph theory 02 engineering and technology Space (mathematics) Reduction (complexity) Simple (abstract algebra) Core (graph theory) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Undirected graph Upper approximation MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Journal of the Egyptian Mathematical Society. 26:450-457 |
| ISSN: | 2090-9128 |
| DOI: | 10.21608/joems.2018.3241.1062 |
| Popis: | In this paper, we introduce a simple undirected graph based on a binary relation by using thenotion of right neighborhood and minimal approximation space. Also, we investigate the lowerapproximation and the upper approximation of a subgraph to compute the rough subgraph. Finally, wewill make a reduction of an information system and compute the core of knowledge by using a minimalapproximation space and a graph theory. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|