Authors:
- Studies average time complexity of decision trees
- over finite and infinite sets of attributes
- Contains exact and approximate algorithms for decision tree optimization
- Written by a leading expert in the field
Part of the book series: Intelligent Systems Reference Library (ISRL, volume 21)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (5 chapters)
-
Front Matter
-
Back Matter
About this book
Decision tree is a widely used form of representing algorithms and knowledge. Compact data models
and fast algorithms require optimization of tree complexity. This book is a research monograph on
average time complexity of decision trees. It generalizes several known results and considers a number of new problems.
The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time
complexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as
well as concepts from various branches of discrete mathematics and computer science. The considered applications include
the study of average depth of decision trees for Boolean functions from closed classes, the comparison of results of the performance
of greedy heuristics for average depth minimization with optimal decision trees constructed by dynamic programming algorithm,
and optimization of decision trees for the corner point recognition problem from computer vision.
The book can be interesting for researchers working on time complexity of algorithms and specialists
in test theory, rough set theory, logical analysis of data and machine learning.Reviews
From the reviews:
“The book contains several previously known results on the average time complexity of decision trees for a number of new problems. The author presents bounds on the minimum average time complexity of decision trees. … In summary, the results presented in the book may be of interest for researchers in test theory, rough set theory, and logical analysis of data and machine learning. The book is suitable for a graduate or PhD course.” (Jerzy Martyna, Zentralblatt MATH, Vol. 1244, 2012)
Authors and Affiliations
-
Mathematical and Computer Sciences and Engineering Division, 4700 King Abdullah University of Science and Technology, Thuwal, Kingdom of Saudi Arabia
Igor Chikalov
Bibliographic Information
Book Title: Average Time Complexity of Decision Trees
Authors: Igor Chikalov
Series Title: Intelligent Systems Reference Library
DOI: https://doi.org/10.1007/978-3-642-22661-8
Publisher: Springer Berlin, Heidelberg
eBook Packages: Engineering, Engineering (R0)
Copyright Information: Springer-Verlag GmbH Berlin Heidelberg 2011
Hardcover ISBN: 978-3-642-22660-1Published: 04 August 2011
Softcover ISBN: 978-3-642-27016-1Published: 27 November 2013
eBook ISBN: 978-3-642-22661-8Published: 04 August 2011
Series ISSN: 1868-4394
Series E-ISSN: 1868-4408
Edition Number: 1
Number of Pages: XII, 104