article

A comparative study of some generalized rough approximations

Author:

Anna GomolińskaAuthors Info & Claims

Fundamenta Informaticae, Volume 51, Issue 1

Pages 103 - 119

Published: 15 March 2002 Publication History

Abstract

In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized rough approximation mappings, where both definability of sets by elementary granules of information as well as the issue of distinction among positive, negative, and border regions of a set are taken into account.

References

[1]

{1} Burns, T. R., Gomolińska, A.: The Theory of Socially Embedded Games: The Mathematics of Social Relationships, Rule Complexes, and Action Modalities, Quality and Quantity Int. J. Methodology,34(4), 2000, 379-406.]]

[2]

{2} Burns, T. R., Gomolińska, A., Meeker, L. D.: The Theory of Socially Embedded Games: Applications and Extensions to Open and Closed Games, Quality and Quantity Int. J. Methodology,35(1), 2001, 1-32.]]

[3]

{3} Cattaneo, G.: Abstract Approximation Spaces for Rough Theories, {24}, 1, 1998.]]

[4]

{4} Cattaneo, G.: Fuzzy Extension of Rough Sets Theory, {23}, 1998.]]

Digital Library

[5]

{5} Drwal, G., Mrózek, A.: System RClass - Software Implementation of a Rough Classifier, {12}, 1998.]]

[6]

{6} Engelking, R.: General Topology, PWN The Polish Scientific Publishers, Warsaw, 1977.]]

[7]

{7} Gomolińska, A.: A Note on Generalized Rough Approximation, Proc. Int. Workshop on Concurrency, Specification and Programming (CS & P'2001), Warsaw, Poland, 2001, October, 3-5th (L. Czaja, Ed.), Warsaw University, 2001.]]

[8]

{8} Greco, S., Matarazzo, B., Slowiński, R.: Fuzzy Similarity Relation as a Basis for Rough Approximations, {23}, 1998.]]

Digital Library

[9]

{9} Hirano, S., Inuiguchi, M., Tsumoto, S., Eds.: Proc. Int. Workshop on Rough Set Theory and Granular Computing (RSTGC'2001), Matsue, Shimane, Japan, 2001, May, 20-22nd, vol. 5(1-2) of Bull. Int. Rough Set Society, ISSN 1346-0013, 2001.]]

[10]

{10} Intan, R., Mukaidono, M., Yao, Y. Y.: Generalization of Rough Sets with α-coverings of the Universe Induced by Conditional Probability Relations, {9}, 2001.]]

[11]

{11} Inuiguchi, M., Tanino, T.: On Rough Sets under Generalized Equivalence Relations, {9}, 2001.]]

[12]

{12} Klopotek, M. A., Michalewicz, M., Ras, Z. W., Eds.: Proc. 7th Int. Symposium on Intelligent Information Systems (IIS'1998), Malbork, Poland, 1998, June, 15-19th, Computer Science Institute of Polish Acad. Sci., 1998.]]

Digital Library

[13]

{13} Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough Sets: A Tutorial, {19}, 1999.]]

[14]

{14} Krawiec, K., Slowiński, R., Vanderpooten, D.: Learning Decision Rules from Similarity Based Rough Approximations, {24}, 2, 1998.]]

[15]

{15} Kryszkiewicz, M.: Rough Set Approach to Incomplete Information System, Int. J. Information Sciences,112, 1998, 39-49.]]

Digital Library

[16]

{16} Lin, T. Y.: Granular Computing: Fuzzy Logic and Rough Sets, {37}, 1, 1999.]]

[17]

{17} Lin, T. Y., Cercone, N., Eds.: Rough Sets and Data Mining: Analysis of Imprecise Data, Kluwer Acad. Publ., Boston London Dordrecht, 1997.]]

Digital Library

[18]

{18} Nguyen, S. H., Skowron, A., Stepaniuk, J.: Granular Computing. A Rough Set Approach, J. Comput. Intelligence,17(3), 2001, 514-544.]]

[19]

{19} Pal, S. K., Skowron, A., Eds.: Rough-Fuzzy Hybridization: A New Trend in Decision Making, Springer-Verlag, Singapore, 1999.]]

Digital Library

[20]

{20} Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer Acad. Publ., Dordrecht, 1991.]]

Digital Library

[21]

{21} Polkowski, L.: Mathematical Morphology of Rough Sets, Bull. Polish Acad. Sci. Math., 41(3), 1993, 241-273.]]

[22]

{22} Polkowski, L., Skowron, A.: Rough Mereology: A New Paradigm for Approximate Reasoning, Int. J. Approximated Reasoning,15(4), 1996, 333-365.]]

[23]

{23} Polkowski, L., Skowron, A., Eds.: Proc. 1st Int. Conf. Rough Sets and Current Trends in Computing (RSCTC'1998), Warsaw, Poland, 1998, June, 22-26th, vol. 1424 of Lecture Notes in AI, Springer-Verlag, Berlin, 1998.]]

Digital Library

[24]

{24} Polkowski, L., Skowron, A., Eds.: Rough Sets in Knowledge Discovery, vol. 1-2, Physica-Verlag, Heidelberg, 1998.]]

Digital Library

[25]

{25} Polkowski, L., Tsumoto, S., Lin, T. Y., Eds.: Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, Physica-Verlag, Heidelberg New York, 2000.]]

Digital Library

[26]

{26} Pomykala, J. A.: Approximation Operations in Approximation Space, Bull. Polish Acad. Sci. Math., 35(9-10), 1987, 653-662.]]

[27]

{27} Skowron, A., Stepaniuk, J.: Tolerance Approximation Spaces, Fundamenta lnformaticae,27, 1996, 245-253.]]

Digital Library

[28]

{28} Slowiński, R., Vanderpooten, D.: Similarity Relation as a Basis for Rough Approximations, vol. 53/95 of ICS Research Report, Institute of Computer Science, Warsaw University of Technology, Warsaw, 1995.]]

[29]

{29} Stefanowski, J.: Algorithms of Rule Induction for Knowledge Discovery (In Polish), vol. 361 of Rozprawy, Poznań University of Technology, Poznań, 2001.]]

[30]

{30} Stefanowski, J., Tsoukiàs, A.: Incomplete Information Tables and Rough Classification, J. Comput. Intelligence, 17(3), 2001, 545-566.]]

[31]

{31} Stepaniuk, J.: Approximation Spaces in Extensions of Rough Set Theory, {23}, 1998.]]

Digital Library

[32]

{32} Stepaniuk, J.: Knowledge Discovery by Application of Rough Set Models, {25}, 2000.]]

Digital Library

[33]

{33} Wybraniec-Skardowska, U.: On a Generalization of Approximation Space, Bull. Polish Acad. Sci. Math., 37(1-6), 1989, 51-62.]]

[34]

{34} Yao, Y. Y.: On Generalizing Pawlak Approximation Operators, {23}, 1998.]]

Digital Library

[35]

{35} Yao, Y. Y., Wong, S. K. M., Lin, T. Y.: A Review of Rough Set Models, {17}, 1997.]]

[36]

{36} Zadeh, L. A.: Outline of a New Approach to the Analysis of Complex System and Decision Processes, IEEE Trans. on Systems, Man, and Cybernetics,3, 1973, 28-44.]]

[37]

{37} Zadeh, L. A., Kacprzyk, J., Eds.: Computing with Words in Information/Intelligent Systems, vol. 1-2, Physica-Verlag, Heidelberg, 1999.]]

[38]

{38} Zakowski, W.: Approximations in the Space (U, Π), Demonstratio Mathematica,16, 1983, 761-769.]]

[39]

{39} Ziarko, W.: Variable Precision Rough Set Model, J. Computer and System Sciences,46(1), 1993, 39-59.]]

Digital Library

[40]

{40} Ziarko, W.: Probabilistic Decision Tables in the Variable Precision Rough Set Model, J. Comput. Intelligence,17(3), 2001, 593-603.]]

Cited By

Gomolińska A(2019)A Graded Meaning of Formulas in Approximation SpacesFundamenta Informaticae10.5555/2370556.237056960:1-4(159-172)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2370556.2370569
Gomolińska A(2019)Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation SpacesFundamenta Informaticae10.5555/2370176.237018367:1-3(77-92)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2370176.2370183
Gomolińska A(2019)Approximation Spaces Based on Relations of Similarity and Dissimilarity of ObjectsFundamenta Informaticae10.5555/2367396.236740279:3-4(319-333)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2367396.2367402
Show More Cited By

Index Terms

A comparative study of some generalized rough approximations
1. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Formal languages and automata theory

Recommendations

A Comparative Study of Some Generalized Rough Approximations
Concurrency Specification and Programming Workshop (CS&P'2001)

In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized ...
Fuzzy rough approximations for set-valued data

Rough set theory is one of important tools of soft computing, and rough approximations are the essential elements in rough set models. However, the existing fuzzy rough set model for set-valued data, which is directly constructed based on a kind of ...
Dynamic updating approximations of local generalized multigranulation neighborhood rough set
Abstract
The approximation space in rough set theory is important for dealing with uncertainties. As the information contained in various information systems is constantly updated and changed with the development of information technology, how to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Fundamenta Informaticae

Fundamenta Informaticae Volume 51, Issue 1

March 2002

243 pages

ISSN:0169-2968

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 15 March 2002

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gomolińska A(2019)A Graded Meaning of Formulas in Approximation SpacesFundamenta Informaticae10.5555/2370556.237056960:1-4(159-172)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2370556.2370569
Gomolińska A(2019)Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation SpacesFundamenta Informaticae10.5555/2370176.237018367:1-3(77-92)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2370176.2370183
Gomolińska A(2019)Approximation Spaces Based on Relations of Similarity and Dissimilarity of ObjectsFundamenta Informaticae10.5555/2367396.236740279:3-4(319-333)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2367396.2367402
Gomolińska A(2019)Approximation Spaces Based on Relations of Similarity and Dissimilarity of ObjectsFundamenta Informaticae10.5555/1366071.136607779:3-4(319-333)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1366071.1366077
Gomolińska A(2019)Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation SpacesFundamenta Informaticae10.5555/1227199.122720667:1-3(77-92)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1227199.1227206
Gomolińska A(2019)A Graded Meaning of Formulas in Approximation SpacesFundamenta Informaticae10.5555/1226781.122679360:1-4(159-172)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/1226781.1226793
Grabowski A(2019)Building a Framework of Rough Inclusion Functions by Means of Computerized Proof AssistantRough Sets10.1007/978-3-030-22815-6_18(225-238)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1007/978-3-030-22815-6_18
Qin KPei ZXu Y(2011)Rough approximations in general approximation spacesProceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making10.5555/2051179.2051192(81-89)Online publication date: 28-Oct-2011
https://dl.acm.org/doi/10.5555/2051179.2051192
Bonikowski Z(2010)Unit operations in approximation spacesProceedings of the 7th international conference on Rough sets and current trends in computing10.5555/1876210.1876253(337-346)Online publication date: 28-Jun-2010
https://dl.acm.org/doi/10.5555/1876210.1876253
Grabowski AJastrzębska M(2010)A note on a formal approach to rough operatorsProceedings of the 7th international conference on Rough sets and current trends in computing10.5555/1876210.1876250(307-316)Online publication date: 28-Jun-2010
https://dl.acm.org/doi/10.5555/1876210.1876250
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents