Data compression with homomorphism in covering information systems

In reality we are always faced with a large number of complex massive databases. In this work we introduce the notion of a homomorphism as a kind of tool to study data compression in covering information systems. The concepts of consistent functions related to covers are first defined. Then, by classical extension principle the concepts of covering mapping and inverse covering mapping are introduced and their properties are studied. Finally, the notions of homomorphisms of information systems based on covers are proposed, and it is proved that a complex massive covering information system can be compressed into a relatively small-scale information system and its attribute reduction is invariant under the condition of homomorphism, that is, attribute reductions in the original system and image system are equivalent to each other.

[1]  Daisuke Yamaguchi,et al.  Attribute dependency functions considering data efficiency , 2009, Int. J. Approx. Reason..

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

[3]  Qinghua Hu,et al.  Information-preserving hybrid data reduction based on fuzzy-rough techniques , 2006, Pattern Recognit. Lett..

[4]  John N. Mordeson,et al.  Rough set theory applied to (fuzzy) ideal theory , 2001, Fuzzy Sets Syst..

[5]  W. Zakowski.  APPROXIMATIONS IN THE SPACE (U,π) , 1983 .

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

[7]  Qiang Shen,et al.  Selecting informative features with fuzzy-rough sets and its application for complex systems monitoring , 2004, Pattern Recognit..

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

[9]  Xizhao Wang,et al.  On the generalization of fuzzy rough sets , 2005, IEEE Transactions on Fuzzy Systems.

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

[11]  Nehad N. Morsi,et al.  Axiomatics for fuzzy rough sets , 1998, Fuzzy Sets Syst..

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

[13]  Andrzej Skowron,et al.  Rough set methods in feature selection and recognition , 2003, Pattern Recognit. Lett..

[14]  Qingguo Li,et al.  Reduction about approximation spaces of covering generalized rough sets , 2010, Int. J. Approx. Reason..

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

[16]  Yee Leung,et al.  Dependence-space-based attribute reductions in inconsistent decision information systems , 2008, Int. J. Approx. Reason..

[17]  Ying Sai,et al.  A comparison of two types of rough sets induced by coverings , 2009, Int. J. Approx. Reason..

[18]  Fei-Yue Wang,et al.  Reduction and axiomization of covering generalized rough sets , 2003, Inf. Sci..

[19]  Wei-Zhi Wu,et al.  Generalized fuzzy rough sets , 2003, Inf. Sci..

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

[21]  Michael R. Lyu,et al.  Extraction of karyocytes and their components from microscopic bone marrow images based on regional color features , 2004, Pattern Recognit..

[22]  Chen Degang,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007 .

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

[24]  Xizhao Wang,et al.  Learning fuzzy rules from fuzzy samples based on rough set technique , 2007, Inf. Sci..

[25]  Masahiro Inuiguchi,et al.  Variable-precision dominance-based rough set approach and attribute reduction , 2009, Int. J. Approx. Reason..

[26]  D. Dubois,et al.  ROUGH FUZZY SETS AND FUZZY ROUGH SETS , 1990 .