Some relationships between decision trees and decision rule systems

Mikhail Moshkov*

*Corresponding author for this work

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

1 Scopus citations

Abstract

Relationships between parameters of a decision rule system and the minimal depth of a decision tree which solves the problem of the search of all realizable rules from the system are considered. Unimprovable upper and close to unimprovable lower bounds on the minimal depth of a decision tree are obtained.

Original languageEnglish (US)
Title of host publicationRough Sets and Current Trends in Computing - 1st International Conference, RSCTC 1998, Proceedings
PublisherSpringer Verlag
Pages499-505
Number of pages7
Volume1424
ISBN (Print)3540646558, 9783540646556
StatePublished - 1998
Externally publishedYes
Event1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998 - Warsaw, Poland
Duration: Jun 22 1998Jun 26 1998

Publication series

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

Other

Other1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998
CountryPoland
CityWarsaw
Period06/22/9806/26/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Some relationships between decision trees and decision rule systems'. Together they form a unique fingerprint.

Cite this