# Bounds on Average Time Complexity of Decision Trees

- Handle URI:
- http://hdl.handle.net/10754/561674
- Title:
- Bounds on Average Time Complexity of Decision Trees
- Authors:
- Abstract:
- In this chapter, bounds on the average depth and the average weighted depth of decision trees are considered. Similar problems are studied in search theory [1], coding theory [77], design and analysis of algorithms (e.g., sorting) [38]. For any diagnostic problem, the minimum average depth of decision tree is bounded from below by the entropy of probability distribution (with a multiplier 1/log2 k for a problem over a k-valued information system). Among diagnostic problems, the problems with a complete set of attributes have the lowest minimum average depth of decision trees (e.g, the problem of building optimal prefix code [1] and a blood test study in assumption that exactly one patient is ill [23]). For such problems, the minimum average depth of decision tree exceeds the lower bound by at most one. The minimum average depth reaches the maximum on the problems in which each attribute is "indispensable" [44] (e.g., a diagnostic problem with n attributes and kn pairwise different rows in the decision table and the problem of implementing the modulo 2 summation function). These problems have the minimum average depth of decision tree equal to the number of attributes in the problem description. © Springer-Verlag Berlin Heidelberg 2011.
- KAUST Department:
- Journal:
- Issue Date:
- 2011
- DOI:
- 10.1007/978-3-642-22661-8_2
- Type:
- Article
- ISSN:
- 18684394
- ISBN:
- 9783642226601

- Appears in Collections:
- Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

# Full metadata record

DC Field | Value | Language |
---|---|---|

dc.contributor.author | Chikalov, Igor | en |

dc.date.accessioned | 2015-08-03T09:02:01Z | en |

dc.date.available | 2015-08-03T09:02:01Z | en |

dc.date.issued | 2011 | en |

dc.identifier.isbn | 9783642226601 | en |

dc.identifier.issn | 18684394 | en |

dc.identifier.doi | 10.1007/978-3-642-22661-8_2 | en |

dc.identifier.uri | http://hdl.handle.net/10754/561674 | en |

dc.description.abstract | In this chapter, bounds on the average depth and the average weighted depth of decision trees are considered. Similar problems are studied in search theory [1], coding theory [77], design and analysis of algorithms (e.g., sorting) [38]. For any diagnostic problem, the minimum average depth of decision tree is bounded from below by the entropy of probability distribution (with a multiplier 1/log2 k for a problem over a k-valued information system). Among diagnostic problems, the problems with a complete set of attributes have the lowest minimum average depth of decision trees (e.g, the problem of building optimal prefix code [1] and a blood test study in assumption that exactly one patient is ill [23]). For such problems, the minimum average depth of decision tree exceeds the lower bound by at most one. The minimum average depth reaches the maximum on the problems in which each attribute is "indispensable" [44] (e.g., a diagnostic problem with n attributes and kn pairwise different rows in the decision table and the problem of implementing the modulo 2 summation function). These problems have the minimum average depth of decision tree equal to the number of attributes in the problem description. © Springer-Verlag Berlin Heidelberg 2011. | en |

dc.title | Bounds on Average Time Complexity of Decision Trees | en |

dc.type | Article | en |

dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | en |

dc.identifier.journal | Intelligent Systems Reference Library | en |

kaust.author | Chikalov, Igor | en |

All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.