Abstract
Hierarchical quotient space structure (HQSS), which is a typical representation of multigranulation spaces, serves as the essential description tool of fuzzy equivalence relations. However, current studies on HQSS have three main limitations: (i) The inability to reflect the relationship between any two quotient spaces in an HQSS, (ii) classification isomorphism cannot characterize the degree of subdivision that exists in an HQSS with changing granularities, and (iii) the difficulty in characterizing the difference between two HQSSs that are classification isomorphic. In this paper, we address these issues from the perspective of knowledge distance. First, we propose a partition-based knowledge distance based on the Earth Mover’ s Distance (EMD), and we prove that our knowledge distance is equivalent to the binary granule-based knowledge distance (BGKD) but is more intuitive than the BGKD. Then, by studying the hierarchy of HQSS, we conclude that the granularity difference between any two quotient spaces in an HQSS is equal to the knowledge distance between them. In the view of knowledge distance, the concepts of classification isomorphism and subdivision isomorphism are defined and discussed. Finally, we define the concept of the knowledge difference sequence pair, which not only discriminates whether two fuzzy equivalence relations are isomorphic, but also characterizes the difference between any two HQSSs with respect to them. Theoretical analysis shows that our work is valuable for advancing the application of the hierarchy granular computing theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.