Stock up on textbooks with 40% off + FREE shipping or choose from thousands of Protocols eBooks at just 9.99 each!

Intelligent Systems Reference Library

Average Time Complexity of Decision Trees

Authors: Chikalov, Igor

Free Preview
  • 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
see more benefits

Buy this book

eBook 91,62 €
price for Spain (gross)
  • ISBN 978-3-642-22661-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 114,39 €
price for Spain (gross)
  • ISBN 978-3-642-22660-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 114,39 €
price for Spain (gross)
  • ISBN 978-3-642-27016-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Rent the eBook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
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)


Table of contents (5 chapters)

Table of contents (5 chapters)

Buy this book

eBook 91,62 €
price for Spain (gross)
  • ISBN 978-3-642-22661-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 114,39 €
price for Spain (gross)
  • ISBN 978-3-642-22660-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 114,39 €
price for Spain (gross)
  • ISBN 978-3-642-27016-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Rent the eBook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Average Time Complexity of Decision Trees
Authors
Series Title
Intelligent Systems Reference Library
Series Volume
21
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Berlin Heidelberg
eBook ISBN
978-3-642-22661-8
DOI
10.1007/978-3-642-22661-8
Hardcover ISBN
978-3-642-22660-1
Softcover ISBN
978-3-642-27016-1
Series ISSN
1868-4394
Edition Number
1
Number of Pages
XII, 104
Topics