Abstract
In the paper infinite information systems are investigated which are used in pattern recognition, discrete optimization, and computational geometry. An information system is called compressible relatively to a weight function if for each problem with enough big weight (total weight of attributes in problem description) there exists a decision tree which solves this problem and which weighted depth is less than the problem weight. In the paper all pairs of information systems and weight functions are described such that the information system is compressible relatively to the weight function.
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
Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR 51 (1958) 270–360 (in Russian)
Moshkov, M.Ju.: Conditional tests. Problemy Kybernetiki 40. Edited by S.V. Yablonskii. Nauka Publishers, Moscow (1983) 131–170 (in Russian)
Moshkov, M.Ju.: Decision Trees. Theory and Applications. Nizhny Novgorod University Publishers, Nizhny Novgorod (1994) (in Russian)
Moshkov, M.Ju.: Unimprovable upper bounds on time complexity of decision trees. Fundamenta Informaticae 31(2) (1997) 157–184
Moshkov, M.Ju.: Classification of infinite information systems. Proceedings of the Second Internationsl Conference on Rough Sets and Current Trends in Computing (RSCTC’2000), Banff, Canada, October 16-19, 2000. Edited by W. Ziarko and Yiyu Yao (2000) 167–171
Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, Boston, London (1991)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Edited by R. Slowinski. Kluwer Academic Publishers, Dordrecht, Boston, London (1992) 331–362
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moshkov, M. (2002). On Compressible Information Systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-45813-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44274-5
Online ISBN: 978-3-540-45813-5
eBook Packages: Springer Book Archive