@inproceedings{a615c33a12bd4d7d9d87a6e76ca17261,

title = "On compressible information systems",

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.",

author = "Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002 ; Conference date: 14-10-2002 Through 16-10-2002",

year = "2002",

doi = "10.1007/3-540-45813-1_19",

language = "English (US)",

isbn = "9783540442745",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "156--160",

editor = "Alpigini, {James J.} and Peters, {James F.} and Andrzej Skowron and Ning Zhong",

booktitle = "Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings",

address = "Germany",

}