Scalable parallel clustering approach for large data using genetic possibilistic fuzzy c-means algorithm

In various domains, big data play crucial and related processes because of the latest developments in the digital planet. Such irrepressible data growth has led to bring clustering algorithms to segment the data into small sets to perform associated processes with them. However, the challenge continues in dealing with large data, because most of the algorithms are compatible only with small data. However, the existing clustering algorithms either handle different data types with inefficiency in handling large data or handle large data with limitations in considering numeric attributes. Hence, parallel clustering has come into the picture to provide crucial contribution towards clustering large data. This insists the need of having scalable parallel clustering to solve the aforesaid problems. In this paper, we have developed a scalable parallel clustering algorithm called Possibilistic Fuzzy C-Means (PFCM) clustering to cluster large data. So, our ultimate aim is to design and develop an algorithm in parallel way by considering data. The parallel architecture includes, splitting the input data and clustering each set of data using PFCM. Then the genetic firefly algorithm applied to the merged cluster data, which will provide better clustering accuracy in merge data. The experimental analysis will be carried out to evaluate the feasibility of the scalable Possibilistic Fuzzy C-Means (PFCM) clustering approach. The experimental analysis showed that the proposed approach obtained upper head over existing method in terms of accuracy and time.