2017
DOI: 10.5120/ijca2017914286
|View full text |Cite
|
Sign up to set email alerts
|

The Analytical Comparison of ID3 and C4.5 using WEKA

Abstract: Data mining means to find out some useful information from a big warehouse of data and the process is aimed at unfolding old records and identifying novel patterns from the data. Data mining is used for classification and prediction. Many techniques and algorithms are available for mining the data. Out of many techniques, the decision tree is the simplest. This paper focuses on comparing the performance accuracy of ID3 and C4.5 techniques of the decision tree for predicting customer churn using WEKA. The data … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…The decision tree learning algorithm that would be studied in this paper is ID3 algorithm as it is the most commonly implement learning algorithm at the moment (Chen, Luo & Mu, 2009;Liu & Wang, 2010;Luo, Chen & Zhang, 2010). Quinlan invented the ID3 algorithm that also known as Iterative Dichotomiser 3 in 1986 (Liu & Xie, 2010;Nijhawan, Madan & Dave, 2017). Theoretically, ID3 algorithm function based on recursive partitioning which the training data would undergo splitting to become subsets and the particular subsets become the partitions that depict the decision tree (Begenova & Avdeenko, 2018a;Wu et al, 2006).…”
Section: Decision Tree: Id3 Algorithmmentioning
confidence: 99%
“…The decision tree learning algorithm that would be studied in this paper is ID3 algorithm as it is the most commonly implement learning algorithm at the moment (Chen, Luo & Mu, 2009;Liu & Wang, 2010;Luo, Chen & Zhang, 2010). Quinlan invented the ID3 algorithm that also known as Iterative Dichotomiser 3 in 1986 (Liu & Xie, 2010;Nijhawan, Madan & Dave, 2017). Theoretically, ID3 algorithm function based on recursive partitioning which the training data would undergo splitting to become subsets and the particular subsets become the partitions that depict the decision tree (Begenova & Avdeenko, 2018a;Wu et al, 2006).…”
Section: Decision Tree: Id3 Algorithmmentioning
confidence: 99%
“…This algorithm is only able to classify data with a range of discrete and limited features and is not efficient for noisy and distorted data. Completed C4.5 algorithm is ID3 algorithm [2][3][4]. This algorithm is also able to classify continuous and noisy data.…”
Section: C45 Algorithmmentioning
confidence: 99%
“…Many other researchers have researched on decision trees. Among them is a study comparing several methods about decision trees [6] [7]. Research using this decision tree method can be applied in many fields.…”
Section: B Related Workmentioning
confidence: 99%