Abstract
The primary goal of this paper is to develop knowledge approximations and representations on binary relation from the view of granular computing (GrC). In rough sets (RS), approximations can be defined by two equivalent views, topology and elementary knowledge. The latter view does not behave well mathematically, so in GrC, topology has often been adopted. Unfortunately, such approximations, called closure and interior, can not be interpreted elementary knowledge. In this paper, we show that they can be interpreted by central knowledge. and based on which knowledge representation is developed. Many examples are used to illustrate the idea.
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.
