PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

A View on Rough Set Concept Approximations

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The concept of approximation is one of the most fundamental in rough set theory. In this work we examine this basic notion as well as its extensions and modifications. The goal is to construct a parameterized approximation mechanism making it possible to develop multi-stage multi-level concept hierarchies that are capable of maintaining acceptable level of imprecision from input to output.
Wydawca
Rocznik
Strony
107--118
Opis fizyczny
Bibliogr. 19 poz.
Twórcy
autor
  • Institute of Mathematics, University of Rzeszów, Rejtana I6A, 35-959 Rzeszów, Poland
autor
  • Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
autor
  • Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
Bibliografia
  • [1] The RoboCup Homepage, http://www.robocup.org.
  • [2] The RSES Homepage, http://logic.mimuw.edu.pl/~rses.
  • [31 The WITAS Homepage, http://www.ida.liu.se/ext/witas/.
  • [4] Bazan, J., Son, N. H., Skowron, A., Szczuka, M. S.: A View on Rough Set Concept Approximations, Proceedings of RSFDGrC'2003 (G. Wang. Q. Liu. Y. Yao, A. Skowron, Eds.). LNAI 2639. Springer-Verlag, Berlin. 2003.
  • [5] Bazan, J. G.: A comparison of dynamic non-dynamic rough set methods for extracting laws from decision tables, in: Rough Sets in Know ledge Discovery (L. Polkowski, A. Skowron, Eds.), Physica-Verlag, Heidelberg. 1998, 321-365.
  • [6] Belnap, N. D.: A useful four-valued logic, in: Modern uses of multiple-valued logic (J. M. Dunn, G. Epstein, D. Reidel, Eds.), Reidel Publishing Company, Boston, 1977, 8-37.
  • [7] Grzymała-Busse, J.: A new version of the rule induction system LERS, Fundamenta Informaticae, 31( I), 1997, 27-39.
  • [8] Hastie. Т.. Tibshirani. R., Friedman, J.: The elements of statistical learning, Springer Series in Statistics, Springer-Verlag, New York. 2001.
  • [9] Komorowski. J., Pawlak, Z., Polkowski. L., Skowron, A.: Rough sets: A tutorial, in: Rough - fuzzy hybridization: A new trend in decision making (S. K. Pal, A. Skowron. Eds.), Springer-Verlag, Singapore. 1999, 3-98.
  • [10] Nguyen, H. S., Skowron, A., Szczuka. M.: Situation identification by unmanned aerial vehicle. Rough Sets and Current Trends in Computing (Proc. RSCTC’2000, Banff. Canada) (W. Ziarko. Y. Yao, Eds.), LNAI 2005, Springer-Verlag. Banff, Canada, 2001.
  • [11] Ohrn. A., Komorowski, J., Skowron, A., Synak. P.: The ROSETTA software system, in: Rough Sets in Know ledge Discovery (L. Polkowski, A. Skowron. Eds.). Physica-Verlag, Heidelberg. 1998. 572-576.
  • [12] Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht, 1991.
  • [13] Pawlak, Z., Skowron, A.: Rough membership functions, in: Advances in the Dernpster-Shafer theory of evidence (R. Yager, M. Fedrizzi, J. Kacprzyk, Eds.), Wiley, New York. 1994. 251-271.
  • [14] Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. Journal of Approximate Reasoning. 15(4), 1996, 333-365.
  • [15] Polkowski, L., Skowron. A.: Towards an adaptive calculus of granules, in: Computing with Words in Information/Intelligent Systems (L. A. Zadeh. J. Kacprzyk. Eds.), Physica-Verlag, Heidelberg, 1999, 201-228.
  • [16] Rauszer, C., Skowron. A.: The discernibility matrices and functions in information systems, in: Intelligent decision support - Handbook of applications and advances of the rough set theory (R. Słowiński, Ed.), Kluwer Academic Publishers. Dordrecht, 1992, 311-362.
  • [17] Skowron, A., Szczuka, M.: Approximate reasoning schemes: Classifiers for Computing with Words, Proceedings of the conference Soft Methods in Probability, Statistics and Data Analysis (SMPS2002) (P. Grzegorzewski, O. Hryniewicz, M. Gil, Eds.), Advances in Soft Computing. Physica-Verlag, Heidelberg, 2002.
  • [18] Vitoria, A., Matuszyński. J.: A logic programming framework for rough sets. Proceedings of RSCTC'2002 (J. Alpigini, J. F. Peters. A. Skowron, Eds.), LNA1 2475, Springer-Verlag, Berlin. 2002.
  • [19] Wróblewski. J.: Covering with reducts - a fast algorithm for rule generation. Proceedings of RSCTC' 1998 (L. Polkowski. A. Skowron, Eds.), LNAI 1424, Springer-Verlag, Berlin, 1998.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0005-0005
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.