Average Depth and Number of Misclassifications for Decision Trees
نویسندگان
چکیده
This paper presents a new tool for the study of relationships between total path length or average depth and number of misclafficiations for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [1].
منابع مشابه
Generalization in Threshold Networks , Combined DecisionTrees
We derive an upper bound on the generalization error of classiiers from a certain class of threshold networks. The bound depends on the margin of the classiier and the average complexity of the hidden units (where the average is over the weights assigned to each hidden unit). By representing convex combinations of decision trees or mask perceptrons as such threshold networks we obtain similar b...
متن کاملComparing different stopping criteria for fuzzy decision tree induction through IDFID3
Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...
متن کاملDecision Tree Construction using Greedy Algorithms and Dynamic Programming – Comparative Study
The paper presents comparative study for different heuristics used by greedy algorithms for constructing of decision trees. We consider the problem of exact learning for decision tables with discrete attributes. We made experiments with randomly generated decision tables contain attributes with three categories {0,1,2}. Complexity of decision trees is estimated relative to several cost function...
متن کاملDynamic Programming Approach for Study of Decision Trees
In the presentation, we consider extensions of dynamic programming approach to the study of decision trees as algorithms for problem solving, as a way for knowledge extraction and representation, and as classifiers which, for a new object given by values of conditional attributes, define a value of the decision attribute. These extensions allow us (i) to describe the set of optimal decision tre...
متن کاملBounds on Average Weighted Depth of Decision Trees
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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012