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.
The author’s work has been supported by MIUR PRIN project “Automata and Formal languages: mathematical and application driven studies.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Information systems - theoretical foundations. Information systems 6, 205–218 (1981)
Cattaneo, G.: Abstract approximation spaces for rough theories. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1, pp. 59–98. Physica–Verlag, Heidelberg (1998)
Pawlak, Z.: Rough sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Komorowski, J., et al.: Rough sets: A tutorial. In: Pal, S., Skowron, A. (eds.) Rough Fuzzy Hybridization, pp. 3–98. Springer, Singapore (1999)
Cattaneo, G., Ciucci, D.: Investigation about Time Monotonicity of Similarity and Preclusive Rough Approximations in Incomplete Information Systems. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 38–48. Springer, Heidelberg (2004)
Preparata, F.P., Yeh, R.T.: Introduction to Discrete Structures. Addison-Wesley, Reading (1973)
Bianucci, D., Cattaneo, G., Ciucci, D.: Entropies and co–entropies of coverings with application to incomplete information systems. Fundamenta Informaticae 75, 77–105 (2007)
Beaubouef, T., Petry, F.E., Arora, G.: Information–theoretic measures of uncertainty for rough sets and rough relational databases. Journal of Information Sciences 109, 185–195 (1998)
Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379–423 (1948)
Yao, Y.: Probabilistic approaches to rough sets. Expert Systems 20, 287–297 (2003)
Reza, F.M.: An Introduction to Information theory. Dover Publications, New York (1994), (originally published by Mc Graw-Hill, New York, 1961)
Duntsch, I., Gediga, G.: Roughian: Rough information analysis. International Journal of Intelligent Systems 16, 121–147 (2001)
Liang, J., Xu, Z.: Uncertainty measure of randomness of knowledge and rough sets in incomplete information systems. Intelligent Control and Automata (Proc. of the 3rd World Congress on Intelligent Control and Automata) 4, 2526–2529 (2000)
Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Sciences 112, 39–49 (1998)
Huang, B., He, X., Zhong, X.: Rough entropy based on generalized rough sets covering reduction. Journal of Software 15, 215–220 (2004)
Gediga, G., Duntsch, I.: Rough approximation quality revisited. Artificial Intelligence 132, 219–234 (2001)
Polkowski, L., Skowron, A.: Rough Sets in Knowledge Discovery 1. Physica–Verlag, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bianucci, D., Cattaneo, G., Ciucci, D. (2007). Entropies and Co–entropies for Incomplete Information Systems. In: Yao, J., Lingras, P., Wu, WZ., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds) Rough Sets and Knowledge Technology. RSKT 2007. Lecture Notes in Computer Science(), vol 4481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72458-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-72458-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72457-5
Online ISBN: 978-3-540-72458-2
eBook Packages: Computer ScienceComputer Science (R0)