Hybrid Optimization Algorithm for Providing Big Data Classification

  • M. Kavitha Margret, S. Siamala Devi, E. GoldenJulie, D. Vijayanandh, Y. Harold Robinson,

Abstract

The larger amount of databases is required classification for providing efficiency in big data applications. The parallel computing approach utilizes the classification whenever the uncertainty occurs in big data. The information entropy causes through the partitioning issues while compressing the data to a restricted amount of memory. The computational time is high in the process of iterations in to big data classification and the available division in the big data reduces the threshold level. The randomly assigned classification involves the identification of the optimal path for every attribute. The computation of information gain for every attribute will enhance the computation time. The optimization based scheduling will reduce the computation time. The hybrid optimization algorithm uses to obtain the optimal path with attribute based randomly assigned and scheduling process. The experimental results show that the proposed technique has the enhanced optimization compared with the other techniques.

Published
2020-05-19
How to Cite
M. Kavitha Margret, S. Siamala Devi, E. GoldenJulie, D. Vijayanandh, Y. Harold Robinson,. (2020). Hybrid Optimization Algorithm for Providing Big Data Classification. International Journal of Advanced Science and Technology, 29(9s), 4150 - 4155. Retrieved from https://sersc.org/journals/index.php/IJAST/article/view/16780