Abstract
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.KeywordsBinary RelationApproximation TheoryGranular StructureNeighborhood SystemGranular ComputingThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
