Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Rough Sets Are \(\epsilon \)-Accessible
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
This paper focuses on the relationship between perceptions and sets considering that perceptions are not only imprecise or doubtful, but they are also multiple. Accessible sets are developed according to this view, where sets representation is a central problem depending not only on features of its objects, but also on their perceptions. The accessibility notion is related to the perception and can be summarized as follows “to be accessible is to be perceived”, which is more weak than the Berkeley’s idealism. In this context, we revisit Rough sets showing that: (1) the Pawlak’s perception of sets can be written using only two perceivers, which are respectively pessimistic and optimistic, and (2) Rough sets are \(\varepsilon \)-accessible. Moreover, we introduce a rough set computational theory of perception, denoted \(\pi \)-RST and discuss the perception dynamic problem laying its foundation on social interaction between perceivers, granularity and preference.