Average Time Complexity of Decision Trees cover image

Average Time Complexity of Decision Trees

By Igor Chikalov (auth.)
pdf
Format
2011
Year
English
Language
Springer-Verlag Berlin Heidelberg
Publisher

Summary

<p><p>Decision tree is a widely used form of representing algorithms and knowledge. Compact data models </p><p>and fast algorithms require optimization of tree complexity. This book is a research monograph on </p><p>average time complexity of decision trees. It generalizes several known results and considers a number of new problems. </p><p></p><p>The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time </p><p>complexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as </p><p>well as concepts from various branches of discrete mathematics and computer science. The considered applications include</p><p>the study of average depth of decision trees for Boolean functions from closed classes, the comparison of results of the performance </p><p>of greedy heuristics for average depth minimization with optimal decision trees constructed by dynamic programming algorithm,</p><p>and optimization of decision trees for the corner point recognition problem from computer vision.</p><p></p><p>The book can be interesting for researchers working on time complexity of algorithms and specialists </p>in test theory, rough set theory, logical analysis of data and machine learning.<br><br></p>

Related books


Others
Model Averaging
David Fletcher
Others
Average is the New Awesome
Samantha Matt
Others
An Enemy Called Average
John L. Mason
Others
Averages: A New Approach
Jane Grossman, Michael Grossman, Robert Katz
Physics
On obtaining the limiting relations for correlation averages
N.N.Bogoliubov
Others
Average Time Complexity of Decision Trees
Igor Chikalov (auth.)