Neelam Singh
Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun, Uttarakhand, India.

Devesh Pratap Singh
Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun, Uttarakhand, India.

Bhasker Pant
Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun, Uttarakhand, India.

DOI https://dx.doi.org/10.33889/IJMEMS.2019.4.5-098

  ;

Abstract

Big Data is rapidly gaining impetus and is attracting a community of researchers and organization from varying sectors due to its tremendous potential. Big Data is considered as a prospective raw material to acquire domain specific knowledge to gain insights related to management, planning, forecasting and security etc. Due to its inherent characteristics like capacity, swiftness, genuineness and diversity Big Data hampers the efficiency and effectiveness of search and leads to optimization problems. In this paper we explore the complexity imposed by big search spaces leading to optimization issues. In order to overcome the above mentioned issues we propose a hybrid algorithm for Big Data preprocessing ACO-clustering algorithm approach. The proposed algorithm can help to increase search speed by optimizing the process. As the proposed method using ant colony optimization with clustering algorithm it will also contribute to reducing pre-processing time and increasing analytical accuracy and efficiency.

Keywords- Big Data, ACO, Clustering, Optimization, Preprocessing.

Citation

Singh, N., Singh, D. P., & Pant, B. (2019). ACOCA: Ant Colony Optimization Based Clustering Algorithm for Big Data Preprocessing. International Journal of Mathematical, Engineering and Management Sciences, 4(5), 1239-1250. https://dx.doi.org/10.33889/IJMEMS.2019.4.5-098.