Decision trees with optimal joint partitioning
نویسندگان
چکیده
منابع مشابه
Decision trees with optimal joint partitioning
Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of this method. We try to merge the categories in an optimal unspecified number of supermodalities. O...
متن کاملSemi-supervised graph partitioning with decision trees.
In this paper we investigate a new framework for graph partitioning using decision trees to search for sub-graphs within a graph adjacency matrix. Graph partitioning by a decision tree seeks to optimize a specified graph partitioning index such as ratio cut by recursively applying decision rules found within nodes of the graph. Key advantages of tree models for graph partitioning are they provi...
متن کاملOptimal Decision Trees
We propose an Extreme Point Tabu Search (EPTS) algorithm that constructs globally optimal decision trees for classiication problems. Typically, decision tree algorithms are greedy. They optimize the misclassiication error of each decision sequentially. Our non-greedy approach minimizes the misclassiication error of all the decisions in the tree concurrently. Using Global Tree Optimization (GTO)...
متن کاملOptimal Partitioning for Classification and Regression Trees
In designing a decision tree for classification or regression, one selects at each node a feature to be tested, and partitions the range of that feature into a small number of bins, each bin corresponding to a child of the node. When the feature’s range is discrete with N unordered outcomes, the optimal partition, that is, the partition minimizing an expected loss, is usually found by an exhaus...
متن کاملA Decision Procedure for Optimal Polyhedron Partitioning
In two dimensions, the problem has the intriguing property of being solvable in polynomial time, yet of being NP-hard, if ho/es are allowed into the polygons [6]. In three dimensions, because of the possibly large size of the output, the problem has a quadra‘tic lower bound on its complexity [2]; furthermore it has been shown to be NP-hard [6]. It is unknown, however, whether the problem is in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems
سال: 2005
ISSN: 0884-8173,1098-111X
DOI: 10.1002/int.20091