Results 31 to 40 of about 3,746,451 (299)
Improved Random Forest Algorithm Based on Out-of-Bag Prediction and Extended Space [PDF]
Jisuanji gongcheng, 2022 On the basis of the bootstrap method, the random forest algorithm constructs a decision tree by using sampling characteristics.This reduces the correlation among decision trees at the expense of decision tree accuracy, thereby improving the prediction ...
CHANG Shuo, ZHANG Yanchun
doaj +1 more source
More Interpretable Decision Trees
, 2021 We present a new Decision Tree Classifier (DTC) induction algorithm that produces vastly more interpretable trees in many situations. These understandable trees are highly relevant for explainable artificial intelligence, fair automatic classification ...
René Hexel +5 more
core +1 more source
Design of Neuro-Fuzzy Decision Trees
MATEC Web of Conferences, 2016 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
Induction of decision trees [PDF]
Machine Learning, 1986 The technology for building knowledge-based systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail.
openaire +3 more sources
A mass assignment based ID3 algorithm for decision tree induction [PDF]
, 1997 A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to discretize continuous feature universes and to reduce complexity when universes are discrete but with large cardinalities ...
Baldwin, JF, Martin, TP, Lawry, J
core +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2012 Licensed copy is available on IEEE ...
Manwani, N, Sastry, PS
openaire +4 more sources
Quantum Speedup Based on Classical Decision Trees [PDF]
Quantum, 2020 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
, 2023 This is the repository of the paper titled "Bearing fault detection and recognition from supply currents with decision trees"; authors: Giovanni Briglia, Fabio Immovilli, Marco Cocconcelli and Marco ...
Giovanni Briglia
core +1 more source