Average Time Complexity of Decision Trees (Hardcover, 2011 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Intelligent Systems Reference Library, 21
Release date:	August 2011
First published:	2011
Authors:	Igor Chikalov
Dimensions:	235 x 155 x 7mm (L x W x T)
Format:	Hardcover
Pages:	104
Edition:	2011 ed.
ISBN-13:	978-3-642-22660-1
Categories:	Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-642-22660-4
Barcode:	9783642226601

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!