Classification of infinite information systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationRough Sets and Current Trends in Computing - 2nd International Conference, RSCTC 2000, Revised Papers
PublisherSpringer Verlag
Pages199-203
Number of pages5
Volume2005
ISBN (Print)3540430741, 9783540430742
DOIs
StatePublished - 2001
Externally publishedYes
Event2nd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2000 - Banff, Canada
Duration: Oct 16 2000Oct 19 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2005
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2000
CountryCanada
CityBanff
Period10/16/0010/19/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Classification of infinite information systems'. Together they form a unique fingerprint.

Cite this