Portada

AVERAGE TIME COMPLEXITY OF DECISION TREES IBD

SPRINGER
08 / 2011
9783642226601
Inglés

Sinopsis

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 includethe 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.

PVP
170,28