Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Big Data Clustering Method Based on an Improved PSO-Means Algorithm

View through CrossRef
There are problems in big data clustering processing, such as poor clustering effect of different types of data and long clustering time. Therefore, a big data clustering processing method based on the improved PSO-Means (Particle Swarm Optimization Means) algorithm is proposed. This method uses the particle swarm algorithm to determine the flight time and flight direction of the unit particle in a clustering process, pre-sets the selection range of the initial clustering center, and appropriately adjusts the inertia weight of the unit particle to eliminate the clustering defects caused by particle oscillation, and successfully obtains the clustering center based on large-scale data. Combined with the spanning tree algorithm, the PSO algorithm is optimized from two aspects: sample deviation and centroid skewness, and the optimized clustering center is input into the -means clustering algorithm to realize big data clustering processing. Experimental results show that the improved PSO-Means method can effectively cluster different types of data, and the clustering time is only 0.3 s, which verifies that this method has good clustering performance and clustering efficiency.
Title: Big Data Clustering Method Based on an Improved PSO-Means Algorithm
Description:
There are problems in big data clustering processing, such as poor clustering effect of different types of data and long clustering time.
Therefore, a big data clustering processing method based on the improved PSO-Means (Particle Swarm Optimization Means) algorithm is proposed.
This method uses the particle swarm algorithm to determine the flight time and flight direction of the unit particle in a clustering process, pre-sets the selection range of the initial clustering center, and appropriately adjusts the inertia weight of the unit particle to eliminate the clustering defects caused by particle oscillation, and successfully obtains the clustering center based on large-scale data.
Combined with the spanning tree algorithm, the PSO algorithm is optimized from two aspects: sample deviation and centroid skewness, and the optimized clustering center is input into the -means clustering algorithm to realize big data clustering processing.
Experimental results show that the improved PSO-Means method can effectively cluster different types of data, and the clustering time is only 0.
3 s, which verifies that this method has good clustering performance and clustering efficiency.

Related Results

Estimating PM10 Concentration from Drilling Operations in Open-Pit Mines Using an Assembly of SVR and PSO
Estimating PM10 Concentration from Drilling Operations in Open-Pit Mines Using an Assembly of SVR and PSO
Dust is one of the components causing heavy environmental pollution in open-pit mines, especially PM10. Some pathologies related to the lung, respiratory system, and occupational d...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
A Synchronous-Asynchronous Particle Swarm Optimisation Algorithm
A Synchronous-Asynchronous Particle Swarm Optimisation Algorithm
In the original particle swarm optimisation (PSO) algorithm, the particles’ velocities and positions are updated after the whole swarm performance is evaluated. This algorithm is a...
Reactive search-MST optimized clustering-based feature selection
Reactive search-MST optimized clustering-based feature selection
Data clustering is a technique for analyzing the data that is incurred in various fields such as data processing, pattern recognition, knowledge discovery and machine learning. Fea...
Convergence and Empirical Performance of Tanh-Based Adaptive Particle Swarm Optimization
Convergence and Empirical Performance of Tanh-Based Adaptive Particle Swarm Optimization
Particle Swarm Optimization (PSO) is a widely used population-based optimization method but faces challenges in premature convergence, leading to suboptimal solutions. To address t...
Intelligent Object Avoidance Method Design of Railroad Inspection Robot Based on Particle Swarm Algorithm
Intelligent Object Avoidance Method Design of Railroad Inspection Robot Based on Particle Swarm Algorithm
<p>In order to make the railroad inspection robot better adapt to its complex working environment, it is especially important to study the robot object avoidance algorithm. T...
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
Abstract The original K-means clustering algorithm is prone to local optima and sensitive to the initial clustering center, which have a great impact on accuracy and stabil...
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Data clustering is frequently utilized in the early stages of analyzing big data. It enables the examination of massive datasets encompassing diverse types of data, with the aim of...

Back to Top