000 02930nam a22004455i 4500
001 978-3-642-22661-8
003 DE-He213
005 20140220083809.0
007 cr nn 008mamaa
008 110809s2011 gw | s |||| 0|eng d
020 _a9783642226618
_9978-3-642-22661-8
024 7 _a10.1007/978-3-642-22661-8
_2doi
050 4 _aQ342
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
100 1 _aChikalov, Igor.
_eauthor.
245 1 0 _aAverage Time Complexity of Decision Trees
_h[electronic resource] /
_cby Igor Chikalov.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _aXII, 104 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aIntelligent Systems Reference Library,
_x1868-4394 ;
_v21
505 0 _a1 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.
520 _aDecision 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.
650 0 _aEngineering.
650 0 _aArtificial intelligence.
650 1 4 _aEngineering.
650 2 4 _aComputational Intelligence.
650 2 4 _aArtificial Intelligence (incl. Robotics).
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642226601
830 0 _aIntelligent Systems Reference Library,
_x1868-4394 ;
_v21
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-22661-8
912 _aZDB-2-ENG
999 _c108236
_d108236