Different types of search algorithms for rough sets
Based on the available information in many cases, it can happen that two objects cannot be distinguished. If a set of data is given and in this set two objects have the same attribute values, then these two objects are called indiscernible. This indiscernibility has an effect on the membership relat...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
University of Szeged, Institute of Informatics
Szeged
2019
|
| Series: | Acta cybernetica
24 No. 1 |
| Kulcsszavak: | Számítástechnika, Algoritmus, Programozás |
| Subjects: | |
| doi: | 10.14232/actacyb.24.1.2019.8 |
| Online Access: | http://acta.bibl.u-szeged.hu/59230 |