Relational data models and category theory (abstract)
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Universal approximation using radial-basis-function networks
Neural Computation
Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Neighborhood systems and relational databases
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Granular Computing on Binary Relations
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Concept Analysis andWeb Clustering using Combinatorial Topology
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Approximation of sets based on partial covering
Theoretical Computer Science
Partial first-order logic with approximative functors based on properties
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Approximation of sets based on partial covering
Transactions on Rough Sets XVI
| Hi-index | 0.00 |
The goal of approximation in granular computing (GrC), in this paper, is to learn/approximate/express an unknown concept (a subset of the universe) in terms of a collection of available knowledge granules. So the natural operations are "and" and "or". Approximation theory for five GrC models is introduced. Note that GrC approximation theory is different from that of rough set theory (RST), since RST uses "or" only. The notion of universal approximation theory (UAT) is introduced in GrC. This is important since the learning capability of fuzzy control and neural networks is based on UAT. Z. Pawlak had introduced point based and set based approximations. We use an example to illustrate the weakness of set based approximations in GrC.