Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
A New Fuzzy-Rough Hybrid Merit to Feature Selection Read chapter Read first chapter

2016 | OriginalPaper | Chapter

Covering Rough Sets and Formal Topology – A Uniform Approach Through Intensional and Extensional Constructors

Author : Piero Pagliani

Published in: Transactions on Rough Sets XX

Publisher: Springer Berlin Heidelberg

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Approximation operations induced by coverings are reinterpreted through a set of four “constructors” defined by simple logical formulas. The very logical definitions of the constructors make it possible to readily understand the properties of such operators and their meanings.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Algebraic Semantics of Proto-Transitive Rough Sets
next chapter Multiple-Source Approximation Systems, Evolving Information Systems and Corresponding Logics: A Study in Rough Set Theory
Appendix
Available only for authorised users
Footnotes
1
The members of U will be usually denoted by g after the German term Gegenstand which means an object before interpretation, while M is after Merkmal, which means “property”. In Formal Topology, M is thought of as a set of abstract neighborhoods. This interpretation will be used later on in the paper.
 
2
R(A) and \(R^\smile (B)\) are also called the the left Peirce product of R and A, and, respectively, the right Peirce product of R (left Peirce product of \(R^\smile \)) and B.
 
3
Often a lower adjoint is called “left adjoint” and an upper adjoint “right adjoint”. We avoid the terms “right” and “left” because they could make confusion with the position of the arguments of the operations of binary relations. For the general notion of adjoint functors see for instance [3]. For Galois connections induced by binary relations a classic reference is [19]. For the present use in Rough Set Theory see [23] or [25].
 
4
It is worth noticing that there are constructive logics between Intuitionistic and Classical logics such that the opposite of the above implication holds if the premise is a negated formula (see [14]).
 
5
In these works \({\mathcal N}(\mathbf{P})\) is denoted as \({\mathcal N}(U)\) and instead of \({\mathcal Z}\) the entire powerset \(\wp (U)\) is considered. The present is a slight generalization.
 
6
For the notions of a “neighborhood” and a “pretopology”, see [5, 16].
 
7
If R is not serial and \(R(g)=\emptyset \), then \(\emptyset \) does not belong to \({\mathcal N}_g\). Otherwise stated, \(\emptyset \) is different from \(\{\emptyset \}\). 0 does not hold if there exists \(g\in G\) such that \(\langle g,\emptyset \rangle \in R\).
 
8
In [22] \({\mathcal N}_*(U)\) is denoted as \({\mathcal N}_{F(R)}(U)\), and \({\mathcal N}^*_x\) as \({\mathcal N}^R_x\).
 
9
A wider reference about covering-based approximation operators and the scientific literature about the topic can be found in Sect. 5 of [33].
 
10
The original definition of \((uC)_7\) is \((lC)_1(X)\cup (\bigcup \{n(x):x\in X\cap -(lC)_1(X)\})\).
 
11
Actually, from Facts 3.(iii), Corollary 1 and Lemma 11.(5) and (6) one trivially derives that in any SRS P with R a preorder: \(\mathbf{S}_{\langle i\rangle }(\mathbf{P})=\mathbf{S}_{[e]\langle i\rangle }(\mathbf{P})=\mathbf{S}_{[e]}(\mathbf{P})= \mathbf{S}_{\langle i\rangle [e]}(\mathbf{P})\); \(\mathbf{S}_{\langle e\rangle }(\mathbf{P})=\mathbf{S}_{[i]\langle e\rangle }(\mathbf{P})=\mathbf{S}_{[i]}(\mathbf{P})= \mathbf{S}_{\langle e\rangle [i]}(\mathbf{P})\).
 
12
In general, from Facts 3, if R is a preorder then the set of fixpoints of the constructors \(\langle \cdot \rangle \) and \([\cdot ]\) coincides with the sets of fixpoint of their derived operators \(\langle \cdot \rangle [\cdot ]\) and \([\cdot ]\langle \cdot \rangle \) (where the directions, intension or intension, alternate). Since the sets of fixpoints of the derived operators form distributive lattices, the same happens for the constructors.
 
Literature
1.
2.
Bell, J.L.: Orthologic, forcing, and the manifestation of attributes. In: Chong, C.T., Wicks, M.J. (eds.) Southeast Asian Conference on Logic, pp. 13–36. Elsevier Science Publisher, North-Holland (1983)
3.
Blyth, T.S., Janowitz, M.F.: Residuation Theory. Pergamon Press, Oxford (1972)MATH
4.
Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intensions in the rough set theory. Inf. Sci. 107, 149–167 (1998)MathSciNetCrossRefMATH
5.
6.
Düntsch, I., Gegida, G.: Modal-style operators in qualitative data analysis. In: Proceedings of the IEEE International Conference on Data Mining, pp. 155–162 (2002)
7.
Ghanim, M.H., Mustafa, H.I., Abd El Aziz, S.: On lower and upper intension order relations by different cover concepts. Inf. Sci. 181, 3723–3734 (2011)MathSciNetCrossRefMATH
8.
Greco, S., Matarazzo, B., Słowinski, R.: Algebra and topology for dominance-based rough set approach. In: Ras, Z.W., Tsay, L.-S. (eds.) Advanced in Intelligent Systems. SCI, vol. 265, pp. 43–78. Springer, Heidelberg (2010)
9.
Huang, A., Zhu, W.: Topological characterizations for three covering approximation operators. In: Ciucci, D., Inuiguchi, M., Yao, Y., Ślęzak, D., Wang, G. (eds.) RSFDGrC 2013. LNCS, vol. 8170, pp. 277–284. Springer, Heidelberg (2013)CrossRef
10.
Järvinen, J.: Lattice theory for rough sets. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 400–498. Springer, Heidelberg (2007)CrossRef
11.
Järvinen, J., Pagliani, P., Radeleczki, S.: Information completeness in nelson algebras of rough sets induced by quasiorders. Stud. Log. 101(5), 1073–1092 (2013)MathSciNetCrossRefMATH
12.
Järvinen, J., Radeleczki, S.: Representation of Nelson algebras by rough sets determined by quasiorders. Algebra Univers. 66, 163–179 (2011)MathSciNetCrossRefMATH
13.
Järvinen, J., Radeleczki, S.: Tolerances induced by irredundant coverings. Fundamenta Informaticae 137, 341–353 (2015)MathSciNetMATH
14.
Kreisel, G., Putnam, H.: Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussegenkalkül. Archiv für mathematische Logik und Grundlagenferschung 3, 74–78 (1957)MathSciNetCrossRefMATH
15.
Kumar, A., Banerjee, M.: Definable and rough sets in covering-based approximation spaces. In: Li, T., Nguyen, H.S., Wang, G., Grzymala-Busse, J., Janicki, R., Hassanien, A.E., Yu, H. (eds.) RSKT 2012. LNCS, vol. 7414, pp. 488–495. Springer, Heidelberg (2012)CrossRef
16.
Langeron, C., Bonnevay, S.: Une approach pretopologique pour la structuration. Document de Recherche \(N^o\) 1999 - 7. Centre de reserches economiques de l’Université de Saint Etienne
17.
18.
Nagarajan, E.K.R., Umadevi, D.: A method of representing rough sets system determined by quasi orders. Order 30(1), 313–337 (2013)MathSciNetCrossRefMATH
19.
20.
Pagliani, P.: Concrete neighbourhood systems and formal pretopological spaces (draft). In: Presented at the Calcutta Logical Circle Conference on Logic and Artificial Intelligence, Calcutta, 13–16 October 2003
21.
Pagliani, P.: Pretopology and dynamic spaces. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS, vol. 2639, pp. 146–155. Springer, Heidelberg (2003). Extended Version in Fundamenta 59(2–3), 221–239 (2004)CrossRef
22.
Pagliani, P.: The relational construction of conceptual patterns - tools, implementation and theory. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds.) RSEISP 2014. LNCS, vol. 8537, pp. 14–27. Springer, Heidelberg (2014)
23.
Pagliani, P., Chakraborty, M.K.: Information Quanta and approximation spaces. I: Non-classical approximation operators. In: Proceedings of the IEEE International Conference on Granular Computing, Beijing, China, 25–27 July 2005, vol. 2, pp. 605–610. IEEE, Los Alamitos, July 2005
24.
Pagliani, P., Chakraborty, M.K.: Formal topology and information systems. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 253–297. Springer, Heidelberg (2007)CrossRef
25.
Pagliani, P., Chakraborty, M.K.: A Geometry of Approximation. Trends in Logic, 27th edn. Springer, Heidelberg (2008)CrossRefMATH
26.
Qin, K., Gao, Y., Pei, Z.: On covering rough sets. In: Yao, J.T., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 34–41. Springer, Heidelberg (2007)CrossRef
27.
Restrepo, M., Cornelis, C., Gmez, J.: Duality, conjugacy and adjointness of approximation operators in covering-based rough sets. Int. J. Approximate Reasoning 55(1), 469–485 (2014)MathSciNetCrossRefMATH
28.
Sambin, G.: Intuitionistic formal spaces - a first communication. In: Skordev, D. (ed.) Mathematical Logic and Its Applications, pp. 187–204. Plenum Press, New York (1987)CrossRef
29.
Sambin, G., Gebellato, S.: A preview of the basic picture: a new perspective on formal topology. In: Altenkirch, T., Reus, B., Naraschewski, W. (eds.) TYPES 1998. LNCS, vol. 1657, pp. 194–208. Springer, Heidelberg (1999). doi:10.​1007/​3-540-48167-2_​14 CrossRef
30.
Thuan, N.D.: Covering rough sets from a topological point of view. Int. J. Comput. Theor. Eng. 1(5), 606–609 (2009)CrossRef
31.
Vickers, S.: Topology via Logic. Cambridge Tracts in Theoretical Computer Science, vol. 5. Cambridge University Press, Cambridge (1989)MATH
32.
Yao, Y.Y., Chen, Y.H.: Rough set approximations in formal concept analysis. In: Dick, S., Kurgan, L., Pedrycz, W., Reformat, M. (eds.) Proceedins of 2004 Annual Meeting of the North American Fuzzy Information Processing Society, (NAFIPS 2004). IEEE Catalog Number: 04TH8736, pp. 73–78 (2004)
33.
34.
Zakowski, W.: Approximations in the space \((U,\Pi )\). Demonstratio Mathematica 16, 761–769 (1983)MathSciNetMATH
Metadata
Title
Covering Rough Sets and Formal Topology – A Uniform Approach Through Intensional and Extensional Constructors
Author
Piero Pagliani
Copyright Year
2016
Publisher
Springer Berlin Heidelberg
Book
Transactions on Rough Sets XX

Print ISBN: 978-3-662-53610-0

Electronic ISBN: 978-3-662-53611-7

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-3-662-53611-7_4

Premium Partner

    Image Credits