Performance Optimization of Machine Learning Algorithms Based on Spark
Publié en ligne: 26 févr. 2024
Reçu: 08 janv. 2024
Accepté: 18 janv. 2024
DOI: https://doi.org/10.2478/amns-2024-0416
Mots clés
© 2024 Weikang Luo et al., published by Sciendo
This work is licensed under the Creative Commons Attribution 4.0 International License.
This paper proposes a performance optimization strategy for Spark-based machine learning algorithms in Shuffle and memory data management modules. The Shuffle module is optimized by introducing Observer monitoring module in Spark cluster to achieve task status monitoring and dynamic ShuffleWrite task generation. Meanwhile, an adaptive caching mechanism for RDD data addresses the lack of in-memory data caching. The performance-optimized algorithm performs well in the experiments, with a clustering accuracy of 89% and a response time that is 5% faster than the Random Forest algorithm. In road network traffic state discrimination, the optimized algorithm’s classification decision F-measure value is as high as 99.53%, which is 5.32% higher than that before unoptimization, and the running time is 767 seconds less than that of the unoptimized algorithm when dealing with about 6,880,000 pieces of data, which significantly improves the efficiency and accuracy.
