Advertisement

© 2011

Average Time Complexity of Decision Trees

  • 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

Book

Part of the Intelligent Systems Reference Library book series (ISRL, volume 21)

Table of contents

  1. Front Matter
  2. Igor Chikalov
    Pages 1-14
  3. Igor Chikalov
    Pages 61-78
  4. Igor Chikalov
    Pages 79-84
  5. Back Matter

About this book

Introduction

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.

Keywords

Average Time Complexity Computational Intelligence Decision Trees Intelligent Systems

Authors and affiliations

  1. 1.Mathematical and Computer Sciences and Engineering Division4700 King Abdullah University of Science and TechnologyThuwalKingdom of Saudi Arabia

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
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Engineering Engineering (R0)
  • Hardcover ISBN 978-3-642-22660-1
  • Softcover ISBN 978-3-642-27016-1
  • eBook ISBN 978-3-642-22661-8
  • Series ISSN 1868-4394
  • Series E-ISSN 1868-4408
  • Edition Number 1
  • Number of Pages XII, 104
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Computational Intelligence
    Artificial Intelligence
  • Buy this book on publisher's site
Industry Sectors
Automotive
Chemical Manufacturing
Biotechnology
IT & Software
Telecommunications
Law
Consumer Packaged Goods
Pharma
Materials & Steel
Finance, Business & Banking
Electronics
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering

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)