Algorithms for constructing of decision trees

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

5 Scopus citations

Abstract

Decision trees are widely used in different applications for problem solving and for knowledge representation. In the paper algorithms for decision tree constructing with bounds on complexity and precision are considered. In these algorithms different measures for time complexity of decision trees and different measures for uncertainty of decision tables are used. New results about precision of polynomial approximate algorithms for covering problem solving [1, 2] show that some of considered algorithms for decision tree constructing are, apparently, close to unimprovable.
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
Pages335-342
Number of pages8
ISBN (Print)3540632239
DOIs
StatePublished - Jan 1 1997
Externally publishedYes

Bibliographical note

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

Fingerprint

Dive into the research topics of 'Algorithms for constructing of decision trees'. Together they form a unique fingerprint.

Cite this