2016
DOI: 10.1109/tst.2016.7536719
|View full text |Cite
|
Sign up to set email alerts
|

Taiga: performance optimization of the C4.5 decision tree construction algorithm

Abstract: Classification is an important machine learning problem, and decision tree construction algorithms are an important class of solutions to this problem. RainForest is a scalable way to implement decision tree construction algorithms. It consists of several algorithms, of which the best one is a hybrid between a traditional recursive implementation and an iterative implementation which uses more memory but involves less write operations. We propose an optimized algorithm inspired by RainForest. By using a more s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(17 citation statements)
references
References 12 publications
0
16
0
Order By: Relevance
“…First 10 results are shown in Table 3. It can be inferred that the RF model of station group is more accurate than SVR and C4.5 (decision tree using information gain as split criterion) [25], for it put less emphasis on temporality and output basing on different stations. SVR is not capable of the prediction of station group.…”
Section: ) Predictionmentioning
confidence: 99%
“…First 10 results are shown in Table 3. It can be inferred that the RF model of station group is more accurate than SVR and C4.5 (decision tree using information gain as split criterion) [25], for it put less emphasis on temporality and output basing on different stations. SVR is not capable of the prediction of station group.…”
Section: ) Predictionmentioning
confidence: 99%
“…The paper deals with decision tree algorithm [8]. Algorithm classifies map data into predefined group of class means data that may be …”
Section: Literature Surveymentioning
confidence: 99%
“…classified according to their gain entropy [8,9]. Then, higher weighted class goes on the root and then just lower than higher class further classified into another class [10,11].…”
Section: Ashish Modi Sharath Kumar J Muralidhar Amentioning
confidence: 99%
“…These data accurately reflect the actual purchase behavior of customers. Taking the actual marketing data of the enterprise as the training data sample collection for customer acquisition data mining, it can more accurately find the attribute characteristic of the target customer [9].…”
Section: Data Mining Modelmentioning
confidence: 99%