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

0 avg rating
( 0 ratings by Goodreads )
 
9783642270161: Average Time Complexity of Decision Trees (Intelligent Systems Reference Library)
View all copies of this ISBN edition:
 
 

This monograph generalizes several known results on the topic and considers a number of fresh problems. Combinatorics, probability theory and complexity theory are used in the proofs, as well as concepts from discrete mathematics and computer science.

"synopsis" may belong to another edition of this title.

From the Back Cover:

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.

Review:

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)

"About this title" may belong to another edition of this title.

Shipping: US$ 6.11
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Other Popular Editions of the Same Title

9783642226601: Average Time Complexity of Decision Trees (Intelligent Systems Reference Library)

Featured Edition

ISBN 10:  3642226604 ISBN 13:  9783642226601
Publisher: Springer, 2011
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

Igor Chikalov (author)
Published by Springer Berlin Heidelberg 2013-11-27, Berlin (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New paperback Quantity Available: > 20
Seller:
Blackwell's
(Oxford, OX, United Kingdom)

Book Description Springer Berlin Heidelberg 2013-11-27, Berlin, 2013. paperback. Condition: New. Seller Inventory # 9783642270161

More information about this seller | Contact this seller

Buy New
US$ 116.08
Convert currency

Add to Basket

Shipping: US$ 6.11
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

Chikalov, Igor
Published by Springer 2013-11 (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New Quantity Available: 1
Seller:
Chiron Media
(Wallingford, United Kingdom)

Book Description Springer 2013-11, 2013. PF. Condition: New. Seller Inventory # 6666-LSI-9783642270161

More information about this seller | Contact this seller

Buy New
US$ 126.35
Convert currency

Add to Basket

Shipping: US$ 17.57
From United Kingdom to U.S.A.
Destination, rates & speeds

3.

Igor Chikalov
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 116 pp. Englisch. Seller Inventory # 9783642270161

More information about this seller | Contact this seller

Buy New
US$ 130.93
Convert currency

Add to Basket

Shipping: US$ 18.50
From Germany to U.S.A.
Destination, rates & speeds

4.

Igor Chikalov
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New Taschenbuch Quantity Available: 1
Seller:
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Germany)

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 116 pp. Englisch. Seller Inventory # 9783642270161

More information about this seller | Contact this seller

Buy New
US$ 130.93
Convert currency

Add to Basket

Shipping: US$ 18.50
From Germany to U.S.A.
Destination, rates & speeds

5.

Igor Chikalov
Published by Springer (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)

Book Description Springer, 2013. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9783642270161

More information about this seller | Contact this seller

Buy New
US$ 124.22
Convert currency

Add to Basket

Shipping: US$ 36.73
From United Kingdom to U.S.A.
Destination, rates & speeds

6.

Igor Chikalov
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642270166 ISBN 13: 9783642270161
New Taschenbuch Quantity Available: 1
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 116 pp. Englisch. Seller Inventory # 9783642270161

More information about this seller | Contact this seller

Buy New
US$ 130.93
Convert currency

Add to Basket

Shipping: US$ 37.26
From Germany to U.S.A.
Destination, rates & speeds