Multi-objective Clustering Research Articles

Optimizing energy-efficient cluster head selection in wireless sensor networks using a binarized spiking neural network and honey badger algorithm

Wireless Sensor Networks (WSNs) play a vitalparton some applications, like environmental monitoring, healthcare, industrial automation. Optimizing the performance of WSN is essential to ensure efficient data delivery while conserving energy resources. This manuscript addresses the challenges of Multi-Objective Cluster Head Selection and Energy-Aware Routing in WSNs through the development of the Binarized Spiking Neural Network optimized with the Honey Badger Algorithm (EACHS-BzSpNNHBA-WSN). The appropriate cluster heads selection is vital for the overall presentation of WSNs, influencing data aggregation, routing, and energy consumption. Conventional approaches often struggle to balance the conflicting objectives of maximizing network lifetime, minimizing energy consumption, and ensuring timely data delivery. Therefore, there is a pressing need for innovative solutions capable of addressing these multi-objective optimization challenges. In this study, the EACHS-BzSpNNHBA-WSN framework is proposed, leveraging the computational power of Binarized Spiking Neural Networks and the optimization capabilities of the Honey Badger Algorithm to identify optimal cluster heads in WSNs. By formulating the cluster head selection as a multi-objective optimization problem, the aim is to achieve robust data delivery while minimizing energy consumption and extending the network lifetime. The proposed framework is implemented in MATLAB platform. The performance assessment is conducted using various metrics, including the number of active nodes, packet drop rate, energy consumption, network lifetime, delay, throughput, packet delivery ratio. Comparative analysis with existing models demonstrates the effectiveness of the EACHS-BzSpNNHBA-WSN approach.

Multi-Objective Automatic Clustering Algorithm Based on Evolutionary Multi-Tasking Optimization

Data mining technology is the process of extracting hidden knowledge and potentially useful information from a large number of incomplete, noisy, and random practical application data. The clustering algorithm based on multi-objective evolution has obvious advantages compared with the traditional single-objective method. In order to further improve the performance of evolutionary multi-objective clustering algorithms, this paper proposes a multi-objective automatic clustering model based on evolutionary multi-task optimization. Based on the multi-objective clustering algorithm that automatically determines the value of k, evolutionary multi-task optimization is introduced to deal with multiple clustering tasks simultaneously. A set of non-dominated solutions for clustering results is obtained by concurrently optimizing the overall deviation and connectivity index. Multi-task adjacency coding based on a locus adjacency graph was designed to encode the clustered data. Additionally, an evolutionary operator based on relevance learning was designed to facilitate the evolution of individuals within the population. It also facilitates information transfer between individuals with different tasks, effectively avoiding negative transfer. Finally, the proposed algorithm was applied to both artificial datasets and UCI datasets for testing. It was then compared with traditional clustering algorithms and other multi-objective clustering algorithms. The results verify the advantages of the proposed algorithm in clustering accuracy and algorithm convergence.

Optimized Multi-objective Clustering using Fuzzy Based Genetic Algorithm for Lifetime Maximization of WSN

Background: Wireless Sensor Networks (WSNs) have gained significant attention due to their diverse applications, including border area security, earthquake detection, and fire detection. WSNs utilize compact sensors to detect environmental events and transmit data to a Base Station (BS) for analysis. Energy consumption during data transmission is a critical issue, which has led to the exploration of additional energy-saving techniques, such as clustering. Objective: The primary objective is to propose an algorithm that selects optimal Cluster Heads (CHs) through a fuzzy-based genetic approach. This algorithm aims to address energy consumption concerns, enhance load balancing, and improve routing efficiency within WSNs. Methods: The proposed algorithm employs a fuzzy-based genetic approach to optimize the selection of CHs for data transmission. Four key parameters are considered: the average remaining energy of CHs, the average distance between CHs and the BS, the average distance between member nodes and CHs, and the standard deviation of the distance between member nodes and CHs. Results: The algorithm's effectiveness is demonstrated through simulation results. When compared to popular models like LEACH, MOEES, and FEEC, it demonstrates an 8-20% improvement in the lifetime of WSNs. The proposed approach achieves enhanced efficiency, lifetime extension, and improved performance in CH selection, load balancing, and routing. Conclusion: In conclusion, this study introduces a novel algorithm that utilizes fuzzy-based genetic techniques to optimize CH selection in WSNs. By considering four key parameters and addressing energy consumption challenges, the proposed algorithm offers significant improvements in efficiency, lifespan, and overall network performance, as validated through simulation results.

CHEABC-QCRP: A novel QoS-aware cluster routing protocol for industrial IoT

Clustering routing protocols currently have problems such as Single point of failure of cluster head nodes, poor network dynamics, uneven data transmission, etc., which are critical to the optimization of energy efficiency, network lifespan and network topology control. However, this optimization problem is an NP hard problem that conventional algorithms are difficult to solve. This paper proposes a new multi-objective cluster routing protocol (CHEABC-QCRP) aimed at optimizing network energy consumption, system lifespan, and quality of services (QoS). The protocol is based on a new chaotic hybrid elite artificial bee colony algorithm (CHEABC) proposed in this paper, which has strong search ability and greatly reduces convergence time. At the same time, a new chaotic strategy was designed to effectively prevent falling into local optima and premature convergence. In simulation experiments, compared with multiple routing protocols, a large number of test results show that this protocol significantly reduces network energy consumption, greatly improves system lifespan, and effectively improves QoS in IWSN.

CADC-FPRLE: Content-aware deduplication clustering analysis using file partitioning and a running length encoder for cloud storage optimization

To address this storage issue, we propose a Content-Aware Deduplication Clustering Analysis for Cloud Storage Optimization (CADC-FPRLE) based on a file partitioning running length encoder. At first, preprocessing was done by indexing, counting terms, cleansing, and tokenizing. Further multi-objective clustering points are analysed based on the bisecting divisible partition block, which divides a set of documents. The count terms are filtered from the divisible blocks and make up the count terms content block. Using Content-Aware Multi-Hash Ensemble Clustering (CAMH-EC) to group the similar blocks into clusters. This creates a high-dimensional Euclidean interval to create the number of clusters, and points are performed randomly to set the initial collection. Then, the Magnitude Vector Space Rate (MVSR) estimates the similarity distance between the groups to select the highest scatter value content for indexing. Finally, the Running Block Parity Encoder (RBPE) generates similarity parity in order to reduce the content to a redundant, singularized file in order to optimise storage. This implementation proves a higher level of storage optimization compared to the previous system than other methods.

Multi-Objective Optimization Technology for Building Energy-Saving Renovation Strategy Based on Genetic Algorithm

Building energy-saving design is significant for the industry to achieve carbon reduction and sustainable development. Firstly, a multi-objective model for energy consumption, cost, and carbon emissions is established based on the three-dimensional perspectives of society, nature, and economy. Then, a polynomial operator is used to improve the non dominated sorting genetic algorithm to calculate the optimal solution set. The low computational efficiency caused by direct coupling of algorithms in traditional optimization processes is expected to be addressed. According to the results, for the Square1 dataset and Iris dataset, the algorithm proposed in this study improved the reverse distance and convergence metrics by more than 70% compared to support vector machine-genetic algorithm and multi-objective clustering algorithm, with values closer to 0. The solution solved by this algorithm had lower building costs, energy consumption, and carbon emissions, with values of 345200 yuan, 2374 KWh/year, and 26 tons, respectively. This validates the effectiveness of the multi-objective model and solving algorithm established in the study, which helps to obtain the optimal energy-saving design scheme and provides reference for low-carbon optimization of building.

An Improved Evolutionary Multi-Objective Clustering Algorithm Based on Autoencoder

Evolutionary multi-objective clustering (EMOC) algorithms have gained popularity recently, as they can obtain a set of clustering solutions in a single run by optimizing multiple objectives. Particularly, in one type of EMOC algorithm, the number of clusters k is taken as one of the multiple objectives to obtain a set of clustering solutions with different k. However, the numbers of clusters k and other objectives are not always in conflict, so it is impossible to obtain the clustering solutions with all different k in a single run. Therefore, evolutionary multi-objective k-clustering (EMO-KC) has recently been proposed to ensure this conflict. However, EMO-KC could not obtain good clustering accuracy on high-dimensional datasets. Moreover, EMO-KC’s validity is not ensured as one of its objectives (SSDexp, which is transformed from the sum of squared distances (SSD)) could not be effectively optimized and it could not avoid invalid solutions in its initialization. In this paper, an improved evolutionary multi-objective clustering algorithm based on autoencoder (AE-IEMOKC) is proposed to improve the accuracy and ensure the validity of EMO-KC. The proposed AE-IEMOKC is established by combining an autoencoder with an improved version of EMO-KC (IEMO-KC) for better accuracy, where IEMO-KC is improved based on EMO-KC by proposing a scaling factor to help effectively optimize the objective of SSDexp and introducing a valid initialization to avoid the invalid solutions. Experimental results on several datasets demonstrate the accuracy and validity of AE-IEMOKC. The results of this paper may provide some useful information for other EMOC algorithms to improve accuracy and convergence.

Ensemble CART surrogate-assisted automatic multi-objective rough fuzzy clustering algorithm for unsupervised image segmentation

Multi-objective clustering algorithms (MOCAs) are popular in unsupervised image segmentation due to their merit of meeting multiple segmentation requirements and the prospect of automatically estimating the number of clusters. However, most of them suffer from high time costs and are easily to be influenced by the uncertainty when handling real complex images. To address these issues, we propose an ensemble classification and regression tree (CART) surrogate-assisted automatic multi-objective rough fuzzy clustering (ECS-AMRFC) algorithm for unsupervised image segmentation. Firstly, a cluster medoid-based encoding scheme is employed to represent solutions with different number of clusters and meanwhile lessen the length of encoding. Then, we design an ensemble CART as the surrogate model to significantly reduce the computational burden. Moreover, a surrogate model management strategy is proposed to accelerate the optimization and enhance the quality of surrogate modeling. To handle the uncertainty in data, we extend the rough fuzzy clustering into MOCAs and construct three complementary objective functions to seek proper cluster medoids from multiple perspectives. In addition, the Gaussian kernel is introduced into the objective functions to handle image pixels that cannot separate linearly in the feature space. Finally, a kernelized rough fuzzy clustering validity index is defined to automatically select the optimal solution with no requirements of any prior knowledge. Experiments show that ECS-AMRFC not only identifies appropriate number of clusters on different kinds of images, but also obtains better segmentation results than state-of-the-art rough fuzzy clustering algorithms and automatic MOCAs.

An adaptive evolutionary multi-objective clustering based on the data properties of the base partitions

Evolutionary multi-objective clustering (EMOC) is a modern clustering technique in which the general concepts of evolutionary multi-objective optimization are applied to the clustering problem. The design and definition of clustering are difficult problems, and the choice of the objective functions and parameter setting of the algorithms are still challenges. In this paper, we propose the adaptive evolutionary multi-objective clustering approach based on data properties (AEMOC). AEMOC considers a new metric to evaluate the base partitions (candidate solutions used in the initial population) generated by minimum spanning tree clustering. This metric is applied to: (1) determine properties of the data, such as separation and overlap; and (2) define an offline selection of objective functions and parameter settings of the multi-objective algorithm. The information regarding the data properties allows AEMOC to avoid unnecessary data processing in datasets in which the initialization provides optimal solutions and optimization is not required. AEMOC presented promising results considering a diverse set of artificial and real-life datasets, based on two aspects: (1) it succeeded in the determination of the data properties of the base partitions and verifying the potential clustering quality, presenting a correlation of 0.8 with a reference metric, and (2) it provided better clustering results than reference EMOC approaches, achieving a general gain in the clustering performance of 3% in real-life datasets and 7% in artificial datasets.

Human Activity Discovery With Automatic Multi-Objective Particle Swarm Optimization Clustering With Gaussian Mutation and Game Theory

Despite many advances in Human Activity Recognition (HAR), most existing works are conducted with supervision. Supervised methods rely on labeled training data. However, obtaining labeled data is difficult, costly, and time-consuming. In this paper, we introduce an automatic multi-objective particle swarm optimization clustering based on Gaussian mutation and game theory (MOPGMGT) to provide fully unsupervised human activity discovery. Furthermore, we map the multi-objective clustering problem to game theory to get the best optimal solution. The proposed algorithm can accurately find the number of activities without any prior knowledge. Multi-objective optimization problems typically cannot have a single optimal solution. We solve this problem by applying, Nash Equilibrium (NE) to the pareto front as the decision-making for choosing the best solution. NE does not just look for the best solution but tries to optimize the final solution by considering the effect of choosing each of the solutions as the best solution on the other solutions and one with the best impact is chosen. Moreover, a Gaussian mutation is applied on the pareto front to avoid premature convergence. As far as we know, this is the first time that human activity discovery is performed fully unsupervised, and a multi-objective PSO is mapped to the game theory space for finding the best solution. Experiments on six challenging human activity datasets demonstrate the capability of the proposed approach in achieving the best accuracy in human activity discovery and determining the optimal number of clusters. In comparison to well-known multi-objective algorithms, the MOPGMGT significantly improves the clustering outcomes on six benchmark clustering datasets.

An optimal energy utilization model for precision agriculture in WSNs using multi-objective clustering and deep learning

Wireless Sensor Networks (WSNs) play a crucial role in Precision Agriculture by providing real-time data on various environmental parameters like temperature, humidity, soil moisture, etc. However, the efficient utilization of energy in the sensor nodes of WSNs is a major challenge that needs to be addressed. To address this issue, a new multi-objective clustering approach is introduced in this work for grouping the sensor nodes of WSNs. Moreover, a multi-objective hybrid optimisation technique called Election based Aquila Optimizer (EAO) which is the combination of Aquila Optimizer (AO) and the Election-Based Optimisation Algorithm (EBOA) is proposed in this work to make sure that the Cluster Head (CH) selection process in WSNs to identify the best CH. In addition, the proposed method incorporates the newly developed optimization technique with convolutional neural network (CNN) as an Optimized CNN (O-CNN) to improve the clustering algorithm's precision and also enhance the training accuracy and testing accuracy. The proposed approach is evaluated through experiments and proved as better than other approaches by obtaining 99.23% as classification accuracy, 76.92% as throughput, 99% as packet delivery ratio, 98.24% as network lifetime and 50% as maximum energy consumption and it resolves a significant difficulty in precision agriculture.

EMCP: evolutionary multi-objective clustering protocol for prolonged lifetime of heterogeneous IoT networks

EMCP: evolutionary multi-objective clustering protocol for prolonged lifetime of heterogeneous IoT networks

Coordinated Trajectory Planning for Multiple Autonomous Underwater Vehicles: A Parallel Grey Wolf Optimizer

The utilization of unmanned systems has witnessed a steady surge in popularity owing to its tremendous potential for a wide range of applications. In particular, the coordination among multiple vehicle systems has been demonstrated to possess unparalleled efficacy in accomplishing intricate and diverse tasks. In light of this, the present paper delves into the coordinated path planning mission that is accomplished by collaborative efforts amongst multiple Autonomous Underwater Vehicles (AUVs). First, considering the potential threats, arrival time windows, space, and physical constraints for the AUVs, a sophisticated coordinated path planning model is formulated in a 3D environment, serving as a systematic and structured blueprint for the underlying mechanism. Subsequently, the optimization problem is addressed through the incorporation of a restricted initialization scheme and a multi-objective clustering strategy in the proposed methodology. The resulting approach leads to the development of the Parallel Grey Wolf Optimizer (P-GWO) which exhibits strong global searching abilities and a rapid convergence rate, rendering it a dependable and effective solution. The results demonstrate a 10–15% improvement in convergence rate and a reduction of over 60% in the average cost value compared to reliable references, thus presenting an effective solution for underwater missions with specific requirements.

Evolutionary Multiobjective Clustering Over Multiple Conflicting Data Views

Multi-view data analysis provides an effective means to integrate the distinct information sources which are inherent to many applications. Data clustering in a multi-view setting specifically aims to identify the most appropriate grouping for a collection of entities, where those entities (or their relationships) can be described from multiple perspectives. Leveraging recent advances in multi-objective clustering, we propose a new evolutionary method to tackle this challenge. Designed around a flexible and unbiased solution representation, together with strategies based on the minimum spanning tree and neighborhood relations, our algorithm optimizes multiple objectives simultaneously to effectively explore the space of candidate trade-offs between the data views. Through a series of experiments, we investigate the suitability of our proposal in the context of a bioinformatics application, clustering of plausible protein structures, and a diverse set of synthetic problems. The specific case of two data views is considered in this paper. The evaluation with respect to a variety of reference approaches demonstrates the effectiveness of our method in discovering high-quality partitions in a multiview setting. Robustness against unreliable data sources and the ability to automatically determine the number of clusters, are additional advantages evidenced by the results obtained.

Design of Log Analysis System Based on Multi-Object Clustering Algorithm

With the rapid development of the information age and the continuous expansion of data, all walks of life have begun to collect and analyze massive amounts of data to extract information that is valuable to them. Clustering technology in data mining is an important means of data analysis. Because different data sets have different distribution characteristics, traditional single-object clustering cannot adapt to the effective processing of different data sets, so multi-object clustering has gradually become a research hotspot. The purpose of this paper is the design of log analysis system based on a multi-objective clustering algorithm. This article first determines the main goals of the log analysis system and performs a detailed analysis of the system’s demanding functional analysis and demanding non-functionality respectively. The log analysis system is mainly divided into five modules for the detailed design of the log analysis system. After the system design is completed, various functional modules are completed through corresponding technologies, the entire log system is tested for attacks, and the system is further improved. Finally, the system can completely analyze the attack type through log analysis and carry out relevant early warnings to meet the needs of users. When the data set is 1.8MB, the convergence time of the K-medoid algorithm is 3678.49, and the convergence time of the algorithm in this paper is 2536.42. When the data reaches 165MB, the convergence time of the algorithm in this paper is 4326.28, and the convergence time of the K-medoid algorithm is 8184. This shows that as the scale of data continues to increase, the processing time difference changes and the processing speed of this algorithm has obvious advantages.

Harris Hawks Optimization-Based Clustering Algorithm for Vehicular Ad-Hoc Networks

Vehicular ad-hoc network (VANET) is highly dynamic due to the high speed and sparse distribution of vehicles on the road. This creates major challenges (e.g., network fragmentation, packet routing) for the researchers to enable robust, reliable, and scalable communication, especially in a highly dense network. Clustering in VANET is one of the remedies to address the scalability issue. However, it is observed in the literature, that existing clustering techniques produce a high number of clusters for the vehicular environment. Consequently, it increases the consumption of scarce resources in a wireless network. Furthermore, it also increases the communication overhead as well as the number of hops for data routing. As a result communication latency also increases and the reliability of communication protocol decreases. So it is highly desirable to find out the optimal clusters for a given vehicular environment. As finding optimal clusters is a multi-objective combinatorial optimization problem, therefore by employing nature-inspired meta-heuristic algorithms we can optimize the multi-objective problem. To this end, we proposed a novel clustering algorithm based on the Harris Hawks Optimization (HHO) algorithm for VANET (HHOCNET). HHO algorithm is a nature-inspired meta-heuristic algorithm inspired by the foraging maneuver of hawks called surprise pounce. The proposed framework imitates the cooperative foraging maneuver of hawks (i.e., surprise pounce for creating optimized vehicular clusters). The stochastic operators of the HHO algorithm and proper maintenance of the equilibrium state between the operations of exploration and exploitation enable the proposed algorithm to escape from the local optima and provide a globally optimal solution (i.e., the optimal number of vehicular clusters). Simulations are performed in MATLAB and the results are compared with the state-of-art schemes (i.e., Gray Wolf optimization-based clustering algorithm (GWOCNET), Multi-objective Particle Swarm Optimization (MO, PSO), and Comprehensive Learning Particle Swarm Optimization (CLPSO)) using different performance metrics. The results demonstrate that the proposed approach is an effective approach for clustering in VANET and outer performs the other benchmark algorithms in terms of optimizing the multi-objective clustering problem. HHOCNET algorithm selects 36.04% of nodes as cluster heads while the existing state-of-the-art schemes are providing 50.42%, 56.7%, and 60.89% for GWOCNET, CLPSO, and Multi-objective Particle Swarm Optimization (MOPSO). The proposed HHOCNET algorithm enhances the performance of the vehicular network by up to 15%. Consequently, it increases network efficiency by reducing the consumption of the required wireless resources. It also reduces the number of hops for packet routing. Hence it achieves a minimum end-to-end communication latency.

A reliable region information driven kriging-assisted multiobjective rough fuzzy clustering algorithm for color image segmentation

Multiobjective clustering algorithms (MOCAs) are becoming increasingly popular with the merit of segmenting images from multiple perspectives. The performances of MOCAs highly depend on their fitness functions. However, most existing MOCAs adopt one pair of complementary fitness functions, which always measure intra-class compactness and inter-class separation, respectively. This may result in insufficient ability to recognize and mine feature structures from complex images. Moreover, information within color images, such as region information and uncertain information, can barely receive enough attention in MOCAs. To resolve these problems, we propose a reliable region information driven Kriging-assisted multiobjective rough fuzzy clustering algorithm (RRI-KMRFC). Firstly, a reliability-based region information extraction strategy (RRIES) is designed to obtain reliable image information with satisfactory regional homogeneity and abundant image details. Secondly, the derived region information is used to construct three complementary fitness functions, focusing on rough intra-class compactness, rough inter-class separation, and regional consistency, respectively. Such fitness functions can effectively identify the clustering structure, maintain contour details, and characterize uncertain information from color images. To efficiently optimize the proposed functions, an incremental Kriging-assisted evolutionary framework is presented to decrease the expensive function evaluations in which an improved infill sampling strategy is devised to assist in finding unexplored areas in the decision space. Finally, a rough fuzzy clustering validity index with reliable region information is proposed to select the optimal trade-off solution. Experiments performed on Berkeley and Weizmann images confirm the effectiveness and robustness of RRI-KMRFC.

A novel raccoon optimization algorithm with multi-objective clustering strategy based routing protocol for WSNs

A novel raccoon optimization algorithm with multi-objective clustering strategy based routing protocol for WSNs

Multi-Objective Cluster Head-Based Energy-Aware Routing Protocol using Hybrid Woodpecker and Flamingo Search Optimization Algorithm for Internet of Things Environment

Internet of Things (IoT) plays a vital role in the world of Internet and integrates computing devices. The digital machines provide unique identifiers. The capacity to send data through the network using a better path is one of the capabilities of digital machines. IoT generates huge data based on fast aggregation data and processes these data efficiently. In this paper, a multi-objective hybrid woodpecker and flamingo search optimization algorithm is proposed for finding optimum Cluster Head (CH)-based energy-aware routing protocol in IoTs environment (Hyb-WFSOA-CHS-IoT). Here, the proposed Hyb-WFSOA-CHS-IoT model executes routing method through CH. The woodpecker and flamingo search optimization algorithm is used as the intelligent CH selection that consumes same energy as sensors. Hybrid woodpecker and flamingo search optimization algorithm (Hyb-WFSOA) is examined by using fitness functions, like distance, delay, energy consumption, throughput. The proposed Hyb-WFSOA-CHS-IoT method is activated in MATLAB software. Then, the performance of the proposed system is examined with different metrics, like delay, packet delivery ratio, throughput, network lifetime, energy consumption. Therefore, the proposed method attains lower delay 28.38%, 32.34% and 47.45%, higher delivery ratio 19.34%, 23.12% and 18.96% and lower energy consumption 11.25%, 7.90% and 12.88% compared with existing methods, like multi-objective fractional gravitational search algorithm for energy-efficient routing on IoT (FGSA-CHS-IoT), multi-objective sunflower-based gray wolf optimization algorithm for multiple path routing on IoT network (SFG-CHS-IoT) and energy-aware routing in the IoT with improved grasshopper metaheuristic algorithm with chaos theory and fuzzy Logic (FLGOA-CHS-IoT).

A Parallel Multiobjective PSO Weighted Average Clustering Algorithm Based on Apache Spark

Multiobjective clustering algorithm using particle swarm optimization has been applied successfully in some applications. However, existing algorithms are implemented on a single machine and cannot be directly parallelized on a cluster, which makes it difficult for existing algorithms to handle large-scale data. With the development of distributed parallel computing framework, data parallelism was proposed. However, the increase in parallelism will lead to the problem of unbalanced data distribution affecting the clustering effect. In this paper, we propose a parallel multiobjective PSO weighted average clustering algorithm based on apache Spark (Spark-MOPSO-Avg). First, the entire data set is divided into multiple partitions and cached in memory using the distributed parallel and memory-based computing of Apache Spark. The local fitness value of the particle is calculated in parallel according to the data in the partition. After the calculation is completed, only particle information is transmitted, and there is no need to transmit a large number of data objects between each node, reducing the communication of data in the network and thus effectively reducing the algorithm's running time. Second, a weighted average calculation of the local fitness values is performed to improve the problem of unbalanced data distribution affecting the results. Experimental results show that the Spark-MOPSO-Avg algorithm achieves lower information loss under data parallelism, losing about 1% to 9% accuracy, but can effectively reduce the algorithm time overhead. It shows good execution efficiency and parallel computing capability under the Spark distributed cluster.