Research on Particle Swarm Optimization Clustering Algorithm for Big Data Based on Cloud Storage Environment

2021 ◽  
Author(s):  
Dan Liu
Keyword(s):  
Big Data ◽  
Particle Swarm Optimization ◽  
Cloud Storage ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Cloud Storage Environment

scholarly journals Parallel Computation Performingkernel-Based Clustering Algorithm Using Particle Swarm Optimization For The Big Data Analytics

2019 ◽  
Vol 8 (2) ◽  
pp. 4753-4756
Keyword(s):  
Big Data ◽  
Particle Swarm Optimization ◽  
Data Analysis ◽  
Parallel Computation ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Particle Swarm ◽  
Similarity Measures ◽  
Swarm Optimization ◽  
Non Linear

Digital data has been accelerating day by day with a bulk of dimensions. Analysis of such an immense quantity of data popularly termed as big data, which requires tremendous data analysis scalable techniques. Clustering is an appropriate tool for data analysis to observe hidden similar groups inside the data. Clustering distinct datasets involve both Linear Separable and Non-Linear Separable clustering algorithms by defining and measuring their inter-point similarities as well as non-linear similarity measures. Problem Statement: Yet there are many productive clustering algorithms to cluster linearly; they do not maintain quality clusters.Kernel-based algorithms make use of non-linear similarity measures to define similarity while forming clusters specifically with arbitrary shapes and frequencies. Existing System:Current Kernel-based clustering algorithms have few restraints concerning complexity, memory, and performance. Time and Memory will increase equally when the size of the dataset increase. It is challenging to elect kernel similarity function for different datasets. We have classical random sampling and low-rank matrix approximation linear clustering algorithms with high cluster quality and low memory essentials. Proposed work: in our research, we have introduced a parallel computation performing Kernel-based clustering algorithm using Particle Swarm Optimization approach. This methodology can cluster large datasets having maximum dimensional values accurately and overcomes the issues of high dimensional datasets.

scholarly journals Research on Big Data Digging of Hot Topics about Recycled Water Use on Micro-Blog Based on Particle Swarm Optimization

2018 ◽  
Vol 10 (7) ◽  
pp. 2488 ◽  
Author(s):  
Hanliang Fu ◽  
Zhaoxing Li ◽  
Zhijian Liu ◽  
Zelin Wang
Keyword(s):  
Big Data ◽  
Particle Swarm Optimization ◽  
Key Words ◽  
Water Use ◽  
Particle Swarm ◽  
Recycled Water ◽  
Swarm Optimization ◽  
The Public ◽  
Key Factor ◽  
Important Significance

The public’s acceptance level of recycled water use is a key factor that affects the popularization of this technology; therefore, it is critical to know the public’s attitude in order to make guiding policies effectively and scientifically. To examine the major focuses and hot topics among the public about recycled water use, one of the major platforms for social opinion in China, the micro blog, is used as a source to obtain data related to the topic. Through the “follow-be followed” and “forward-dialogue” behaviors, a network of discussion of recycled water use among micro-blog users has been constructed. Improved particle swarm optimization has been used to allow deep digging for key words. Ultimately, key words about the topic of have been clustered into three categories, namely, the popularization status of recycled water use, the main application, and the public’s attitude. The conclusion accurately describes the concerns of Chinese citizens regarding recycled water use, and has important significance for the popularization of this technology.

scholarly journals Memetic Variable Clustering and Its Application

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
JiaCheng Ni ◽  
Li Li
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Experimental Result ◽  
Swarm Optimization ◽  
Metaheuristic Optimization ◽  
Variable Clustering

Clustering analysis is an important and difficult task in data mining and big data analysis. Although being a widely used clustering analysis technique, variable clustering did not get enough attention in previous studies. Inspired by the metaheuristic optimization techniques developed for clustering data items, we try to overcome the main shortcoming of k-means-based variable clustering algorithm, which is being sensitive to initial centroids by introducing the metaheuristic optimization. A novel memetic algorithm named MCLPSO (Memetic Comprehensive Learning Particle Swarm Optimization) based on CLPSO (Comprehensive Learning Particle Swarm Optimization) has been studied under the framework of memetic computing in our previous work. In this work, MCLPSO is used as a metaheuristic approach to improve the k-means-based variable clustering algorithm by adjusting the initial centroids iteratively to maximize the homogeneity of the clustering results. In MCLPSO, a chaotic local search operator is used and a simulated annealing- (SA-) based local search strategy is developed by combining the cognition-only PSO model with SA. The adaptive memetic strategy can enable the stagnant particles which cannot be improved by the comprehensive learning strategy to escape from the local optima and enable some elite particles to give fine-grained local search around the promising regions. The experimental result demonstrates a good performance of MCLPSO in optimizing the variable clustering criterion on several datasets compared with the original variable clustering method. Finally, for practical use, we also developed a web-based interactive software platform for the proposed approach and give a practical case study—analyzing the performance of semiconductor manufacturing system to demonstrate the usage.

Sign in / Sign up

Export Citation Format

Share Document