Different types of search algorithms for rough sets

Nagy, Dávid and Mihálydeák, Tamás and Aszalós, László: Different types of search algorithms for rough sets. Acta cybernetica, (24) 1. pp. 105-120. (2019)

[img] Cikk, tanulmány, mű
actacyb_24_1_2019_105_120.pdf

Download (374kB)

Abstract

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 relation because in some cases it makes our judgment uncertain about a given object. The uncertainty appears because if something about an object needs to be stated, then all the objects that are indiscernible from the given object must be taken into consideration. The indiscernibility relation is an equivalence relation which represents the background knowledge embedded in an information system. In a Pawlakian system this relation is used in set approximation. Correlation clustering is a clustering technique which generates a partition. In the authors’ previous research, (see in [10, 11, 9]) the possible usage of correlation clustering in rough set theory was investigated. In this paper, the authors show how different types of search algorithms can affect the set approximation.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Acta cybernetica
Date: 2019
Volume: 24
Number: 1
Page Range: pp. 105-120
ISSN: 0324-721X
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
DOI: https://doi.org/10.14232/actacyb.24.1.2019.8
Uncontrolled Keywords: Számítástechnika, Algoritmus, Programozás
Additional Information: Bibliogr.: p. 119-120. ; összefoglalás angol nyelven
Date Deposited: 2019. Jul. 17. 13:39
Last Modified: 2019. Jul. 17. 13:41
URI: http://acta.bibl.u-szeged.hu/id/eprint/59230

Actions (login required)

View Item View Item