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. Conference of PhD Students in Computer Science, (11). pp. 58-59. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_069-072.pdf

Download (247kB)

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 is needed 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 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 using search algorithms. In the authors’ previous research the possible usage of the correlation clustering in rough set theory was investigated. In this paper the authors show how different types of search algorithms affect the set approximation.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 58-59
Uncontrolled Keywords: Adatbányászat, Algoritmus, Számítástechnika
Additional Information: Bibliogr.: p. 58-59. ; összefoglalás angol nyelven
Date Deposited: 2019. Oct. 28. 12:25
Last Modified: 2019. Oct. 28. 12:25
URI: http://acta.bibl.u-szeged.hu/id/eprint/61764

Actions (login required)

View Item View Item