Entropies and co-entropies for incomplete information systems

Authors:
Daniela Bianucci;Gianpiero Cattaneo;Davide Ciucci
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano-Bicocca, Milano, Italia;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano-Bicocca, Milano, Italia;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano-Bicocca, Milano, Italia
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 5
Cited 3

Rough set approach to incomplete information systems

Information Sciences: an International Journal
Rough approximation quality revisited

Artificial Intelligence
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Information-theoretic measures of uncertainty for rough sets and rough relational databases

Information Sciences: an International Journal

On non-pointwise entropies of coverings: relationship with anti-monotonicity

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Sand piles: From physics to cellular automata models

Theoretical Computer Science
A measurement theory view on the granularity of partitions

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

A partitioning approach to the problem of dealing with the entropy of incomplete information systems is explored. The aim is to keep into account the incompleteness and at the same time to obtain a probabilistic partition of the information system. For the resulting probabilistic partition, measures of entropy and co-entropy are defined, similarly to the entropies and co-entropies defined for the complete case.