Results 31 to 40 of about 137,982 (257)
Simplifying decision trees [PDF]
Many systems have been developed for constructing decision trees from collections of examples. Although the decision trees generated by these methods are accurate and efficient, they often suffer the disadvantage of excessive complexity and are therefore incomprehensible to experts.
openaire +1 more source
Design of Neuro-Fuzzy Decision Trees
In order to improve accuracy of fuzzy decision trees classification we propose a procedure of parameters adaptation by means of neural network training.
Abramova Tatyana
doaj +1 more source
Quantum Speedup Based on Classical Decision Trees [PDF]
Lin and Lin \cite{LL16} have recently shown how starting with a classical query algorithm (decision tree) for a function, we may find upper bounds on its quantum query complexity. More precisely, they have shown that given a decision tree for a function $
Salman Beigi, Leila Taghavi
doaj +1 more source
Licensed copy is available on IEEE ...
Manwani, N, Sastry, PS
openaire +3 more sources
Data-Driven EEG Band Discovery with Decision Trees
Electroencephalography (EEG) is a brain imaging technique in which electrodes are placed on the scalp. EEG signals are commonly decomposed into frequency bands called delta, theta, alpha, and beta.
Shawhin Talebi +4 more
doaj +1 more source
This study presents the methods employed by a team from the department of Mechatronics and Dynamics at the University of Paderborn, Germany for the 2013 PHM data challenge.
James K. Kimotho +3 more
doaj +1 more source
Omnivariate decision trees [PDF]
Univariate decision trees at each decision node consider the value of only one feature leading to axis-aligned splits. In a linear multivariate decision tree, each decision node divides the input space into two with a hyperplane. In a nonlinear multivariate tree, a multilayer perceptron at each node divides the input space arbitrarily, at the expense ...
Olcay Taner Yildiz, Ethem Alpaydin
openaire +2 more sources
Decision trees (DTs) epitomize what have become to be known as interpretable machine learning (ML) models. This is informally motivated by paths in DTs being often much smaller than the total number of features. This paper shows that in some settings DTs can hardly be deemed interpretable, with paths in a DT being arbitrarily larger than a PI ...
Yacine Izza +2 more
openaire +2 more sources
Fault Trees, Decision Trees, And Binary Decision Diagrams: A Systematic Comparison [PDF]
In reliability engineering, we need to understand system dependencies, cause-effect relations, identify critical components, and analyze how they trigger failures. Three prominent graph models commonly used for these purposes are fault trees (FTs), decision trees (DTs), and binary decision diagrams (BDDs). These models are popular because they are easy
Jimenez-Roa, L.A. +2 more
openaire +3 more sources
Learning Explainable Decision Rules via Maximum Satisfiability
Decision trees are a popular choice for providing explainable machine learning, since they make explicit how different features contribute towards the prediction.
Henrik E. C. Cao +2 more
doaj +1 more source

