2018 22nd International Computer Science and Engineering Conference (ICSEC) 2018
DOI: 10.1109/icsec.2018.8712788
|View full text |Cite
|
Sign up to set email alerts
|

Reducing the Depth of ID3 Algorithm by Combining Values from Neighboring Important Attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The decision tree technique is widely used in data analysis and prediction [14][15][16][17][18][19][20][21]. For example, in [16], the C4.5 decision tree algorithm is applied to achieve precision marketing prediction.…”
Section: Decision Tree-based Classificationmentioning
confidence: 99%
See 1 more Smart Citation
“…The decision tree technique is widely used in data analysis and prediction [14][15][16][17][18][19][20][21]. For example, in [16], the C4.5 decision tree algorithm is applied to achieve precision marketing prediction.…”
Section: Decision Tree-based Classificationmentioning
confidence: 99%
“…A service decision tree-based post-pruning prediction approach is proposed to classify the services into the corresponding reliability level after discretizing the continuous attribute of services in service-oriented computing [18]. The ID3 is one of the standard algorithms for the decision tree learning process, which calculates the entropy to select the condition attributes [19][20][21].…”
Section: Decision Tree-based Classificationmentioning
confidence: 99%