Abstract
A lattice-valued information system is an important model in the field of artificial intelligence and the notion of homomorphisms between lattice-valued information systems is a kind of tools to study data compression in a lattice-valued information system. This paper investigates invariant characterizations of information structures in a lattice-valued information system under homomorphisms based on data compression. Information structures in a lattice-valued information system is first proposed by using set vectors. Then, dependence and independence between information structures in the same lattice-valued information system is characterized by the inclusion degree. Finally, a complex massive lattice-valued information system can be compressed into a relatively small-scale lattice-valued information system by means of homomorphisms and it is proved that some characterizations of information structures in a lattice-valued information system under homomorphisms based on data compression are invariant, that is, some of the same data structures are obtained.
Keywords
Get full access to this article
View all access options for this article.
