Algebraic properties of knowledge representation systems
ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: An International Journal
Invariant characters of information systems under some homomorphisms
Information Sciences—Informatics and Computer Science: An International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A systematic study on attribute reduction with rough sets based on general binary relations
Information Sciences: an International Journal
Communicating between information systems
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Algebraic aspects of generalized approximation spaces
International Journal of Approximate Reasoning
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Covering rough sets based on neighborhoods: An approach without using neighborhoods
International Journal of Approximate Reasoning
Information-theoretic measures associated with rough set approximations
Information Sciences: an International Journal
Communication between information systems with covering based rough sets
Information Sciences: an International Journal
Hi-index | 0.07 |
To study the communication between information systems, Wang et al. [C. Wang, C. Wu, D. Chen, Q. Hu, C. Wu, Communicating between information systems, Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and type-2 consistent functions. Some properties of such functions and induced relation mappings have been investigated there. In this paper, we provide an improvement of the aforementioned work by disclosing the symmetric relationship between type-1 and type-2 consistent functions. We present more properties of consistent functions and induced relation mappings and improve upon several deficient assertions in the original work. In particular, we unify and extend type-1 and type-2 consistent functions into the so-called neighborhood-consistent functions. This provides a convenient means for studying the communication between information systems based on various neighborhoods.