Read Average Time Complexity of Decision Trees

Average Time Complexity of Decision Trees

Igor Chikalov

4.9/5 (34996 ratings)

Description: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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Average Time Complexity of Decision Trees. To get started finding Average Time Complexity of Decision Trees, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: —

Format: PDF, EPUB & Kindle Edition

Publisher: —

Release: —

ISBN: 3642226620

Description: 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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Average Time Complexity of Decision Trees. To get started finding Average Time Complexity of Decision Trees, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

Average Time Complexity of Decision Trees

Average Time Complexity of Decision Trees

More Books

Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data (Intelligent Systems Reference Library, 41)

Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data (Intelligent Systems Reference Library, 41)

Average Time Complexity of Decision Trees (Intelligent Systems Reference Library) by Igor Chikalov (2011-08-04)

Average Time Complexity of Decision Trees (Intelligent Systems Reference Library) by Igor Chikalov (2011-08-04)

Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data (Intelligent Systems Reference Library) by Igor Chikalov (2014-08-09)

Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data (Intelligent Systems Reference Library) by Igor Chikalov (2014-08-09)

Average Time Complexity of Decision Trees (Intelligent Systems Reference Library Book 21)

Average Time Complexity of Decision Trees (Intelligent Systems Reference Library Book 21)

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library, 146)

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library, 146)

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library Book 146)

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library Book 146)

Decision Trees with Hypotheses (Synthesis Lectures on Intelligent Technologies)

Decision Trees with Hypotheses (Synthesis Lectures on Intelligent Technologies)

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions (Intelligent Systems Reference Library)

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions (Intelligent Systems Reference Library)