Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Rough Sets

IJCRS 2019: Rough Sets pp 78–90Cite as

Iterative Set Approximations Based on Tolerance Relation

  • Conference paper
  • First Online:

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

Abstract

We introduce two covering approximation spaces which utilise a ranking method to reduce the number of base sets used at approximation of a set. The ranking method aggregates all the information embedded in the tolerance relation and selects the most promising representatives. We present the method in the context of its process and describe some interesting features of our approximation pairs.

The work/publication is supported by the EFOP-3.6.1-16-2016-00022 project and the ÚNKP-18-3 New National Excellence Program of the Ministry of Human Capacities. The project is co-financed by the European Union and the European Social Fund.

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

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Altman, A., Tennenholtz, M.: Ranking systems: the PageRank axioms. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 1–8. ACM (2005)

    Google Scholar 

  2. Csajbók, Z., Mihálydeák, T.: Partial approximative set theory: a generalization of the rough set theory. Int. J. Comput. Inf. Syst. Ind. Manag. Appl. 4, 437–444 (2012)

    MATH  Google Scholar 

  3. Mani, A.: Choice inclusive general rough semantics. Inf. Sci. 181(6), 1097–1115 (2011)

    Article  MathSciNet  Google Scholar 

  4. Mises, R.V., Pollaczek-Geiringer, H.: Praktische verfahren der gleichungsauflösung. ZAMM - J. Appl. Math. Mech./Zeitschrift für Angewandte Mathematik und Mechanik 9(2), 152–164 (1929). https://doi.org/10.1002/zamm.19290090206, https://onlinelibrary.wiley.com/doi/abs/10.1002/zamm.19290090206

    Article  Google Scholar 

  5. Pawlak, Z.: Rough sets. Int. J. Parallel Program. 11(5), 341–356 (1982)

    MATH  Google Scholar 

  6. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MathSciNet  Google Scholar 

  7. Pawlak, Z., et al.: Rough Sets: Theoretical Aspects of Reasoning about Data. System Theory, Knowledge Engineering and Problem Solving. Kluwer Academic Publishers, Dordrecht (1991)

    Chapter  Google Scholar 

  8. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27(2), 245–253 (1996)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, University of Debrecen, Debrecen, Hungary

    László Aszalós & Dávid Nagy

Authors
  1. László Aszalós
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dávid Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dávid Nagy .

Editor information

Editors and Affiliations

  1. University of Debrecen, Debrecen, Hungary

    Tamás Mihálydeák

  2. Southwest Petroleum University, Chengdu, China

    Fan Min

  3. Chongqing University of Posts and Telecommunications, Chongqing, China

    Guoyin Wang

  4. Indian Institute of Technology Kanpur, Kanpur, India

    Mohua Banerjee

  5. Fujian Normal University, Fuzhou, China

    Ivo Düntsch

  6. University of Rzeszów, Rzeszow, Poland

    Zbigniew Suraj

  7. University of Milano-Bicocca, Milan, Italy

    Davide Ciucci

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aszalós, L., Nagy, D. (2019). Iterative Set Approximations Based on Tolerance Relation. In: Mihálydeák, T., et al. Rough Sets. IJCRS 2019. Lecture Notes in Computer Science(), vol 11499. Springer, Cham. https://doi.org/10.1007/978-3-030-22815-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22815-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22814-9

  • Online ISBN: 978-3-030-22815-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation