Possibilistic entropies and the compression of possibilistic data

  • Authors:
  • Andrea Sgarro;Liviu Petrisor Dinu

  • Affiliations:
  • DSM (Department of Mathematical Sciences), University of Trieste, 34100 Trieste, Italy;DSM (Department of Mathematical Sciences), University of Trieste, 34100 Trieste, Italy

  • Venue:
  • International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We re-take the possibilistic model for information sources recently put forward by the first author, as opposed to the standard probabilistic models of information theory. Based on an interpretation of possibilistic source coding inspired by utility functions, we define a notion of possibilistic entropy for a suitable class of interactive possibillstic sources, and compare it with the possibilistic entropy of stationary non-interactive sources. Both entropies have a coding-theoretic nature, being obtained as limit values for the rates of optimal compression codes. We list properties of the two entropies, which might support their use as measures of "possibilistic ignorance".