Abstract
Upper and lower bounds on minimal average weighted depth and minimal average depth of decision trees over arbitrary information systems are considered. In proofs methods of test theory and rough set theory are used.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 145-156 |
| Number of pages | 12 |
| Journal | Fundamenta Informaticae |
| Volume | 31 |
| Issue number | 2 |
| State | Published - 1997 |
| Externally published | Yes |
Keywords
- Average weighted depth
- Decision tree
- Information system
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Software
- Applied Mathematics
- Safety, Risk, Reliability and Quality