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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)
Zadeh, L.A.: A new direction in AI - toward a computational theory of perceptions. AI Mag. 22(1), 73–84 (2001)
Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspect of Reasoning about Data. Kluwer Academic Pubilishers, Dordrecht (1991)
Skowron, A., Wasilewski, P.: An introduction to perception based computing. In: Kim, T., Lee, Y., Kang, B.-H., Ślęzak, D. (eds.) FGIT 2010. LNCS, vol. 6485, pp. 12–25. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17569-5_2
Jankowski, A., Skowron, A.: Toward perception based computing: a rough-granular perspective. In: Zhong, N., Liu, J., Yao, Y., Wu, J., Lu, S., Li, K. (eds.) Web Intelligence Meets Brain Informatics. LNCS (LNAI), vol. 4845, pp. 122–142. Springer, Heidelberg (2007)
Hatfield, G.: Perception & Cognition. Oxford University Press, Oxford (2009)
Enderton, H.B.: Elements of Set Theory. Academic Press, New York (1977)
Polkowski, L., Skowron, A.: Rough mereological calculi of granules: a rough set approach to computation. Comput. Intell. 17(3), 472–492 (2001)
Bargiela, A., Pedrycz, W.: Granular Computing: An Introduction. Kluwer Academic Publishers, Dordrecht (2003)
Quafafou, M.: \(\alpha \)-RST: a generalization of rough set theory. Inf. Sci. 124, 301–316 (2000)
Quafafou, M., Boussouf, M.: Generalized rough sets based feature selection. Intell. Data Anal. 4(1), 3–17 (2000)
Dubois, V., Quafafou, M.: Concept learning with approximation: rough version spaces. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 239–246. Springer, Heidelberg (2002)
Pacholczyk, D., Quafafou, M., Garcia, L.: Optimistic vs. pessimistic interpretation of linguistic negation. In: Scott, D. (ed.) AIMSA 2002. LNCS (LNAI), vol. 2443, p. 132. Springer, Heidelberg (2002)
Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9(3), 239–264 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Quafafou, M. (2016). Rough Sets Are \(\epsilon \)-Accessible. In: Flores, V., et al. Rough Sets. IJCRS 2016. Lecture Notes in Computer Science(), vol 9920. Springer, Cham. https://doi.org/10.1007/978-3-319-47160-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-47160-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47159-4
Online ISBN: 978-3-319-47160-0
eBook Packages: Computer ScienceComputer Science (R0)