On compressible information systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


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.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Number of pages5
ISBN (Print)9783540442745
StatePublished - Jan 1 2002
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21


Dive into the research topics of 'On compressible information systems'. Together they form a unique fingerprint.

Cite this