{"product_id":"9783642226601","title":"Average Time Complexity of Decision Trees (Intelligent Systems Reference Library) \u003cVol. 21\u003e","description":"\u003cp\u003eDecision tree is a widely used form of representing algorithms and knowledge. Compact data models \u003c\/p\u003e\u003cp\u003eand fast algorithms require optimization of tree complexity. This book is a research monograph on \u003c\/p\u003e\u003cp\u003eaverage time complexity of decision trees. It generalizes several known results and considers a number of new problems. \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThe book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time \u003c\/p\u003e\u003cp\u003ecomplexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as \u003c\/p\u003e\u003cp\u003ewell as concepts from various branches of discrete mathematics and computer science. The considered applications include\u003c\/p\u003e\u003cp\u003ethe study of average depth of decision trees for Boolean functions from closed classes, the comparison of results of the performance \u003c\/p\u003e\u003cp\u003eof greedy heuristics for average depth minimization with optimal decision trees constructed by dynamic programming algorithm,\u003c\/p\u003e\u003cp\u003eand optimization of decision trees for the corner point recognition problem from computer vision.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThe book can be interesting for researchers working on time complexity of algorithms and specialists \u003c\/p\u003ein test theory, rough set theory, logical analysis of data and machine learning.\n\n 1 Introduction.- 2 Bounds on Average Time Complexity of Decision Trees.- 3 Representing Boolean Functions by Decision Trees.- 4 Algorithms for Decision Tree Construction.- 5 Problems Over Information Systems. \u003cp\u003eFrom the reviews:\u003c\/p\u003e\u003cp\u003e\"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)\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":48254365761771,"sku":"00000_00000_00000_00000","price":201.41,"currency_code":"SGD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0758\/4484\/5803\/files\/9783642226601-1.jpg?v=1781726190","url":"https:\/\/kinokuniya.com.sg\/products\/9783642226601","provider":"Books Kinokuniya Singapore","version":"1.0","type":"link"}