Some improved results on communication between information systems

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.

[1]  Deyu Li,et al.  Invariant characters of information systems under some homomorphisms , 2000, Inf. Sci..

[2]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[3]  Cong Wu,et al.  Communicating between information systems , 2008, Inf. Sci..

[4]  Lingyun Yang,et al.  Algebraic aspects of generalized approximation spaces , 2009, Int. J. Approx. Reason..

[5]  Andrzej Skowron,et al.  Rough sets: Some extensions , 2007, Inf. Sci..

[6]  Yiyu Yao,et al.  Constructive and Algebraic Methods of the Theory of Rough Sets , 1998, Inf. Sci..

[7]  Degang Chen,et al.  Homomorphisms between fuzzy information systems , 2009, Appl. Math. Lett..

[8]  Zhiyong Xiao,et al.  Communicating between information systems based on including degrees , 2010, Int. J. Gen. Syst..

[9]  J W Grzymala-Busse,et al.  Algebraic properties of knowledge representation systems , 1986, ISMIS '86.

[10]  William Zhu,et al.  Relationship between generalized rough sets based on binary relation and covering , 2009, Inf. Sci..

[11]  Degang Chen,et al.  Some properties of relation information systems under homomorphisms , 2008, Appl. Math. Lett..

[12]  Li Deyu,et al.  Invariant characters of information systems under some homomorphisms , 2000 .

[13]  Qiaoyan Wen,et al.  Homomorphisms between fuzzy information systems revisited , 2010, Appl. Math. Lett..

[14]  T. Y. Lin tylin,et al.  NEIGHBORHOOD SYSTEMS : A Qualitative Theory for Fuzzy and Rough , 1995 .

[15]  Zbigniew W. Ras,et al.  Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems , 1986 .

[16]  Degang Chen,et al.  A systematic study on attribute reduction with rough sets based on general binary relations , 2008, Inf. Sci..

[17]  Witold Pedrycz,et al.  Granular worlds: Representation and communication problems , 2000 .

[18]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[19]  Yan-Hui Zhai,et al.  On Characteristics of Information System Homomorphisms , 2009, Theory of Computing Systems.

[20]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[21]  T. Y. Lin,et al.  NEIGHBORHOOD SYSTEMS AND APPROXIMATION IN RELATIONAL DATABASES AND KNOWLEDGE BASES , 1989 .

[22]  J. W. Grzymala-Busse,et al.  On rough sets and information system homomorphisms , 1988 .

[23]  Yiyu Yao,et al.  Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators , 1998, Inf. Sci..

[24]  William Zhu,et al.  Generalized rough sets based on relations , 2007, Inf. Sci..