Density Peak Clustering Research Articles

Advancing 6G-IoT networks: Willow catkin packet transmission scheduling with AI and bayesian game-theoretic approach-based resource allocation.

The rapid expansion of mobile broadband networks and the proliferation of Internet of Things (IoT) applications have substantially increased data transmission and processing demands. However, the application domains of IoT-enabled models often face resource limitations, requiring rapid responses, low latency, and large bandwidth, surpassing their inherent capabilities. To address these challenges, we propose a fishnet approach-based packet scheduling and resource allocation system, termed Fishnet-6G, to optimize network resource allocation in the proposed 6G networks. Initially, we constructed a Sierpinski Triangle-based network in a 6G-IoT environment, enhancing device connectivity. We utilize the Quantum Density Peak Clustering (QDPC) algorithm to perform clustering for IoT devices, establishing Cluster Head (CH) and Substitute CH (SUB CH) based on actual metrics. Furthermore, traffic prediction is achieved through two processes, grouping, and fair queue status, using the Improved Deep Deterministic Policy Gradient (IMPDDPG) algorithm with a variable sampling rate, resulting in well-organized packet scheduling. Subsequently, we perform optimal packet scheduling by employing the Willow Catkin Optimization (WCO) algorithm, and the scheduled packets are managed within a Fishing Net Topology to reduce energy consumption and system complexity. Finally, we allocate the scheduled packets to the desired resource blocks using the Bayesian Game-Theoretic Approach (BGTA). The proposed approach is implemented using Network Simulator-3.26, and the performance of the Fishnet-6G model is evaluated based on time, transmission rate, energy efficiency, average throughput, latency, and Packet loss rate. Numerical analysis demonstrates that Fishnet-6G outperforms existing approaches across these metrics, showcasing its effectiveness in addressing the challenges of 6G-IoT networks.

A neighborhood-based robust clustering algorithm using Apollonius function kernel

Density Peak Clustering (DPC) is a useful algorithm for grouping data points based on their closeness and density. It is widely used in various areas of computer science. It can detect the peak density in each period of the clustering steps and assign the rest of the data to the next steps. Peak density clustering analysis is able to discover clusters of arbitrary shapes, but usually, when the data set is large, it is computationally expensive and difficult to apply to high-dimensional data. When the distance between clusters is significantly different, it is unable to distinguish adjacent clusters with different densities. To deal with such issues, a new clustering algorithm based on neighborhoods and the Apollonius kernel is proposed. The proposed algorithm can be implemented with four steps. 1) Estimation of natural neighbor, 2) Identification of core points, 3) Merging the cores of a cluster and separating the cores of different clusters, 4) Using the Apollonius kernel between the core points and the farthest points to assign the remaining points to the clusters and find the noise points. The local density estimation process based on the natural neighborhood of high-density points and their integration, as well as border point classification, allows the proposed method to reveal the local cluster structure. As a result, the adjoining clusters with distinctive densities are recognized, and the computation is substantially reduced. The proposed method is validated on some synthetic data sets and the UCI data set experimentally and has a high 10% accuracy.

A Theoretical Analysis of Density Peaks Clustering and the Component-Wise Peak-Finding Algorithm.

Density peaks clustering detects modes as points with high density and large distance to points of higher density. Each non-mode point is assigned to the same cluster as its nearest neighbor of higher density. Density peaks clustering has proved capable in applications, yet little work has been done to understand its theoretical properties or the characteristics of the clusterings it produces. Here, we prove that it consistently estimates the modes of the underlying density and correctly clusters the data with high probability. However, noise in the density estimates can lead to erroneous modes and incoherent cluster assignments. A novel clustering algorithm, Component-wise Peak-Finding (CPF), is proposed to remedy these issues. The improvements are twofold: 1) the assignment methodology is improved by applying the density peaks methodology within level sets of the estimated density; 2) the algorithm is not affected by spurious maxima of the density and hence is competent at automatically deciding the correct number of clusters. We present novel theoretical results, proving the consistency of CPF, as well as extensive experimental results demonstrating its exceptional performance. Finally, a semi-supervised version of CPF is presented, integrating clustering constraints to achieve excellent performance for an important problem in computer vision.

Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm

Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout’s distributed machine-learning environment. The study taps into Apache Hadoop’s robust tools for data storage and processing, including HDFS and MapReduce, to effectively manage and analyze big data challenges. The preprocessing phase utilizes Canopy clustering to expedite the initial partitioning of data points, which are subsequently refined by K-means to enhance clustering performance. Experimental results confirm that incorporating the Canopy as an initial step markedly reduces the computational effort to process the vast quantity of parallel power load abnormalities. The Canopy clustering approach, enabled by distributed machine learning through Apache Mahout, is utilized as a preprocessing step within the K-means clustering technique. The hybrid algorithm was implemented to minimise the length of time needed to address the massive scale of the detected parallel power load abnormalities. Data vectors are generated based on the time needed, sequential and parallel candidate feature data are obtained, and the data rate is combined. After classifying the time set using the canopy with the K-means algorithm and the vector representation weighted by factors, the clustering impact is assessed using purity, precision, recall, and F value. The results showed that using canopy as a preprocessing step cut the time it proceeds to deal with the significant number of power load abnormalities found in parallel using a fast density peak dataset and the time it proceeds for the k-means algorithm to run. Additionally, tests demonstrate that combining canopy and the K-means algorithm to analyze data performs consistently and dependably on the Hadoop platform and has a clustering result that offers a scalable and effective solution for power system monitoring.

Hybrid Clustering Algorithm Based on Improved Density Peak Clustering

In the era of big data, unsupervised learning algorithms such as clustering are particularly prominent. In recent years, there have been significant advancements in clustering algorithm research. The Clustering by Density Peaks algorithm is known as Clustering by Fast Search and Find of Density Peaks (density peak clustering). This clustering algorithm, proposed in Science in 2014, automatically finds cluster centers. It is simple, efficient, does not require iterative computation, and is suitable for large-scale and high-dimensional data. However, DPC and most of its refinements have several drawbacks. The method primarily considers the overall structure of the data, often resulting in the oversight of many clusters. The choice of truncation distance affects the calculation of local density values, and varying dataset sizes may necessitate different computational methods, impacting the quality of clustering results. In addition, the initial assignment of labels can cause a ‘chain reaction’, i.e., if one data point is incorrectly labeled, it may lead to more subsequent data points being incorrectly labeled. In this paper, we propose an improved density peak clustering method, DPC-MS, which uses the mean-shift algorithm to find local density extremes, making the accuracy of the algorithm independent of the parameter dc. After finding the local density extreme points, the allocation strategy of the DPC algorithm is employed to assign the remaining points to appropriate local density extreme points, forming the final clusters. The robustness of this method in handling uncertain dataset sizes adds some application value, and several experiments were conducted on synthetic and real datasets to evaluate the performance of the proposed method. The results show that the proposed method outperforms some of the more recent methods in most cases.

UP-DPC: Ultra-scalable parallel density peak clustering

Density Peak Clustering (DPC) is a highly effective density-based clustering algorithm, but its scalability is limited by the expensive Density Peak Estimation (DPE) step. To address this challenge, we propose UP-DPC: Ultra-Scalable Parallel Density Peak Clustering, a novel framework that employs approximate Density Peak Estimation and performs DPC on LDP-wise graphs. This approach enables UP-DPC to handle datasets of arbitrary scale without relying on spatial indexing for acceleration. Furthermore, we introduce a five-layer computational architecture and leverage parallel computation techniques to further enhance the speed and efficiency of UP-DPC.To evaluate the scalability and effectiveness of UP-DPC, we conduct extensive experiments on 14 datasets, including the large/web-scale datasets, and compare UP-DPC with 21 algorithms. Notably, on the MNIST8M dataset consisting of 8,000k data objects, UP-DPC achieves an NMI (Normalized Mutual Information) value of 0.6464 in just 35.41 seconds, outperforming the state-of-the-art GPU-based method, which only archives an NMI of 0.045 in 56.96 seconds. These results demonstrate the superior scalability and effectiveness of UP-DPC in handling large/web-scale datasets. The proposed framework offers significant improvements over existing methods and shows promise as a solution for density-based clustering tasks.

Fast Automatic Fuzzy C-Means Knitting Pattern Color-Separation Algorithm Based on Superpixels.

Patterns entered into knitting CAD have thousands or tens of thousands of different colors, which need to be merged by color-separation algorithms. However, for degraded patterns, the current color-separation algorithms cannot achieve the desired results, and the clustering quantity parameter needs to be managed manually. In this paper, we propose a fast and automatic FCM color-separation algorithm based on superpixels, which first uses the Real-ESRGAN blind super-resolution network to clarify the degraded patterns and obtain high-resolution images with clear boundaries. Then, it uses the improved MMGR-WT superpixel algorithm to pre-separate the high-resolution images and obtain superpixel images with smooth and accurate edges. Subsequently, the number of superpixel clusters is automatically calculated by the improved density peak clustering (DPC) algorithm. Finally, the superpixels are clustered using fast fuzzy c-means (FCM) based on a color histogram. The experimental results show that not only is the algorithm able to automatically determine the number of colors in the pattern and achieve the accurate color separation of degraded patterns, but it also has lower running time. The color-separation results for 30 degraded patterns show that the segmentation accuracy of the color-separation algorithm proposed in this paper reaches 95.78%.

Horizontal Federated Density Peaks Clustering.

Density peaks clustering (DPC) is a popular clustering algorithm, which has been studied and favored by many scholars because of its simplicity, fewer parameters, and no iteration. However, in previous improvements of DPC, the issue of privacy data leakage was not considered, and the "Domino" effect caused by the misallocation of noncenters has not been effectively addressed. In view of the above shortcomings, a horizontal federated DPC (HFDPC) is proposed. First, HFDPC introduces the idea of horizontal federated learning and proposes a protection mechanism for client parameter transmission. Second, DPC is improved by using similar density chain (SDC) to alleviate the "Domino" effect caused by multiple local peaks in the flow pattern dataset. Finally, a novel data dimension reduction and image encryption are used to improve the effectiveness of data partitioning. The experimental results show that compared with DPC and some of its improvements, HFDPC has a certain degree of improvement in accuracy and speed.

Behavioral Analysis and Educational Management of College Students in Universities by Integrating Multi-source Data

Abstract Big data technology has brought new opportunities for the development of the education industry and can play a positive role in the management of student campus education. In this paper, the behavioral features in the extracted multi-source behavioral data of college students are dimensionality reduced using principal component analysis, and the behavioral features are clustered using density peak clustering and undersampling methods. The Adaboost algorithm is used to identify and classify each behavioral feature to obtain behavioral analysis data for students. Finally, the university’s education management system is constructed based on this behavioral analysis model. The behavioral analysis of students in a university shows that both consumption behavior and book borrowing behavior cluster into three categories. Among them, the type of students who clocked into the library with a medium frequency and borrowed the most number of books had the highest percentage (39.25%) among the students in this university. And there is about a 79.3% probability that students of the university with a high number of absences seldom visit the library. The study also showed that there was a significant difference (p<0.05) in the study behavior of students in both experimental and control classes after the application of the educational management system. The student behavior analysis and management platform proposed in this paper effectively promotes the development and progress of education management in colleges and universities and improves the efficiency of student management work and the scientificity and reliability of the results.

Natural Nearest and Shared Nearest Neighbors Density Peaks Clustering Algorithm for Manifold Data

Natural Nearest and Shared Nearest Neighbors Density Peaks Clustering Algorithm for Manifold Data

A Self-Representation Weighted-Based Density Peaks Clustering Method

A Self-Representation Weighted-Based Density Peaks Clustering Method

Vertical Federated Density Peaks Clustering under Nonlinear Mapping

Vertical Federated Density Peaks Clustering under Nonlinear Mapping

Graph Distance and Adaptive K-Nearest Neighbors Selection-Based Density Peak Clustering

Graph Distance and Adaptive K-Nearest Neighbors Selection-Based Density Peak Clustering

Deep Learning-based Network Security Protection for Scheduling Data in Power Plant Systems

Abstract Scheduling data of power plant systems plays a pivotal role in grid security. In this paper, the intrusion detection model IDP-TSW is constructed by using deep learning technology, feature extraction of raw traffic data based on density peak clustering algorithm and control variable method, and the final classification is realized by softmax. After completing the intrusion detection, for the network malicious intrusion situation further proposed the security protection strategy selection model HMS-BAG based on the Bayesian attack graph, formalized the description of the protection strategy selection problem, and proposed the optimal security protection strategy selection algorithm based on PSO. In the network intrusion detection performance experiments, the performance of the IDP-TSW model proposed in this paper outperforms the Bi-LSTM and CNN+Bi-LSTM models in terms of accuracy, recall, and F1 value. The F1 values for determining normal and abnormal data are 96.57% and 95.75%, respectively, and the precision and recall are also higher than 94%. Detecting Generic and Reconnaissance attacks is more than 90% accurate, but Dos attacks and others are relatively absent. In the network security defense performance experiment, the proposed HMS-BAG model achieved a defense success rate of 94.2% and a defense gain of 170.68.

Density Peaks Clustering Based on Label Propagation and K-Mutual-Nearest Neighbors

Density Peaks Clustering Based on Label Propagation and K-Mutual-Nearest Neighbors

Uncovering Plastic Litter Spectral Signatures: A Comparative Study of Hyperspectral Band Selection Algorithms

This article provides insights into the optical signatures of plastic litter based on a published laboratory-scale reflectance data set (350–2500 nm) of dry and wet plastic debris under clear and turbid waters using different band selection techniques, including sparse variable selection, density peak clustering, and hierarchical clustering. The variable selection method identifies important wavelengths by minimizing a reconstruction error metric, while clustering approaches rely on the strengths of the correlation and local density of the spectra. Analyses of the data reveal three distinct absorption lines at 560, 740, and 980 nm that produce relatively broad reflectance peaks in the measured spectra of wet plastics around 475–490, 635–650, 810–815, and 1070 nm. The results of band selection consistently identify three important regions across 450–470, 650–690, and 1050–1100 nm that are close to the reflectance peaks of the mean of wet plastic spectra over clear and turbid waters. However, as the number of isolated important wavelengths increases, the results of the methodologies diverge. Density peak clustering identifies additional wavelengths in the short-wave infrared (SWIR) region of 1170–1180 nm) as a result of a high local density of the reflectance points. In contrast, hierarchical clustering isolates more wavelengths in the visible range of 365–400 nm due to weak correlations of nearby wavelengths. The results of the clustering methods are not consistent with the visual inspection of the signatures as peaks and valleys in the spectra, which are effectively captured by the variable selection method. It is also found that the presence of suspended sediments can (i) shift the important wavelength towards higher values in the visible part of the spectrum by less than 50 nm, (ii) attenuate the magnitude of wet plastic reflectance by up to 80% across the entire spectrum, and (iii) manifest a similar spectral signature with plastic litter from 1070 to 1100 nm.

Three-way evidence theory-based density peak clustering with the principle of justifiable granularity

Clustering by fast search and find of density peaks (DPC) is an effective clustering approach that can find all the cluster centers at once with just one parameter and without iterative processing. However, the cutoff distance, a key parameter of density measurement in the DPC approach, affects the quality of the final clustering results. Its selection relies on experimental experience and lacks of a semantic explanation. Furthermore, the allocation strategy of the traditional DPC approach may cause several points to be assigned incorrectly, leading to subsequent points being assigned incorrectly and ultimately forming continuous allocation errors. To overcome the deficiencies, this paper proposes a novel three-way evidence theory-based density peak clustering with the principle of justifiable granularity (3 W-PEDP). First, the computation of the cutoff distance is converted into the search for nearest neighbors. From the perspective of granular computing, 3 W-PEDP transforms the neighbor selection issue into the construction of justifiable granularity. And the optimal neighbors can be achieved with the construction of coverage and specificity criteria. Second, inspired by three-way clustering, we adopt a two-stage method for sample allocation. On the one hand, for core point allocation, a two-layer nearest neighbor is constructed based on the achieved optimal neighbors. On the other hand, we designed a new evidence mass function to guide us in assigning the remaining points. In this novel evidence mass function, not only the labels of the assigned samples are considered, but also the information of the neighborhoods around the unassigned samples is fused. Finally, we assess the effectiveness of 3 W-PEDP on numerous public synthetic datasets and UCI real-world datasets. Then, detail comparing results with several popular clustering methods are presented. In addition, experimental studies verify the effectiveness of constructing justifiable granularity in selecting the optimal neighbors. The experimental results demonstrate 3 W-PEDP has good adaptability and robustness, which can achieve better clustering performance. Our source code is available at https://github.com/Luyangabc/3W-PEDP.

Optimization of Density Peak Clustering Algorithm Based on Improved Black Widow Algorithm.

Clustering is an unsupervised learning method. Density Peak Clustering (DPC), a density-based algorithm, intuitively determines the number of clusters and identifies clusters of arbitrary shapes. However, it cannot function effectively without the correct parameter, referred to as the cutoff distance (dc). The traditional DPC algorithm exhibits noticeable shortcomings in the initial setting of dc when confronted with different datasets, necessitating manual readjustment. To solve this defect, we propose a new algorithm where we integrate DPC with the Black Widow Optimization Algorithm (BWOA), named Black Widow Density Peaks Clustering (BWDPC), to automatically optimize dc for maximizing accuracy, achieving automatic determination of dc. In the experiment, BWDPC is used to compare with three other algorithms on six synthetic data and six University of California Irvine (UCI) datasets. The results demonstrate that the proposed BWDPC algorithm more accurately identifies density peak points (cluster centers). Moreover, BWDPC achieves superior clustering results. Therefore, BWDPC represents an effective improvement over DPC.

Mobile communication channel resource allocation technology in interference environment based on clustering algorithm

The rapid development of urbanization has led to the gradual increase of urban residential density. Relatively speaking, the spectrum resources are increasingly scarce, which leads to the increasingly serious interference between communities, and the system performance is also greatly limited. Therefore, in order to improve the efficiency of spectrum resources and solve the problem of user interference between cells, the experiment combines the advantages of clustering by fast search and find of Density Peaks Clustering (DPC), and proposes a two-step clustering algorithm. This method is proposed based on the core idea of DPC after in-depth study of the downlink multi-cell orthogonal frequency division multiplexing system architecture. The proposed model is compared with Matching Pursuit (MP) algorithm and Graph-based algorithm with the sum of clustering distance Rs, 1.5⁢Rs. The results show that the two-step clustering algorithm can significantly improve the spectrum efficiency and network capacity while ensuring good quality of service under the condition of channel tension or not. In addition, the minimum SINR value of the two-step clustering algorithm can reach 75 dB. Compared with the 220 dB of the Graph-based algorithm with the clustering distance Rs, it has extremely obvious advantages. Therefore, the two-step clustering algorithm constructed in this study can effectively reduce system interference, and has certain research and application value in solving the problem of mobile communication channel resource shortage.

Optimal Capacity Configuration of Pumped-Storage Units Used to Retrofit Cascaded Hydropower Stations

As flexible resources, cascaded hydropower stations can regulate the fluctuations caused by wind and photovoltaic power. Constructing pumped-storage units between two upstream and downstream reservoirs is an effective method to further expand the capacity of flexible resources. This method transforms cascaded hydropower stations into a cascaded pumped-hydro-energy storage system. In this paper, a flexibility reformation planning model of cascaded hydropower stations retrofitted with pumped-storage units under a hybrid system composed of thermal, wind, and photovoltaic power is established with the aim of investigating the optimal capacity of pumped-storage units. First, a generative adversarial network and a density peak clustering algorithm are utilized to generate typical scenarios to deal with the seasonal fluctuation of renewable energy generation, natural water inflow, and loads. Then, a full-scenario optimization method is proposed to optimize the operation costs of multiple scenarios considering the variable-speed operation characteristics of pumped storage and to obtain a scheme with better comprehensive economy. Meanwhile, the proposed model is retransformed into a mixed-integer linear programming problem to simplify the solution. Case studies in Sichuan province are used to demonstrate the effectiveness of the proposed model.