Data compression with homomorphism in covering information systems

  • Authors:

  • Changzhong Wang;Degang Chen;Chong Wu;Qinhua Hu

  • Affiliations:

  • Department of Mathematics, Bohai University, Jinzhou 121000, PR China;Department of Mathematics and Physics, North China Electric Power University, Beijing 102206, PR China;School of Management, Harbin Institute of Technology, Harbin, Heilongjiang 150001, PR China;Power Engineering, Harbin Institute of Technology, 150001 Harbin, PR China

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.