Results 11 to 20 of about 131,642 (151)
Multivariate decision trees [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brodley, Carla E., Utgoff, Paul E.
openaire +3 more sources
Quinlan and Rivest have suggested a decision-tree inference method using the Minimum Description Length idea. We show that there is an error in their derivation of message lengths, which fortunately has no effect on the final inference. We further suggest two improvements to their coding techniques, one removing an inefficiency in the description of ...
Wallace, C. S., Patrick, J. D.
openaire +2 more sources
Predicting Credit Scores with Boosted Decision Trees
Credit scoring models help lenders decide whether to grant or reject credit to applicants. This paper proposes a credit scoring model based on boosted decision trees, a powerful learning technique that aggregates several decision trees to form a ...
João A. Bastos
doaj +1 more source
Evolutionary Learning of Interpretable Decision Trees
In the last decade, reinforcement learning (RL) has been used to solve several tasks with human-level performance. However, there is a growing demand for interpretable RL, i.e., there is the need to understand how a RL agent works and the rationale of ...
Leonardo L. Custode, Giovanni Iacca
doaj +1 more source
Decision trees for regular factorial languages
In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the ...
Mikhail Moshkov
doaj +1 more source
A Bi-criteria optimization model for adjusting the decision tree parameters
Decision trees play a very important role in knowledge representation because of its simplicity and self-explanatory nature. We study the optimization of the parameters of the decision trees to find a shorter as well as more accurate decision tree ...
Mohammad Azad, Mikhail Moshkov
doaj +1 more source
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network.
Ozan İrsoy, Ethem Alpaydın
openaire +3 more sources
Optimization of decision trees using modified African buffalo algorithm
Decision tree induction is a simple, however powerful learning and classification tool to discover knowledge from the database. The volume of data in databases is growing to quite large sizes, both in the number of attributes and instances.
Archana R. Panhalkar, Dharmpal D. Doye
doaj +1 more source
Tree in Tree: from Decision Trees to Decision Graphs
Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional decision tree to a more generic and powerful directed acyclic graph.
Zhu, Bingzhao, Shoaran, Mahsa
openaire +2 more sources
FFTrees: A toolbox to create, visualize, and evaluate fast-and-frugal decision trees [PDF]
Fast-and-frugal trees (FFTs) are simple algorithms that facilitate efficient and accurate decisions based on limited information. But despite their successful use in many applied domains, there is no widely available toolbox that allows anyone to easily ...
Nathaniel D. Phillips +3 more
doaj +3 more sources

