Algorithms for constructing of decision trees

Mikhail Moshkov

doi:10.1007/3-540-63223-9_132

Algorithms for constructing of decision trees

Mikhail Moshkov^*

^*Corresponding author for this work

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

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 language	English (US)
Title of host publication	Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings
Editors	Jan Komorowski, Jan Zytkow
Publisher	Springer Verlag
Pages	335-342
Number of pages	8
ISBN (Print)	3540632239, 9783540632238
DOIs	https://doi.org/10.1007/3-540-63223-9_132
State	Published - 1997
Externally published	Yes
Event	1st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD 1997 - Trondheim, Norway Duration: Jun 24 1997 → Jun 27 1997

Publication series

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

Other

Other	1st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD 1997
Country/Territory	Norway
City	Trondheim
Period	06/24/97 → 06/27/97

Bibliographical note

Publisher Copyright:
© Springer-Vertag Berlin Heidelberg 1997.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-63223-9_132

Cite this

Moshkov, M. (1997). Algorithms for constructing of decision trees. In J. Komorowski, & J. Zytkow (Eds.), Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings (pp. 335-342). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1263). Springer Verlag. https://doi.org/10.1007/3-540-63223-9_132

Moshkov, Mikhail. / Algorithms for constructing of decision trees. Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings. editor / Jan Komorowski ; Jan Zytkow. Springer Verlag, 1997. pp. 335-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d7ab06e8f4964f188cfcdbb8c6b29125,

title = "Algorithms for constructing of decision trees",

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

author = "Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} Springer-Vertag Berlin Heidelberg 1997.; 1st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD 1997 ; Conference date: 24-06-1997 Through 27-06-1997",

year = "1997",

doi = "10.1007/3-540-63223-9_132",

language = "English (US)",

isbn = "3540632239",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "335--342",

editor = "Jan Komorowski and Jan Zytkow",

booktitle = "Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings",

address = "Germany",

}

Moshkov, M 1997, Algorithms for constructing of decision trees. in J Komorowski & J Zytkow (eds), Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1263, Springer Verlag, pp. 335-342, 1st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD 1997, Trondheim, Norway, 06/24/97. https://doi.org/10.1007/3-540-63223-9_132

Algorithms for constructing of decision trees. / Moshkov, Mikhail.
Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings. ed. / Jan Komorowski; Jan Zytkow. Springer Verlag, 1997. p. 335-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1263).

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

TY - GEN

T1 - Algorithms for constructing of decision trees

AU - Moshkov, Mikhail

N1 - Publisher Copyright: © Springer-Vertag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

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

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

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

U2 - 10.1007/3-540-63223-9_132

DO - 10.1007/3-540-63223-9_132

M3 - Conference contribution

AN - SCOPUS:84947769035

SN - 3540632239

SN - 9783540632238

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

SP - 335

EP - 342

BT - Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings

A2 - Komorowski, Jan

A2 - Zytkow, Jan

PB - Springer Verlag

T2 - 1st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD 1997

Y2 - 24 June 1997 through 27 June 1997

ER -

Moshkov M. Algorithms for constructing of decision trees. In Komorowski J, Zytkow J, editors, Principles of Data Mining and Knowledge Discovery - 1st European Symposium, PKDD 1997, Proceedings. Springer Verlag. 1997. p. 335-342. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63223-9_132

Algorithms for constructing of decision trees

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this