Skip to main content

Fuzzy Extension of Rough Sets Theory

Extended Abstract

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1424))

Included in the following conference series:

Abstract

In this paper we consider many approximation spaces for rough theories, all of which are concrete realizations of an abstract structure stronger than the one introduced in [2] and defined in the following way:

$$ \mathfrak{A}: = \langle \Sigma ,\mathcal{D}(\Sigma ), \leqslant ,0,1\rangle $$

where:

  1. 1.

    〈Σ, ∧. ∨, 0, 1〉 is a complete lattice with respect to the partial order relation ≤, bounded by the least element 0 \( (\forall x \in \Sigma ,0 \leqslant x) \) and the greatest element 1 \( (\forall x \in \Sigma ,x \leqslant 1) \); elements from Σ are interpreted as concepts, data, etc., and are said to be approximable elements;

  2. 2.

    \( \mathcal{D}(\Sigma ) \) is a sublattice of Σ whose elements are called definable;

and satisfying the following axioms:

  1. (Ax1):

    For any approximable element x ∈ Σ, there exists (at least) one element i(x) such that:

    $$ i(x) \in \mathcal{D}(\Sigma ) $$
    ((1.1a))
    $$ i(x) \leqslant x $$
    ((1.1b))
    $$ \forall \alpha \in \mathcal{D}(\Sigma ), (\alpha \leqslant x \Rightarrow \alpha \leqslant i(x)) $$
    ((1.1c))
  2. (Ax2):

    For any approximable element x ∈ Σ, there exists (at least) one element o(x) such that:

    $$ o(x) \in \mathcal{D}(\Sigma ) $$
    ((1.2a))
    $$ x \leqslant o(x) $$
    ((1.2b))
    $$ \forall \gamma \in \mathcal{D}(\Sigma ), (x \leqslant \gamma \Rightarrow o(x) \leqslant \gamma ) $$
    ((1.2c))

    i.e., i(x) [resp., o(x)] is the best approximation of the “vague” element x from the bottom [resp., top] by definable elements.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bezdek and J. Harris, Fuzzy partitions and relations: an axiomatic basis for clustering, Fuzzy Sets and Systems, 1 (1978), pp. 112–127.

    MathSciNet  Google Scholar 

  2. G. Cattaneo, Abstract approximation spaces for rough theories, in Rough Sets in Data Mining and Knowledge Discovery, L. Polkowski and A. Skowron, eds., Soft Computing Series, Physica Verlag, Springer, Berlin, 1998, ch. 4, pp. 1–40. in print.

    Google Scholar 

  3. G. Cattaneo, M. L. D. Chiara, and R. Giuntini, Some algebraic structures for many-valued logics. accepted in Tatra Mountains Mathematical Publication, 1998.

    Google Scholar 

  4. G. Cattaneo, R. Giuntini, and R. Pilla, BZMVdMand Stonian MV algebras (applications to fuzzy sets and rough approximations). in print in Fuzzy Sets Syst., 1998.

    Google Scholar 

  5. G. Cattaneo and G. Marino, Brouwer-Zadeh posets and fuzzy set theory, in Proceedings of the 1st Napoli Meeting on Fuzzy Systems, A. D. Nola and A. Ventre, eds., Napoli, June 1984, pp. 34–58.

    Google Scholar 

  6. G. Cattaneo and G. Nisticò, Brouwer-Zadeh posets and three valued Lukasiewicz posets, Fuzzy Sets Syst., 33 (1989), pp. 165–190.

    Article  MATH  Google Scholar 

  7. C. C. Chang, Algebraic analysis of many valued logics, Trans. Amer. Math. Soc., 88 (1958), pp. 467–490.

    Article  MATH  MathSciNet  Google Scholar 

  8. _____, A new proof of the completeness of the Lukasiewicz axioms, Trans. Amer. Math. Soc., 95 (1959), pp. 74–80.

    Article  Google Scholar 

  9. Z. Pawlak, Information systems-theoretical foundations, Information Systems, 6 (1981), pp. 205–218.

    Article  MATH  Google Scholar 

  10. _____, Rough sets, Internat. J. Inform. Comput. Sci., 11 (1982), pp. 341–356.

    Article  MATH  MathSciNet  Google Scholar 

  11. _____, Rough sets: A new approach to vagueness, in Fuzzy Logic for the Management of Uncertainty, L. A. Zadeh and J. Kacprzyc, eds., J. Wiley and Sons, New York, 1992, pp. 105–118.

    Google Scholar 

  12. N. Rescher, Many-valued Logic, Mc Graw-Hill, New York, 1969.

    MATH  Google Scholar 

  13. D. Vakarelov, A modal logic for similarity relations in Pawlak knowledge representation systems, Fundamenta Informaticae, XV (1991), pp. 61–79.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cattaneo, G. (1998). Fuzzy Extension of Rough Sets Theory. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics