2017
DOI: 10.1016/j.ipl.2017.06.011
|View full text |Cite
|
Sign up to set email alerts
|

Decision tree classification with bounded number of errors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…The decision tree has several terms. Those terms are a root as the initial node, a leaf node as the child of a node, and the depth of a node as the length of the path between the nodes to the leaf node [27,28]. The first step is to discover graph process model of the event log based on the graph database.…”
Section: Methodsmentioning
confidence: 99%
“…The decision tree has several terms. Those terms are a root as the initial node, a leaf node as the child of a node, and the depth of a node as the length of the path between the nodes to the leaf node [27,28]. The first step is to discover graph process model of the event log based on the graph database.…”
Section: Methodsmentioning
confidence: 99%
“…Image classifiers of various sorts have been developed over the years using a variety of different methods such as decision trees [ 5 , 6 ], neural networks [ 7 , 8 ], or support vector machines [ 9 ]. Evolutionary algorithms have gained increased popularity for classification tasks [ 10 ] due to the simplicity with which fitness functions can be expressed, and also the variety of the expressions (linear, non-linear, tree-based, etc.).…”
Section: Introductionmentioning
confidence: 99%
“…Algorithms like chi‐squared automatic interaction detector and conditional inference trees() make DT one of most powerful and useful algorithm for data mining. The benefit of DT is that it can handle different types of input data such as numerical, alphabetical, and nominal …”
Section: Introductionmentioning
confidence: 99%
“…The algorithm for generating a DT for a given data set is fully described in the works of Saettler et al and California State University, Northridge…”
Section: Introductionmentioning
confidence: 99%