Self-Tuning Parameters for Decision Tree Algorithm Based on Big Data Analytics

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Big data is usually unstructured, and many applications require the analysis in real-time. Decision tree (DT) algorithm is widely used to analyze big data. Selecting the optimal depth of DT is time-consuming process as it requires many iterations. In this paper, we have designed a modified version of a (DT). The tree aims to achieve optimal depth by self-tuning running parameters and improving the accuracy. The efficiency of the modified (DT) was verified using two datasets (airport and fire datasets). The airport dataset has 500000 instances and the fire dataset has 600000 instances. A comparison has been made between the modified (DT) and standard (DT) with results showing that the modified performs better. This comparison was conducted on multi-node on Apache Spark tool using Amazon web services. Resulting in accuracy with an increase of 6.85% for the first dataset and 8.85% for the airport dataset. In conclusion, the modified DT showed better accuracy in handling different-sized datasets compared to standard DT algorithm.

Cite

CITATION STYLE

APA

Hafez, M. M., Elfakharany, E. E. F., Abohany, A. A., & Thabet, M. (2023). Self-Tuning Parameters for Decision Tree Algorithm Based on Big Data Analytics. Computers, Materials and Continua, 75(1), 943–958. https://doi.org/10.32604/cmc.2023.034078

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free