Affinity Propagation Clustering Research Articles

Improvement of PBFT Consensus Algorithm Based on Affinity Propagation Clustering in Intellectual Property Transaction Scenarios

In response to the problems of random selection of primary nodes, high communication complexity, and low consensus efficiency in the current consensus mechanism for intellectual property transactions, a Practical Byzantine Fault Tolerance (PBFT) consensus algorithm based on the Affinity-Propagation (AP) clustering algorithm, termed AP-PBFT, is proposed. Firstly, the election strategy of the leader node is constructed based on the reputation mechanism; the reward and punishment mechanism is designed to achieve the dynamic adjustment of the reputation value of the nodes in the PBFT consensus process, and the number of votes among the nodes is introduced to determine the node’s reputation value in collaboration with the reward and punishment mechanism to guarantee the precise ordering of the nodes. Secondly, nodes with high reputation values are selected as cluster centers to run the AP clustering algorithm, and clustering groups of knowledge property transaction nodes are constructed based on responsibility and availability. Finally, the three-stage consensus process of the PBFT consensus algorithm is optimized, and the consensus task is decomposed into two layers: the intra-consensus group and the inter-leader node group, reducing the communication complexity of transaction data in the blockchain. Experimental findings indicate a significant performance improvement of the algorithm over the PBFT consensus algorithm in communication complexity, throughput, and consensus efficiency in the simulation environment of multiple types of transactions in intellectual property transactions, including different types of large-scale transaction scenarios, such as purchases, sales, licenses, and transfers.

Demystifying COVID-19 mortality causes with interpretable data mining

While COVID-19 becomes periodical, old individuals remain vulnerable to severe disease with high mortality. Although there have been some studies on revealing different risk factors affecting the death of COVID-19 patients, researchers rarely provide a comprehensive analysis to reveal the relationships and interactive effects of the risk factors of COVID-19 mortality, especially in the elderly. Through retrospectively including 1917 COVID-19 patients (102 were dead) admitted to Xiangya Hospital from December 2022 to March 2023, we used the association rule mining method to identify the risk factors leading causes of death among the elderly. Firstly, we used the Affinity Propagation clustering to extract key features from the dataset. Then, we applied the Apriori Algorithm to obtain 6 groups of abnormal feature combinations with significant increments in mortality rate. The results showed a relationship between the number of abnormal feature combinations and mortality rates within different groups. Patients with “C-reactive protein > 8 mg/L”, “neutrophils percentage > 75.0 %”, “lymphocytes percentage < 20%”, and “albumin < 40 g/L” have a 2×\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ imes$$\\end{document} mortality rate than the basic one. When the characteristics of “D-dimer > 0.5 mg/L” and “WBC > 9.5×109\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$9.5 \ imes 10^9$$\\end{document} /L” are continuously included in this foundation, the mortality rate can be increased to 3×\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ imes$$\\end{document} or 4×\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ imes$$\\end{document}. In addition, we also found that liver and kidney diseases significantly affect patient mortality, and the mortality rate can be as high as 100%. These findings can support auxiliary diagnosis and treatment to facilitate early intervention in patients, thereby reducing patient mortality.

PV Power Forecasting in the Hexi Region of Gansu Province Based on AP Clustering and LSTNet

Accurate PV power forecasting is becoming a mandatory task to integrate the PV system into the power grid, schedule it, and ensure the safety of the power grid. In this paper, a novel model for PV power prediction using AP-LSTNet has been proposed. It consists of a combination of affinity propagation clustering and long-term and short-term time series network models. First, the affinity propagation algorithm is used to divide the regionally distributed photovoltaic station clusters into different seasons. The Pearson correlation coefficient is used to determine the strong correlation between meteorological factors of photovoltaic power, and the bilinear interpolation method is used to encrypt the meteorological data of the corresponding photovoltaic station cluster. Furthermore, LSTNet is used to mine the long-term and short-term temporal and spatial dependence of photovoltaic power, and meteorological factor series and linear components of auto-regression are superimposed to realize the simultaneous prediction of multiple photovoltaic stations in the group. Finally, PV power plants in five cities, Wuwei, Jinchang, Zhangye, Jiuquan, and Jiayuguan in the Hexi region of Gansu Province, China, will be selected to test the proposed model. The experimental comparison shows that the prediction model achieves high prediction accuracy and robustness.

Comparison of K-Means, Affinity Clustering, and Mini Batch K-Means Algorithms for Market Segmentation Analysis

Market segmentation is the process of dividing a market into homogeneous groups of buyers based on certain characteristics. Market segmentation is important for businesses to understand the needs and behaviors of their customers so that they can develop more effective marketing strategies.This study compares three clustering methods, namely K-Means Clustering, Affinity Propagation Clustering, and Mini Batch K-Means, in the context of market segmentation analysis. The data used is the marketing_campaign.csv dataset consisting of 29 columns and 2240 rows. Experiments were conducted to evaluate the performance of the three methods using the silhouette metric. The results of the experiments showed that Affinity Propagation produced the highest silhouette value of 0.5861, followed by K-Means with 0.4675, and Mini Batch K-Means with 0.4659. The finding indicates that Affinity Propagation can be a good choice for market segmentation analysis on that dataset. The results of this comparison provide insights into the strengths and weaknesses of each clustering method, helping users choose the approach that is most appropriate for their analytical goals. The study contributes to the practical understanding of the application of clustering techniques in the context of marketing.

Optical fiber sensing and tensor AP clustering for high-speed road tunnel vehicle detection

Aiming at the problems of signal acquisition, feature extraction and vehicle recognition in highway tunnel vehicle detection, a new tunnel vehicle detection method is proposed by combining optical time-domain reflectometry distributed fiber sensing technology and tensor affine propagation clustering algorithm. Firstly, the distributed optical fiber system designed by optical time domain reflectometry was used to collect the running signals of tunnel vehicles and obtain the measurement data. Secondly, a high-order tensor sample set is constructed by using the spatial resolution of optical fiber as channel number and combining the feature number, time domain and frequency domain. Finally, tensor affine propagation clustering method and other clustering methods are used to test the accuracy. The test results show that the proposed method can better classify vehicles without destroying the original high-dimensional data structure. Meanwhile, the unsupervised clustering algorithm also reduces manual intervention in the identification process, increases the intelligence level of the whole vehicle detection model, and effectively improves the detection accuracy rate of tunnel vehicles.

AP-GAN-DNN based creep fracture life prediction for 7050 aluminum alloy

7050 aluminum alloy has high strength and excellent fracture toughness. However, damage can be caused to the 7050 aluminum alloy by creep at elevated temperatures. The accuracy of conventional creep life prediction methods may fall short of meeting the desired standards. And the application of machine learning (ML) methods is limited due to the scarcity and dispersion of creep sample data. Generative Adversarial Networks (GAN) are often used for data enhancement, but suffer from “pattern collapse” under small sample conditions. To solve the above problems, this paper proposes a creep fracture life prediction method, which combines the affinity propagation (AP) clustering algorithm, GAN, and deep neural networks (DNN) for accurate creep fracture life prediction. The AP clustering algorithm for adaptive clustering was utilized to better reflect the creep sample distribution. Independent GAN models were trained for each cluster to better capture distribution characteristics of the data and generate synthetic data that was highly similar to the real data. The DNN models were trained using the synthetic data and then predicted using real creep fracture life data. The presented method was compared with traditional physical and machine learning methods, and the method combining K-Means, GAN, and DNN. The experimental results show that the method proposed in this paper has better prediction accuracy in a small sample creep fracture life dataset.

Order Distribution and Routing Optimization for Takeout Delivery under Drone–Rider Joint Delivery Mode

Order distribution and routing optimization of takeout delivery is a challenging research topic in the field of e-commerce. In this paper, we propose a drone–rider joint delivery mode with multi-distribution center collaboration for the problems of limited-service range, unreasonable distribution, high delivery cost, and tight time windows in the takeout delivery process. The model is constructed with the minimum delivery cost and the overall maximum customer satisfaction as the objective function, and a two-stage heuristic algorithm is designed to solve the model. In the first stage, Euclidean distance is used to classify customers into the regions belonging to different distribution centers, and the affinity propagation (AP) clustering algorithm is applied to allocate orders from different distribution centers. The second stage uses an improved tabu search algorithm for route optimization based on specifying the number of rider and drone calls. This paper takes China’s Ele.me and Meituan takeout as the reference object and uses the Solomon data set for research. The experimental results show that compared with the traditional rider delivery mode, the drone–rider joint delivery mode with multiple distribution center collaboration can effectively reduce the number of riders used, lower the delivery cost, and improve the overall customer satisfaction.

Improved Fingerprint-Based Localization Based on Sequential Hybridization of Clustering Algorithms

The localization accuracy of a fingerprint-based localization system is dependent on several factors, one of which is the accuracy and efficiency at which the fingerprint database is clustered. Most highly efficient and accurate clustering algorithms have high time-dependent computational complexity (CC), which tends to limit their practical applicability. A technique that has yet to be explored is the sequential hybridization of multiple low-time CC clustering algorithms to produce a single moderate-time CC clustering algorithm with high localization accuracy. As a result, this paper proposes a clustering algorithm with a moderate time CC that is based on the sequential hybridization of the closest access point (CAP) and improved k-means clustering algorithms. The performance of the proposed sequential hybrid clustering algorithm is determined and compared to the modified affinity propagation clustering (m-APC), fuzzy c-mean (FCM), and 2-CAP algorithms presented in earlier research works using four experimentally generated and publicly available fingerprint databases. The performance metrics considered for the comparisons are the position root mean square error (RMSE) and clustering time based on big O notation. The simulation results show that the proposed sequential hybrid clustering algorithm has improved localization accuracy with position RMSEs of about 54%, 77%, and 52%, respectively, higher than those of the m-APC, FCM, and 2-CAP algorithms. In terms of clustering time, it is 99% and 79% faster than the m-APC and FCM algorithms, respectively, but 90% slower than the 2-CAP algorithm. The results have shown that it is possible to develop a clustering algorithm that has a moderate clustering time with very high localization accuracy through sequential hybridization of multiple clustering algorithms that have a low clustering time with poor localization accuracy. Doi: 10.28991/ESJ-2024-08-02-02 Full Text: PDF

An improved differential evolution algorithm for multi-modal multi-objective optimization.

Multi-modal multi-objective problems (MMOPs) have gained much attention during the last decade. These problems have two or more global or local Pareto optimal sets (PSs), some of which map to the same Pareto front (PF). This article presents a new affinity propagation clustering (APC) method based on the Multi-modal multi-objective differential evolution (MMODE) algorithm, called MMODE_AP, for the suit of CEC'2020 benchmark functions. First, two adaptive mutation strategies are adopted to balance exploration and exploitation and improve the diversity in the evolution process. Then, the affinity propagation clustering method is adopted to define the crowding degree in decision space (DS) and objective space (OS). Meanwhile, the non-dominated sorting scheme incorporates a particular crowding distance to truncate the population during the environmental selection process, which can obtain well-distributed solutions in both DS and OS. Moreover, the local PF membership of the solution is defined, and a predefined parameter is introduced to maintain of the local PSs and solutions around the global PS. Finally, the proposed algorithm is implemented on the suit of CEC'2020 benchmark functions for comparison with some MMODE algorithms. According to the experimental study results, the proposed MMODE_AP algorithm has about 20 better performance results on benchmark functions compared to its competitors in terms of reciprocal of Pareto sets proximity (rPSP), inverted generational distances (IGD) in the decision (IGDX) and objective (IGDF). The proposed algorithm can efficiently achieve the two goals, i.e., the convergence to the true local and global Pareto fronts along with better distributed Pareto solutions on the Pareto fronts.

Optimization of Clustering and Trajectory for Minimizing Age of Information in Unmanned Aerial Vehicle-Assisted Mobile Edge Computing Network.

With the development of the Internet of Things (IoT) technology, massive amounts of sensor data in applications such as fire monitoring need to be transmitted to edge servers for timely processing. However, there is an energy-hole phenomenon in transmitting data only through terrestrial multi-hop networks. In this study, we focus on the data collection task in an unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) network, where a UAV is deployed as the mobile data collector for the ground sensor nodes (SNs) to ensure high information freshness. Meanwhile, the UAV is equipped with an edge server for data caching. We first establish a rigorous mathematical model in which the age of information (AoI) is used as a measure of information freshness, related to both the data collection time and the UAV's flight time. Then a mixed-integer non-convex optimization problem is formulated to minimize the peak AoI of the collected data. To solve the problem efficiently, we propose an iterative two-step algorithm named the AoI-minimized association and trajectory planning (AoI-MATP) algorithm. In each iteration, the optimal SN-collection point (CP) associations and CP locations for the parameter ε are first obtained by the affinity propagation clustering algorithm. The optimal UAV trajectory is found using an improved elite genetic algorithm. Simulation results show that based on the optimized ε, the AoI-MATP algorithm can achieve a balance between data collection time and flight time, reducing the peak AoI of the collected data.

A clustering effectiveness measurement model based on merging similar clusters.

This article presents a clustering effectiveness measurement model based on merging similar clusters to address the problems experienced by the affinity propagation (AP) algorithm in the clustering process, such as excessive local clustering, low accuracy, and invalid clustering evaluation results that occur due to the lack of variety in some internal evaluation indices when the proportion of clusters is very high. First, depending upon the "rough clustering" process of the AP clustering algorithm, similar clusters are merged according to the relationship between the similarity between any two clusters and the average inter-cluster similarity in the entire sample set to decrease the maximum number of clusters Kmax. Then, a new scheme is proposed to calculate intra-cluster compactness, inter-cluster relative density, and inter-cluster overlap coefficient. On the basis of this new method, several internal evaluation indices based on intra-cluster cohesion and inter-cluster dispersion are designed. Results of experiments show that the proposed model can perform clustering and classification correctly and provide accurate ranges for clustering using public UCI and NSL-KDD datasets, and it is significantly superior to the three improved clustering algorithms compared with it in terms of intrusion detection indices such as detection rate and false positive rate (FPR).

Multi-exemplar affinity propagation clustering based on local density peak

Multi-exemplar affinity propagation clustering based on local density peak

Accuracy Measurement of Hyperspectral Image Classification in Remote Sensing with the Light Spectrum-based Affinity Propagation Clustering-based Segmentation

The area of remote sensing and computer vision includes the challenge of hyperspectral image classification. It entails grouping pixels in hyperspectral pictures into several classes according to their spectral signature. Hyperspectral photographs are helpful for a variety of applications, including vegetation study, mineral mapping, and mapping urban land use, since they include information on an object's reflectance in hundreds of small, contiguous wavelength bands. This task's objective is to correctly identify and categorize several item categories in the image. Many approaches have been stated by several researchers in this field to enhance the accuracy of the segmentation and accuracy. However, fails to attain the optimal accuracy due to the intricate nature of the images. To tackle these issues, we propose a novel Modified Extreme Learning machine (M-ELM) approach for the credible hyperspectral image classification outcomes with the publicly available Kaggle datasets. Before the classification, the input images are segmented using the Light Spectrum-based modified affinity propagation clustering technique (LSO-MAPC). In the beginning, the images are pre-processed using the non-linear diffusion partial differential equations technique which effectively pre-processed the image spatially. Experiments are effectuated to analyze the performance of the proposed method and compared it with state-of-art works in a quantitative way. The proposed approach ensures a classification accuracy of 96%.

Analysis of GC × GC fingerprints from medicinal materials using a novel contour detection algorithm: A case of Curcuma wenyujin

This study introduces an innovative contour detection algorithm, PeakCET, designed for rapid and efficient analysis of natural product image fingerprints using comprehensive two-dimensional gas chromatogram (GC × GC). This method innovatively combines contour edge tracking with affinity propagation (AP) clustering for peak detection in GC × GC fingerprints, the first in this field. Contour edge tracking significantly reduces false positives caused by “burr” signals, while AP clustering enhances detection accuracy in the face of false negatives. The efficacy of this approach is demonstrated using three medicinal products derived from Curcuma wenyujin. PeakCET not only performs contour detection but also employs inter-group peak matching and peak-volume percentage calculations to assess the compositional similarities and differences among various samples. Furthermore, this algorithm compares the GC × GC fingerprints of Radix/Rhizoma Curcumae Wenyujin with those of products from different botanical origins. The findings reveal that genetic and geographical factors influence the accumulation of secondary metabolites in various plant tissues. Each sample exhibits unique characteristic components alongside common ones, and variations in content may influence their therapeutic effectiveness. This research establishes a foundational data-set for the quality assessment of Curcuma products and paves the way for the application of computer vision techniques in two-dimensional (2D) fingerprint analysis of GC × GC data.

Mel-frequency cepstral coefficients outperform embeddings from pre-trained convolutional neural networks under noisy conditions for discrimination tasks of individual gibbons

Passive acoustic monitoring – an approach that utilizes autonomous acoustic recording units – allows for non-invasive monitoring of individuals, assuming that it is possible to acoustically distinguish individuals. However, identifying effective analytical approaches for individual identification remains a challenge. Our study investigates how the use of different feature representations impacts our ability to distinguish between individual female Northern grey gibbons (Hylobates funereus). We broadcast pre-recorded calls from twelve gibbon females and re-recorded the calls at varying distances (directly under the tree to ∼400 m away) using autonomous recording units. We evaluated the effectiveness of using different automated feature extraction approaches to classify gibbon calls: Mel-frequency cepstral coefficients (MFCCs), embeddings from three pre-trained neural networks (BirdNET, VGGish, and Wav2Vec2), and four commonly used acoustic indices. We used a supervised classification approach (random forest) to classify calls to the respective female and compared two unsupervised clustering approaches (affinity propagation clustering and hierarchical density-based spatial clustering) to evaluate which features were most effective for distinguishing female calls without using class labels. We used MFCCs as a baseline as previous work has shown they can be used to distinguish high-quality calls of individual gibbon females. Human annotators could only identify calls in spectrograms from recordings <350 m from the playback speaker with signal-to-noise ratio ∼ 0 dB, so our results focus on these recordings. Using supervised classification, our results confirmed the efficiency of MFCCs and the use of embeddings from one neural network (BirdNET) for effective acoustic classification of gibbon individuals at closer recording distances (signal-to-noise ratio > 10 dB), while the remaining features did not perform well. Contrary to our expectations, we found that MFCCs outperformed all other features for the unsupervised clustering tasks at closer distances and none of the features performed well at farther distances. The ability to acoustically discriminate animals under noisy conditions and from low signal-to-noise ratio calls has important implications for monitoring populations of endangered animals, such as gibbons. Focusing only on high signal-to-noise ratio calls for individual discrimination may not be possible for rare sounds, and future work should focus on developing effective approaches of feature extraction that can perform well across noisy, real-world conditions with a limited number of training samples.

Research on personalized short video push on social media platforms based on affinity propagation clustering

Research on personalized short video push on social media platforms based on affinity propagation clustering

HRCL: Hierarchical Relation Contrastive Learning for Low-Resource Relation Extraction.

Low-resource relation extraction (LRE) aims to extract the relationships between given entities from natural language sentences in low-resource application scenarios, which has been an incredibly challenging task due to the limited annotated corpora. Existing studies either leverage self-training schemes to expand the scale of labeled data, while the error accumulation of pseudo-labels' selection bias provoke the gradual drift problem in subsequent relation prediction, or utilize the instance-wise contrastive learning that fails to distinguish those sentence pairs with similar semantics. To alleviate these defects, this article introduces a novel contrastive learning framework called hierarchical relation contrastive learning (HRCL) for LRE. HRCL leverages task-related instruction description and schema-constrained as prompts to generate high-level relation representations. To enhance the efficacy of contrastive learning, we further employ hierarchical affinity propagation clustering (HiPC) to derive hierarchical signals from relational feature space with a hierarchy cross-attention (HCA) mechanism and effectively optimize pair-level relation features through relation-wise contrastive learning. Exhaustive experiments have been conducted on five public relation extraction (RE) datasets in low-resource settings. The results demonstrate the effectiveness and robustness of HRCL and outperform the current state-of-the-art (SOTA) model by 6.56% on average in terms of B3F1 . Our source code is publicly available at https://github.com/Phevos75/HRCLRE.

A large-scale group decision-making method based on improved affinity propagation algorithm and adjustable minimum-cost consensus model in social networks

The rapid development of information technology has made social network large-scale group decision-making (SN-LSGDM) a focus of the field of decision science. Clustering and consensus-reaching process (CRP) are widely used methods in SN-LSGDM. In this paper, we propose an improved affinity propagation (AP) clustering algorithm that fully consider the trust and similarity attributes to obtain clustering results that are more in line with the expert preferences. Furthermore, we propose an adjustable minimum-cost consensus (MCC) model that considers trust-polymerization degree, which takes into account variations in expert weights and cluster diversity. And the cuckoo search (CS) algorithm is utilized to solve the model. Finally, the applicability and advantages of the proposed methods are demonstrated through a case and comparative analysis.

Driving factors and clustering analysis of expressway vehicular CO2 emissions in Guizhou Province, China.

Expressways are essential for intercounty trips of passenger travel and freight mobility, which are also an important source of vehicular CO2 emissions in transportation sector. This study takes the expressway system of Guizhou Province as the research objective, and establishes the multi-year expressway vehicular CO2 emission inventories at the county level from 2011 to 2019. We employ the extended STIRPAT model incorporating ridge regression to identify driving factors from six different aspects, and then utilize the affinity propagation cluster method to conduct the differentiation research by dividing Guizhou's counties into four clusters. Based upon clustering analysis, localized and targeted policies are formulated for each cluster to reduce expressway vehicular CO2 emissions. The results indicate that generally: (1) Guizhou's expressway vehicular CO2 emissions manifest a continuously upward trend during 2011-2019. Small-duty passenger vehicle (SDV), light-duty truck (LDT), and heavy-duty truck (HDT) contribute to the largest CO2 emissions in eight vehicle types. (2) GDP and population are the foremost two positive driving factors, followed by urbanization rate and expressway length. The proportion of secondary industry is also a positive driver, but that of tertiary industry exhibits an opposite effect. (3) Regional disparity exists in four county clusters of Guizhou Province. Efficient policies are proposed, such as improving the layout and infrastructure of transportation hubs, promoting multimodal integration, and implementing industrial upgrading as per regional advantages. Sustainable expressway vehicular CO2 emission reduction is realized from both the source of industry and low-carbon modes of transport.

Transmission section search method based on variable scale nearest neighbor propagation clustering

Transmission sections have great significance in modern power systems. Given the phenomenon of frequent power outages caused by the chain tripping of transmission sections, a method for transmission section search based on the variable-scale affinity propagation clustering algorithm is proposed. Considering only the connection relationship, the power system model can be simplified to a topological map in graph theory for analysis. So firstly the algorithm considers the importance of each line from the perspectives of the structure of the graph and the actual operation of the power flow and then uses the variable-scale affinity propagation clustering algorithm for the network based on this value with the change of the number of cluster centers. The network will be partitioned at different scales, then find out the partition contact line at different scales, and judge whether it is a transmission cross-section by the power flow direction and the number of contact lines. This method can search out as many potential transmission sections of the power network as possible to provide more monitored objects for the staff and reduce the probability of large power outages. Finally, simulation in the IEEE-118-bus system and the IEEE-39-bus system verifies the effectiveness of the proposed method.