2023
DOI: 10.1007/s10489-023-04779-y
|View full text |Cite
|
Sign up to set email alerts
|

An improved ID3 algorithm based on variable precision neighborhood rough sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2025
2025

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…These processes are repeated on each branch with the same class until a decision tree is formed. The need for calculating entropy and IG information in the ID3 algorithm is needed for feature selection based on the largest IG value as a splitter of the attributes [19].…”
Section: Data Modelling (Id3 C45 Cart)mentioning
confidence: 99%
“…These processes are repeated on each branch with the same class until a decision tree is formed. The need for calculating entropy and IG information in the ID3 algorithm is needed for feature selection based on the largest IG value as a splitter of the attributes [19].…”
Section: Data Modelling (Id3 C45 Cart)mentioning
confidence: 99%