Home > ENGINEERING > COMPUTER > CS_TECHREP > 598
Vladik Kreinovich, The University of Texas at El PasoFollow
3-2011
Technical Report: UTEP-CS-11-09b
Published in In: Sergey O. Kuznetsov et al. (Eds.) Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Sets and Granular Computing RSFDGrC'2011 (Moscow, Russia, June 25-27, 2011), Springer Lecture Notes on Artificial Intelligence LNAI, Springer-Verlag, Berlin, Heidelberg, 2011, Vol. 6743, pp. 3-10.
Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Sets and Granular Computing RSFDGrC'2011, Moscow, Russia, June 25-27, 2011.
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds $\Delta$ on the measurement errors. In interval computations, at each intermediate stage of the computation, we have intervals of possible values of the corresponding quantities. As a result, we often have bounds with excess width. One way to remedy this problem is to extend interval technique to rough-set computations, where on each stage, in addition to intervals of possible values of the quantities, we also keep rough sets representing possible values of pairs (triples, etc.).
DOWNLOADS
Since March 22, 2012
Computer Engineering Commons
Advanced Search
Comments
Technical Report: UTEP-CS-11-09b
Published in In: Sergey O. Kuznetsov et al. (Eds.) Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Sets and Granular Computing RSFDGrC'2011 (Moscow, Russia, June 25-27, 2011), Springer Lecture Notes on Artificial Intelligence LNAI, Springer-Verlag, Berlin, Heidelberg, 2011, Vol. 6743, pp. 3-10.
Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Sets and Granular Computing RSFDGrC'2011, Moscow, Russia, June 25-27, 2011.