As an important data analysis method in data mining, clustering analysis has been researched extensively and in depth. Aiming at the limitation of -means clustering algorithm that it is sensitive to the distribution of initial clustering center, Glowworm Swarm Optimization (GSO) Algorithm is introduced to solve clustering problems. Firstly, this paper introduces the basic ideas of GSO algorithm, -means algorithm, and good-point set and analyzes the feasibility of combining them for clustering optimization. Next, it designs a clustering method of improved GSO algorithm based on good-point set which combines GSO algorithm and classical -means algorithm together, searches data object space, and provides initial clustering centers for -means algorithm by means of improved GSO algorithm and thus obtains better clustering results. Major improvement of GSO algorithm is to optimize the initial distribution of glowworm swarm by introducing the theory and method of good-point set. Finally, the new clustering algorithm is applied to UCI data sets of different categories and numbers for clustering test. The advantages of the improved clustering algorithm in terms of sum of squared errors (SSE), clustering accuracy, and robustness are explained through comparison and analysis.
17 October 2022 in Mathematical Problems in Engineering
Efficient emergency material dispatch, amid the aftermath of an emergency event, can help control the spread of the disaster and reduce disaster losses. Herewith, we propose a model with the urgency of material demand as the target coefficient, and the minimum load time and the minimum transportation cost as the total cost. For this model, an improved particle swarm optimization (PSO) algorithm is proposed as the means to optimize the initial positions of particles with good point sets and improve the convergence speed with adaptive dynamic weights to improve the optimization of the emergency material dispatch model. In order to verify the effectiveness of the proposed model and algorithm improvement strategy, the experimental results are verified by means of simulation experiments and algorithm comparison experiments, which show that the proposed emergency material dispatch model and the improved PSO algorithm cannot only solve the post-disaster relief material distribution and dispatching problem but also effectively reduce the total cost of emergency material dispatching.
The study focuses on developing a smart contract framework for the sharing of government big data in the context of “ckchain + government big data." The unique characteristics of government big data sharing are taken into consideration during the modeling process. The analysis of the smart contract's operational mechanism for "blockchain + government big data" sharing encompasses various aspects, including contract generation, deployment, and invocation. Furthermore, the research investigates the key challenges associated with cross-chain sharing of government big data. Building upon this analysis, the framework and operational mechanism of a smart contract for cross-chain sharing of government big data are examined within the specific scenario of cross-chain sharing. Consequently, valuable recommendations are proposed to facilitate the open sharing and controlled utilization of government big data within the blockchain context.
9 February 2021 in Mathematical Problems in Engineering
The main objective of this paper is to present a new clustering algorithm for metadata trees based on K-prototypes algorithm, GSO (glowworm swarm optimization) algorithm, and maximal frequent path (MFP). Metadata tree clustering includes computing the feature vector of the metadata tree and the feature vector clustering. Therefore, traditional data clustering methods are not suitable directly for metadata trees. As the main method to calculate eigenvectors, the MFP method also faces the difficulties of high computational complexity and loss of key information. Generally, the K-prototypes algorithm is suitable for clustering of mixed-attribute data such as feature vectors, but the K-prototypes algorithm is sensitive to the initial clustering center. Compared with other swarm intelligence algorithms, the GSO algorithm has more efficient global search advantages, which are suitable for solving multimodal problems and also useful to optimize the K-prototypes algorithm. To address the clustering of metadata tree structures in terms of clustering accuracy and high data dimension, this paper combines the GSO algorithm, K-prototypes algorithm, and MFP together to study and design a new metadata structure clustering method. Firstly, MFP is used to describe metadata tree features, and the key parameter of categorical data is introduced into the feature vector of MFP to improve the accuracy of the feature vector to describe the metadata tree; secondly, GSO is combined with K-prototypes to design GSOKP for clustering the feature vector that contains numeric data and categorical data so as to improve the clustering accuracy; finally, tests are conducted with a set of metadata trees. The experimental results show that the designed metadata tree clustering method GSOKP-FP has certain advantages in respect to clustering accuracy and time complexity.
Judgment matrix aggregation, as an important part of group decision-making, has been widely and deeply studied due to the universality and importance of group decision-making in the management field. For the variety of judgment matrix in group decision-making, the matrix aggregation result can be obtained by using the mode of glowworm swarm optimization. First, this paper introduces the basic principle of the glowworm swarm optimization (GSO) algorithm and gives the improved GSO algorithm to solve the matrix aggregation problems. In this approach, the consistency ratio is introduced to the objective function of the glowworm swarm optimization, thus reducing the subjectivity and information loss in the aggregation process. Then, the improved GSO algorithm is applied to the solution of the deterministic matrix and the fuzzy matrix. The method optimization can provide an effective and relatively uniform aggregation method for matrix aggregation. Finally, through comparative analysis, it is shown that the method of this paper has certain advantages in terms of adaptability, accuracy, and stability to solving the matrix aggregation problems.