Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: variable precision rough sets

Sortuj według:

Ogranicz wyniki do:

Neighborhood Systems and Variable Precision Generalized Rough Sets

Syau Y.-R., Lin E.-B., Liau C.-J.

Fundamenta Informaticae

2017

Vol. 153, nr 3

271--290

In this paper, we present the connection between the concepts of Variable Precision Generalized Rough Set model (VPGRS-model) and Neighborhood Systems through binary relations. We provide characterizations of lower and upper approximations for VPGRS-model by introducing minimal neighborhood systems. Furthermore, we explore generalizations by investigating variable parameters which are limited by variable precision. We also prove some properties of lower and upper approximations for VPGRS-model.

Weak Dependencies in Approximation Spaces

Ziarko W., Chen X.

Fundamenta Informaticae

2013

Vol. 127, nr 1-4

193--207

The article reviews the basics of the variable precision rough set and the Bayesian approaches to data dependencies detection and analysis. The variable precision rough set and the Bayesian rough set theories are extensions of the rough set theory. They are focused on the recognition and modelling of set overlap-based, also referred to as probabilistic, relationships between sets. The set-overlap relationships are used to construct approximations of undefinable sets. The primary application of the approach is to analysis of weak data co-occurrence-based dependencies in probabilistic decision tables learned from data. The probabilistic decision tables are derived from data to represent the inter-data item connections, typically for the purposes of their analysis or data value prediction. The theory is illustrated with a comprehensive application example illustrating utilization of probabilistic decision tables to face image classification.

Unifying Rough Set Theories via Large Scaled Granular Computing

Lin T.Y., Liu Y., Huang W.

Fundamenta Informaticae

2013

Vol. 127, nr 1-4

413--428

This paper explains the mathematics of large scaled granular computing (GrC), augmented with a new Knowledge theory, by unifying rough set theories (RS) into one single concept, namely, neighborhood systems (NS). NS was first introduced in 1989 by T. Y. Lin to capture the concepts of “near” (topology) and “conflict” (security). Since 1996 when the term Granular Computing (GrC) was coined by T. Y. Lin to label Zadeh's vision, NS has been pushed into the “heart” of GrC. In 2011, LNS, the largest NS, was axiomatized; it implied that this set of axioms defines a new mathematics that realizes Zadeh's vision. The main messages are: this new mathematics is powerful and practical.