Average time complexity of decision trees.

DOI10.1007/978-3-642-22661-8zbMath1244.68003OpenAlexW2395152841MaRDI QIDQ639456

Igor Chikalov

Publication date: 21 September 2011

Published in: Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22661-8

zbMATH Keywords

decision treesinformation systemaverage time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (4)

Decision trees with minimum average depth for sorting eight elements ⋮ Totally optimal decision trees for Boolean functions ⋮ Dependency and accuracy measures for directed graphs ⋮ Granular computing on basic digraphs

Uses Software

• UCI-ml

This page was built for publication: Average time complexity of decision trees.