Where academic tradition
meets the exciting future

On the Structure of Rough Approximations

Jouni Järvinen, On the Structure of Rough Approximations. TUCS Technical Reports 447, Turku Centre for Computer Science, 2002.

Abstract:

We study rough approximations based on indiscernibility relations
which are not necessarily reflexive, symmetric or transitive. For this, we
define in a lattice-theoretical setting two maps which mimic the rough
approximation operators and note that this setting is suitable also for other
operators based on binary relations. Properties of the ordered sets of the
upper and the lower approximations of the elements of an atomic Boolean
lattice are studied.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tJarvinen02a,
  title = {On the Structure of Rough Approximations},
  author = {Järvinen, Jouni},
  number = {447},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2002},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication