Average Time Complexity of Decision Trees - Intelligent Systems Reference Library 21 (Hardback)
  • Average Time Complexity of Decision Trees - Intelligent Systems Reference Library 21 (Hardback)
zoom

Average Time Complexity of Decision Trees - Intelligent Systems Reference Library 21 (Hardback)

(author)
£99.99
Hardback 104 Pages / Published: 04/08/2011
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

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.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642226601
Number of pages: 104
Weight: 760 g
Dimensions: 235 x 155 x 7 mm
Edition: 2011 ed.


MEDIA 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)

You may also be interested in...

Understanding Beliefs
Added to basket
Computer Vision
Added to basket
The Singularity Is Near
Added to basket
Artificial Intelligence: The Basics
Added to basket
Thoughtful Machine Learning
Added to basket
Dark Pools
Added to basket
£9.99
Paperback
The Quest for Artificial Intelligence
Added to basket
Robotics
Added to basket
£13.99
Paperback
Machine Learning
Added to basket
Theory of Conditional Games
Added to basket
Superintelligence
Added to basket
£18.99
Hardback
The Elements of Statistical Learning
Added to basket
Programming Computer Vision with Python
Added to basket
Introduction to Machine Learning
Added to basket
Deep Learning
Added to basket
£39.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.