On relationships among various cost functions and with an uncertainty measure for decision trees

Prelegent(ci)

Shahid Hussain

Afiliacja

KAUST

Termin

17 czerwca 2011 14:15

Pokój

p. 5820

Seminarium

Seminarium badawcze Zakładu Logiki: Wnioskowania aproksymacyjne w eksploracji danych

---

This talk is devoted to the design of new tools for studying exact and approximate decision trees (α-decision trees). We present algorithms to study the relationships between number of misclassification and number of nodes with the depth of an exact decision tree. We also present an algorithm that describes relationships between these and other cost functions (such as average depth, number of terminal nodes, etc) with a measure of uncertainty for approximate decision tree α -decision trees). Furthermore, we provide results of experiments conducted with these algorithms on decision tables (datasets) acquired from UCI ML Repository.

---