Results 121 to 130 of about 4,693,052 (300)
This paper addresses the issue of the induction of orthogonal, oblique and multivariate decision trees. Algorithms proposed by other researchers use heuristic, usually based on the information gain concept, to induce decision trees greedily. These algorithms are often tailored for a given tree type ( e.g orthogonal), not being able to induce other ...
Llorà Fàbrega, Xavier+1 more
openaire +2 more sources
On Decision Trees, Influences, and Learning Monotone Decision Trees
In this note we prove that a monotone boolean function computable by a decision tree of size s has average sensitivity at most √ log2 s. As a consequence we show that monotone functions are learnable to constant accuracy under the uniform distribution in time polynomial in their decision tree size.
O'Donnell, Ryan, Servedio, Rocco Anthony
openaire +3 more sources
Herein, a comprehensive framework that enabled the optimization of colloidal solubility within a high‐dimensional parameter space and study of reversible assembly processes is developed. This data‐driven workflow integrated innovations including the robotic platform for automated AuNPs functionalization, machine learning for predicting and revealing ...
Yueyang Gao+5 more
wiley +1 more source
On Quantum Decision Trees [PDF]
Quantum decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished based on certain correlations in their states. This paper investigates some properties of the states obtained in a decision tree structure. How these correlations may be mapped to the decision tree
arxiv
From local explanations to global understanding with explainable AI for trees
Scott M. Lundberg+9 more
semanticscholar +1 more source
By integrating machine learning into flux‐regulated crystallization (FRC), accurate prediction of solvent evaporation rates in real time, improving crystallization control and reducing crystal growth variability by over threefold, is achieved. This enhances the reproducibility and quality of perovskite single crystals, leading to reproducible ...
Tatiane Pretto+8 more
wiley +1 more source
A composition theorem for decision tree complexity [PDF]
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
arxiv
MAPTree: Beating “Optimal” Decision Trees with Bayesian Decision Trees
Decision trees remain one of the most popular machine learning models today, largely due to their out-of-the-box performance and interpretability. In this work, we present a Bayesian approach to decision tree induction via maximum a posteriori inference of a posterior distribution over trees.
Sullivan, Colin+2 more
openaire +2 more sources
An Automated Approach to the Design of Decision Tree Classifiers [PDF]
P. Argentiero+2 more
openalex +1 more source