On compressible information systems

Mikhail Moshkov

doi:10.1007/3-540-45813-1_19

On compressible information systems

Mikhail Moshkov^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English (US)
Title of host publication	Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings
Editors	James J. Alpigini, James F. Peters, Andrzej Skowron, Ning Zhong
Publisher	Springer Verlag
Pages	156-160
Number of pages	5
ISBN (Print)	9783540442745
DOIs	https://doi.org/10.1007/3-540-45813-1_19
State	Published - 2002
Externally published	Yes
Event	3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002 - Malvern, United States Duration: Oct 14 2002 → Oct 16 2002

Publication series

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

Other

Other	3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002
Country/Territory	United States
City	Malvern
Period	10/14/02 → 10/16/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45813-1_19

Cite this

Moshkov, M. (2002). On compressible information systems. In J. J. Alpigini, J. F. Peters, A. Skowron, & N. Zhong (Eds.), Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings (pp. 156-160). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2475). Springer Verlag. https://doi.org/10.1007/3-540-45813-1_19

Moshkov, Mikhail. / On compressible information systems. Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings. editor / James J. Alpigini ; James F. Peters ; Andrzej Skowron ; Ning Zhong. Springer Verlag, 2002. pp. 156-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

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

}

Moshkov, M 2002, On compressible information systems. in JJ Alpigini, JF Peters, A Skowron & N Zhong (eds), Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2475, Springer Verlag, pp. 156-160, 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002, Malvern, United States, 10/14/02. https://doi.org/10.1007/3-540-45813-1_19

On compressible information systems. / Moshkov, Mikhail.
Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings. ed. / James J. Alpigini; James F. Peters; Andrzej Skowron; Ning Zhong. Springer Verlag, 2002. p. 156-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2475).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On compressible information systems

AU - Moshkov, Mikhail

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0038329594&partnerID=8YFLogxK

U2 - 10.1007/3-540-45813-1_19

DO - 10.1007/3-540-45813-1_19

M3 - Conference contribution

AN - SCOPUS:0038329594

SN - 9783540442745

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 156

EP - 160

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

A2 - Alpigini, James J.

A2 - Peters, James F.

A2 - Skowron, Andrzej

A2 - Zhong, Ning

PB - Springer Verlag

T2 - 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002

Y2 - 14 October 2002 through 16 October 2002

ER -

Moshkov M. On compressible information systems. In Alpigini JJ, Peters JF, Skowron A, Zhong N, editors, Rough Sets and Current Trends in Computing - 3rd International Conference, RSCTC 2002, Proceedings. Springer Verlag. 2002. p. 156-160. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45813-1_19

On compressible information systems

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this