Information Entropy and Granulation Co---Entropy of Partitions and Coverings: A Summary

  • Authors:

  • Daniela Bianucci;Gianpiero Cattaneo

  • Affiliations:

  • Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano --- Bicocca, Milano, Italia I---20126;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano --- Bicocca, Milano, Italia I---20126

  • Venue:
  • Transactions on Rough Sets X
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some approaches to the covering information entropy and some definitions of orderings and quasi---orderings of coverings will be described, generalizing the case of the partition entropy and ordering. The aim is to extend to covering the general result of anti---tonicity (strictly decreasing monotonicity) of partition entropy. In particular an entropy in the case of incomplete information systems is discussed, with the expected anti-tonicity result, making use of a partial partition strategy in which the missing information is treated as a peculiar value of the system.On the other side, an approach to generate a partition from a covering is illustrated. In particular, if we have a covering 驴 coarser than another covering 驴 with respect to a certain quasi order relation on coverings, the induced partition 驴(驴) results to be coarser than 驴(驴) with respect to the standard partial ordering on partitions. Thus, one can compare the two coverings through the entropies of the induced partitions.