@inproceedings{323a7ade1b694f2aa7ca4dfe4d33df29,
title = "Classification of infinite information systems",
abstract = "In the paper infinite information systems are investigated which are used in pattern recognition,discrete optimization, computational geometry. The depth and the size of deterministic and nondeterministic decision trees over such information systems are studied. A partition of the set of all infinite information systems on two classes is considered. Systems from the first class are near to the best from the point of view of deterministic and nondeterministic decision tree time and space complexity. Decision trees for systems from the second class have in the worst case large time or space complexity. In proofs (which are too long and not included to the paper) methods of test theory [1, 2] and rough set theory [8,9] are used.",
author = "Mikhail Moshkov",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 2nd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2000 ; Conference date: 16-10-2000 Through 19-10-2000",
year = "2001",
doi = "10.1007/3-540-45554-X_23",
language = "English (US)",
isbn = "3540430741",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "199--203",
editor = "Wojciech Ziarko and Yiyu Yao",
booktitle = "Rough Sets and Current Trends in Computing - 2nd International Conference, RSCTC 2000, Revised Papers",
address = "Germany",
}