Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead...Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead to changes in the network topology,thereby reducing cluster stability in urban scenarios.To address this issue,we propose a clustering model based on the density peak clustering(DPC)method and sparrow search algorithm(SSA),named SDPC.First,the model constructs a fitness function based on the parameters obtained from the DPC method and deploys the SSA for iterative optimization to select cluster heads(CHs).Then,the vehicles that have not been selected as CHs are assigned to appropriate clusters by comprehensively considering the distance parameter and link-reliability parameter.Finally,cluster maintenance strategies are considered to tackle the changes in the clusters’organizational structure.To verify the performance of the model,we conducted a simulation on a real-world scenario for multiple metrics related to clusters’stability.The results show that compared with the APROVE and the GAPC,SDPC showed clear performance advantages,indicating that SDPC can effectively ensure VANETs’cluster stability in urban scenarios.展开更多
Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional...Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.展开更多
To fully explore the potential features contained in power load data,an innovative short-term power load forecasting method that integrates data mining and deep learning techniques is proposed.Firstly,a density peak f...To fully explore the potential features contained in power load data,an innovative short-term power load forecasting method that integrates data mining and deep learning techniques is proposed.Firstly,a density peak fast search algorithm optimized by time series weighting factors is used to cluster and analyze load data,accurately dividing subsets of data into different categories.Secondly,introducing convolutional block attention mechanism into the bidirectional gated recurrent unit(BiGRU)structure significantly enhances its ability to extract key features.On this basis,in order to make the model more accurately adapt to the dynamic changes in power load data,subsets of different categories of data were used for BiGRU training based on attention mechanism,and extreme gradient boosting was selected as the meta model to effectively integrate multiple sets of historical training information.To further optimize the parameter configuration of the meta model,Bayesian optimization techniques are used to achieve automated adjustment of hyperparameters.Multiple sets of comparative experiments were designed,and the results showed that the average absolute error of the method in this paper was reduced by about 8.33%and 4.28%,respectively,compared with the single model and the combined model,and the determination coefficient reached the highest of 95.99,which proved that the proposed method has a better prediction effect.展开更多
In distributed fusion,when one or more sensors are disturbed by faults,a common problem is that their local estimations are inconsistent with those of other fault-free sensors.Most of the existing fault-tolerant distr...In distributed fusion,when one or more sensors are disturbed by faults,a common problem is that their local estimations are inconsistent with those of other fault-free sensors.Most of the existing fault-tolerant distributed fusion algorithms,such as the Covariance Union(CU)and Faulttolerant Generalized Convex Combination(FGCC),are only used for the point estimation case where local estimates and their associated error covariances are provided.A treatment with focus on the fault-tolerant distributed fusions of arbitrary local Probability Density Functions(PDFs)is lacking.For this problem,we first propose Kullback–Leibler Divergence(KLD)and reversed KLD induced functional Fuzzy c-Means(FCM)clustering algorithms to soft cluster all local PDFs,respectively.On this basis,two fault-tolerant distributed fusion algorithms of arbitrary local PDFs are then developed.They select the representing PDF of the cluster with the largest sum of memberships as the fused PDF.Numerical examples verify the better fault tolerance of the developed two distributed fusion algorithms.展开更多
The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the s...The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the soft code implement and debug support from Vladislav Gudzulic and academic advising from Günther Meschke.展开更多
Failure mode and effect analysis(FMEA)is a preven-tative risk evaluation method used to evaluate and eliminate fail-ure modes within a system.However,the traditional FMEA method exhibits many deficiencies that pose ch...Failure mode and effect analysis(FMEA)is a preven-tative risk evaluation method used to evaluate and eliminate fail-ure modes within a system.However,the traditional FMEA method exhibits many deficiencies that pose challenges in prac-tical applications.To improve the conventional FMEA,many modified FMEA models have been suggested.However,the majority of them inadequately address consensus issues and focus on achieving a complete ranking of failure modes.In this research,we propose a new FMEA approach that integrates a two-stage consensus reaching model and a density peak clus-tering algorithm for the assessment and clustering of failure modes.Firstly,we employ the interval 2-tuple linguistic vari-ables(I2TLVs)to express the uncertain risk evaluations provided by FMEA experts.Then,a two-stage consensus reaching model is adopted to enable FMEA experts to reach a consensus.Next,failure modes are categorized into several risk clusters using a density peak clustering algorithm.Finally,the proposed FMEA is illustrated by a case study of load-bearing guidance devices of subway systems.The results show that the proposed FMEA model can more easily to describe the uncertain risk information of failure modes by using the I2TLVs;the introduction of an endogenous feedback mechanism and an exogenous feedback mechanism can accelerate the process of consensus reaching;and the density peak clustering of failure modes successfully improves the practical applicability of FMEA.展开更多
Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Sp...Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Spatial Clustering of Applications with Noise(DBSCAN).It identifies clusters by grouping the densely connected objects into one group and discarding the noise objects.It requires two input parameters:epsilon(fixed neighborhood radius)and MinPts(the lowest number of objects in epsilon).However,it can’t handle clusters of various densities since it uses a global value for epsilon.This article proposes an adaptation of the DBSCAN method so it can discover clusters of varied densities besides reducing the required number of input parameters to only one.Only user input in the proposed method is the MinPts.Epsilon on the other hand,is computed automatically based on statistical information of the dataset.The proposed method finds the core distance for each object in the dataset,takes the average of these distances as the first value of epsilon,and finds the clusters satisfying this density level.The remaining unclustered objects will be clustered using a new value of epsilon that equals the average core distances of unclustered objects.This process continues until all objects have been clustered or the remaining unclustered objects are less than 0.006 of the dataset’s size.The proposed method requires MinPts only as an input parameter because epsilon is computed from data.Benchmark datasets were used to evaluate the effectiveness of the proposed method that produced promising results.Practical experiments demonstrate that the outstanding ability of the proposed method to detect clusters of different densities even if there is no separation between them.The accuracy of the method ranges from 92%to 100%for the experimented datasets.展开更多
The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influen...The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.展开更多
Earthquakes exhibit clear clustering on the earth. It is important to explore the spatial-temporal characteristics of seismicity clusters and their spatial heterogeneity. We analyze effects of plate space, tectonic st...Earthquakes exhibit clear clustering on the earth. It is important to explore the spatial-temporal characteristics of seismicity clusters and their spatial heterogeneity. We analyze effects of plate space, tectonic style, and their interaction on characteristic of cluster.Based on data of earthquakes not less than moment magnitude(M_w) 5.6 from 1960 to 2014, this study used the spatial-temporal scan method to identify earthquake clusters. The results indicate that seismic spatial-temporal clusters can be classified into two types based on duration: persistent clusters and burst clusters. Finally, we analysed the spatial heterogeneity of the two types. The main conclusions are as follows: 1) Ninety percent of the persistent clusters last for 22-38 yr and show a high clustering likelihood;ninety percent of the burst clusters last for 1-1.78 yr and show a high relative risk. 2) The persistent clusters are mainly distributed in interplate zones, especially along the western margin of the Pacific Ocean. The burst clusters are distributed in both intraplate and interplate zones, slightly concentrated in the India-Eurasia interaction zone. 3) For the persistent type, plate interaction plays an important role in the distribution of the clusters’ likelihood and relative risk. In addition, the tectonic style further enhances the spatial heterogeneity. 4) For the burst type,neither plate activity nor tectonic style has an obvious effect on the distribution of the clusters’ likelihood and relative risk. Nevertheless,interaction between these two spatial factors enhances the spatial heterogeneity, especially in terms of relative risk.展开更多
Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in...Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in practice,making it impossible to cluster point clouds data directly,and the filtering error is also too large.Moreover,many existing filtering algorithms have poor classification results in discontinuous terrain.This article proposes a new fast classification filtering algorithm based on density clustering,which can solve the problem of point clouds classification in discontinuous terrain.Based on the spatial density of LiDAR point clouds,also the features of the ground object point clouds and the terrain point clouds,the point clouds are clustered firstly by their elevations,and then the plane point clouds are selected.Thus the number of samples and feature dimensions of data are reduced.Using the DBSCAN clustering filtering method,the original point clouds are finally divided into noise point clouds,ground object point clouds,and terrain point clouds.The experiment uses 15 sets of data samples provided by the International Society for Photogrammetry and Remote Sensing(ISPRS),and the results of the proposed algorithm are compared with the other eight classical filtering algorithms.Quantitative and qualitative analysis shows that the proposed algorithm has good applicability in urban areas and rural areas,and is significantly better than other classic filtering algorithms in discontinuous terrain,with a total error of about 10%.The results show that the proposed method is feasible and can be used in different terrains.展开更多
The mesoscale eddy is a typical mesoscale oceanic phenomenon that transfers ocean energy. The detection and extraction of mesoscale eddies is an important aspect of physical oceanography, and automatic mesoscale eddy ...The mesoscale eddy is a typical mesoscale oceanic phenomenon that transfers ocean energy. The detection and extraction of mesoscale eddies is an important aspect of physical oceanography, and automatic mesoscale eddy detection algorithms are the most fundamental tools for detecting and analyzing mesoscale eddies. The main data used in mesoscale eddy detection are sea level anomaly(SLA) data merged by multi-satellite altimeters' data.These data objectively describe the state of the sea surface height. The mesoscale eddy can be represented by a local equivalent region surrounded by an SLA closed contour, and the detection process requires the extraction of a stable closed contour structure from SLA maps. In consideration of the characteristics of mesoscale eddy detection based on SLA data, this paper proposes a new automatic mesoscale eddy detection algorithm based on clustering. The mesoscale eddy structure can be extracted by separating and filtering SLA data sets to separate a mesoscale eddy region and non-eddy region and then establishing relationships among eddy regions and mapping them on SLA maps. This paper overcomes the problem of the sensitivity of parameter setting that affects the traditional detection algorithm and does not require a sensitivity test. The proposed algorithm is thus more adaptable. An eddy discrimination mechanism is added to the algorithm to ensure the stability of the detected eddy structure and to improve the detection accuracy. On this basis, the paper selects the Northwest Pacific Ocean and the South China Sea to carry out a mesoscale eddy detection experiment. Experimental results show that the proposed algorithm is more efficient than the traditional algorithm and the results of the algorithm remain stable. The proposed algorithm detects not only stable single-core eddies but also stable multi-core eddy structures.展开更多
This paper presents an effective clustering mode and a novel clustering result evaluating mode. Clustering mode has two limited integral parameters. Evaluating mode evaluates clustering results and gives each a mark. ...This paper presents an effective clustering mode and a novel clustering result evaluating mode. Clustering mode has two limited integral parameters. Evaluating mode evaluates clustering results and gives each a mark. The higher mark the clustering result gains, the higher quality it has. By organizing two modes in different ways, we can build two clustering algorithms： SECDU（Self-Expanded Clustering Algorithm based on Density Units） and SECDUF（Self-Expanded Clustering Algorithm Based on Density Units with Evaluation Feedback Section）. SECDU enumerates all value pairs of two parameters of clustering mode to process data set repeatedly and evaluates every clustering result by evaluating mode. Then SECDU output the clustering result that has the highest evaluating mark among all the ones. By applying ＂hill-climbing algorithm＂, SECDUF improves clustering efficiency greatly. Data sets that have different distribution features can be well adapted to both algorithms. SECDU and SECDUF can output high-quality clustering results. SECDUF tunes parameters of clustering mode automatically and no man＇s action involves through the whole process. In addition, SECDUF has a high clustering performance.展开更多
With rapid developments in platforms and sensors technology in terms of digital cameras and video recordings,crowd monitoring has taken a considerable attentions in many disciplines such as psychology,sociology,engine...With rapid developments in platforms and sensors technology in terms of digital cameras and video recordings,crowd monitoring has taken a considerable attentions in many disciplines such as psychology,sociology,engineering,and computer vision.This is due to the fact that,monitoring of the crowd is necessary to enhance safety and controllable movements to minimize the risk particularly in highly crowded incidents(e.g.sports).One of the platforms that have been extensively employed in crowd monitoring is unmanned aerial vehicles(UAVs),because UAVs have the capability to acquiring fast,low costs,high-resolution and real-time images over crowd areas.In addition,geo-referenced images can also be provided through integration of on-board positioning sensors(e.g.GPS/IMU)with vision sensors(digital cameras and laser scanner).In this paper,a new testing procedure based on feature from accelerated segment test(FAST)algorithms is introduced to detect the crowd features from UAV images taken from different camera orientations and positions.The proposed test started with converting a circle of 16 pixels surrounding the center pixel into a vector and sorting it in ascending/descending order.A single pixel which takes the ranking number 9(for FAST-9)or 12(for FAST-12)was then compared with the center pixel.Accuracy assessment in terms of completeness and correctness was used to assess the performance of the new testing procedure before and after filtering the crowd features.The results show that the proposed algorithms are able to extract crowd features from different UAV images.Overall,the values of Completeness range from 55 to 70%whereas the range of correctness values was 91 to 94%.展开更多
Performing cluster analysis on molecular conformation is an important way to find the representative conformation in the molecular dynamics trajectories.Usually,it is a critical step for interpreting complex conformat...Performing cluster analysis on molecular conformation is an important way to find the representative conformation in the molecular dynamics trajectories.Usually,it is a critical step for interpreting complex conformational changes or interaction mechanisms.As one of the density-based clustering algorithms,find density peaks(FDP)is an accurate and reasonable candidate for the molecular conformation clustering.However,facing the rapidly increasing simulation length due to the increase in computing power,the low computing efficiency of FDP limits its application potential.Here we propose a marginal extension to FDP named K-means find density peaks(KFDP)to solve the mass source consuming problem.In KFDP,the points are initially clustered by a high efficiency clustering algorithm,such as K-means.Cluster centers are defined as typical points with a weight which represents the cluster size.Then,the weighted typical points are clustered again by FDP,and then are refined as core,boundary,and redefined halo points.In this way,KFDP has comparable accuracy as FDP but its computational complexity is reduced from O(n^(2))to O(n).We apply and test our KFDP method to the trajectory data of multiple small proteins in terms of torsion angle,secondary structure or contact map.The comparing results with K-means and density-based spatial clustering of applications with noise show the validation of the proposed KFDP.展开更多
This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improv...This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improves main swarm training models and in- creases their ability of space searching. Secondly, the radius of sub-swarms is defined adaptively according to the actual clus- tering problem, which can be useful for the niches＇ forming and searching. At last, a novel method that distributes samples to the corresponding cluster is proposed. Numerical results illustrate that this algorithm based on the density function and nichePSO could cluster unbalanced density datasets into the correct clusters auto- matically and accurately.展开更多
We present a novel unsupervised integrated score framework to generate generic extractive multi- document summaries by ranking sentences based on dynamic programming （DP） strategy. Considering that cluster-based met...We present a novel unsupervised integrated score framework to generate generic extractive multi- document summaries by ranking sentences based on dynamic programming （DP） strategy. Considering that cluster-based methods proposed by other researchers tend to ignore informativeness of words when they generate summaries, our proposed framework takes relevance, diversity, informativeness and length constraint of sentences into consideration comprehensively. We apply Density Peaks Clustering （DPC） to get relevance scores and diversity scores of sentences simultaneously. Our framework produces the best performance on DUC2004, 0.396 of ROUGE-1 score, 0.094 of ROUGE-2 score and 0.143 of ROUGE-SU4 which outperforms a series of popular baselines, such as DUC Best, FGB [7], and BSTM [10].展开更多
Outlier detection is an important task in data mining. In fact, it is difficult to find the clustering centers in some sophisticated multidimensional datasets and to measure the deviation degree of each potential outl...Outlier detection is an important task in data mining. In fact, it is difficult to find the clustering centers in some sophisticated multidimensional datasets and to measure the deviation degree of each potential outlier. In this work, an effective outlier detection method based on multi-dimensional clustering and local density(ODBMCLD) is proposed. ODBMCLD firstly identifies the center objects by the local density peak of data objects, and clusters the whole dataset based on the center objects. Then, outlier objects belonging to different clusters will be marked as candidates of abnormal data. Finally, the top N points among these abnormal candidates are chosen as final anomaly objects with high outlier factors. The feasibility and effectiveness of the method are verified by experiments.展开更多
The internal structures as well as adsorption and hopping energies of monomers, dimers, trimers, tetramers, pentamers and hexamers of water on Pd（111） have been studied by density functional theory （DFT） plane-wav...The internal structures as well as adsorption and hopping energies of monomers, dimers, trimers, tetramers, pentamers and hexamers of water on Pd（111） have been studied by density functional theory （DFT） plane-wave pseudopotential method which performs the firstprinciples quantum-mechanical calculations to explore the properties of crystals and surfaces in materials. Based on the calculations, we suppose that their absorption is via one water molecule for monomers, dimmers and trimers, but three water molecules for pentamers and hexamers. Moreover, there is one water molecule bonding with Pd atom by O atom in pentamers and hexamers, which explains why pentamers and hexamers are stable. The binding energies of polymers may be used to explain why the trimer comes close to two nearby monomers to form a stable pentamer instead of tetramer. And the difference of mobility of small water clusters is due to their different hopping energies.展开更多
Encephalitis is a brain inflammation disease.Encephalitis can yield to seizures,motor disability,or some loss of vision or hearing.Sometimes,encepha-litis can be a life-threatening and proper diagnosis in an early stag...Encephalitis is a brain inflammation disease.Encephalitis can yield to seizures,motor disability,or some loss of vision or hearing.Sometimes,encepha-litis can be a life-threatening and proper diagnosis in an early stage is very crucial.Therefore,in this paper,we are proposing a deep learning model for computerized detection of Encephalitis from the electroencephalogram data(EEG).Also,we propose a Density-Based Clustering model to classify the distinctive waves of Encephalitis.Customary clustering models usually employ a computed single centroid virtual point to define the cluster configuration,but this single point does not contain adequate information.To precisely extract accurate inner structural data,a multiple centroids approach is employed and defined in this paper,which defines the cluster configuration by allocating weights to each state in the cluster.The multiple EEG view fuzzy learning approach incorporates data from every sin-gle view to enhance the model's clustering performance.Also a fuzzy Density-Based Clustering model with multiple centroids(FDBC)is presented.This model employs multiple real state centroids to define clusters using Partitioning Around Centroids algorithm.The Experimental results validate the medical importance of the proposed clustering model.展开更多
As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algori...As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algorithm is used to extract target states,a free clustering optimal P-PHD(FCO-P-PHD) filter is proposed.This method can lead to obtainment of analytical form of optimal sampling density of P-PHD filter and realization of optimal P-PHD filter without use of clustering algorithms in extraction target states.Besides,as sate extraction method in FCO-P-PHD filter is coupled with the process of obtaining analytical form for optimal sampling density,through decoupling process,a new single-sensor free clustering state extraction method is proposed.By combining this method with standard P-PHD filter,FC-P-PHD filter can be obtained,which significantly improves the tracking performance of P-PHD filter.In the end,the effectiveness of proposed algorithms and their advantages over other algorithms are validated through several simulation experiments.展开更多
文摘Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead to changes in the network topology,thereby reducing cluster stability in urban scenarios.To address this issue,we propose a clustering model based on the density peak clustering(DPC)method and sparrow search algorithm(SSA),named SDPC.First,the model constructs a fitness function based on the parameters obtained from the DPC method and deploys the SSA for iterative optimization to select cluster heads(CHs).Then,the vehicles that have not been selected as CHs are assigned to appropriate clusters by comprehensively considering the distance parameter and link-reliability parameter.Finally,cluster maintenance strategies are considered to tackle the changes in the clusters’organizational structure.To verify the performance of the model,we conducted a simulation on a real-world scenario for multiple metrics related to clusters’stability.The results show that compared with the APROVE and the GAPC,SDPC showed clear performance advantages,indicating that SDPC can effectively ensure VANETs’cluster stability in urban scenarios.
基金National Natural Science Foundation of China Nos.61962054 and 62372353.
文摘Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.
基金supported in part by the Fundamental Research Funds for the Liaoning Universities(LJ212410146025)the Graduate Science and Technology Innovation Project of University of Science and Technology Liaoning(LKDYC202310).
文摘To fully explore the potential features contained in power load data,an innovative short-term power load forecasting method that integrates data mining and deep learning techniques is proposed.Firstly,a density peak fast search algorithm optimized by time series weighting factors is used to cluster and analyze load data,accurately dividing subsets of data into different categories.Secondly,introducing convolutional block attention mechanism into the bidirectional gated recurrent unit(BiGRU)structure significantly enhances its ability to extract key features.On this basis,in order to make the model more accurately adapt to the dynamic changes in power load data,subsets of different categories of data were used for BiGRU training based on attention mechanism,and extreme gradient boosting was selected as the meta model to effectively integrate multiple sets of historical training information.To further optimize the parameter configuration of the meta model,Bayesian optimization techniques are used to achieve automated adjustment of hyperparameters.Multiple sets of comparative experiments were designed,and the results showed that the average absolute error of the method in this paper was reduced by about 8.33%and 4.28%,respectively,compared with the single model and the combined model,and the determination coefficient reached the highest of 95.99,which proved that the proposed method has a better prediction effect.
基金supported in part by the Open Fund of Intelligent Control Laboratory,China(No.ICL-2023–0202)in part by National Key R&D Program of China(Nos.2021YFC2202600,2021YFC2202603)。
文摘In distributed fusion,when one or more sensors are disturbed by faults,a common problem is that their local estimations are inconsistent with those of other fault-free sensors.Most of the existing fault-tolerant distributed fusion algorithms,such as the Covariance Union(CU)and Faulttolerant Generalized Convex Combination(FGCC),are only used for the point estimation case where local estimates and their associated error covariances are provided.A treatment with focus on the fault-tolerant distributed fusions of arbitrary local Probability Density Functions(PDFs)is lacking.For this problem,we first propose Kullback–Leibler Divergence(KLD)and reversed KLD induced functional Fuzzy c-Means(FCM)clustering algorithms to soft cluster all local PDFs,respectively.On this basis,two fault-tolerant distributed fusion algorithms of arbitrary local PDFs are then developed.They select the representing PDF of the cluster with the largest sum of memberships as the fused PDF.Numerical examples verify the better fault tolerance of the developed two distributed fusion algorithms.
文摘The authors regret Acknowledgements Firstly,the authors wish to acknowledge the academic support from Ruhr University Bochum during the first author's(Xiao Yan)research stay from 2018.11 to 2020.10,including the soft code implement and debug support from Vladislav Gudzulic and academic advising from Günther Meschke.
基金supported by the Fundamental Research Funds for the Central Universities(22120240094)Humanities and Social Science Fund of Ministry of Education China(22YJA630082).
文摘Failure mode and effect analysis(FMEA)is a preven-tative risk evaluation method used to evaluate and eliminate fail-ure modes within a system.However,the traditional FMEA method exhibits many deficiencies that pose challenges in prac-tical applications.To improve the conventional FMEA,many modified FMEA models have been suggested.However,the majority of them inadequately address consensus issues and focus on achieving a complete ranking of failure modes.In this research,we propose a new FMEA approach that integrates a two-stage consensus reaching model and a density peak clus-tering algorithm for the assessment and clustering of failure modes.Firstly,we employ the interval 2-tuple linguistic vari-ables(I2TLVs)to express the uncertain risk evaluations provided by FMEA experts.Then,a two-stage consensus reaching model is adopted to enable FMEA experts to reach a consensus.Next,failure modes are categorized into several risk clusters using a density peak clustering algorithm.Finally,the proposed FMEA is illustrated by a case study of load-bearing guidance devices of subway systems.The results show that the proposed FMEA model can more easily to describe the uncertain risk information of failure modes by using the I2TLVs;the introduction of an endogenous feedback mechanism and an exogenous feedback mechanism can accelerate the process of consensus reaching;and the density peak clustering of failure modes successfully improves the practical applicability of FMEA.
基金The author extends his appreciation to theDeputyship forResearch&Innovation,Ministry of Education in Saudi Arabia for funding this research work through the project number(IFPSAU-2021/01/17758).
文摘Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Spatial Clustering of Applications with Noise(DBSCAN).It identifies clusters by grouping the densely connected objects into one group and discarding the noise objects.It requires two input parameters:epsilon(fixed neighborhood radius)and MinPts(the lowest number of objects in epsilon).However,it can’t handle clusters of various densities since it uses a global value for epsilon.This article proposes an adaptation of the DBSCAN method so it can discover clusters of varied densities besides reducing the required number of input parameters to only one.Only user input in the proposed method is the MinPts.Epsilon on the other hand,is computed automatically based on statistical information of the dataset.The proposed method finds the core distance for each object in the dataset,takes the average of these distances as the first value of epsilon,and finds the clusters satisfying this density level.The remaining unclustered objects will be clustered using a new value of epsilon that equals the average core distances of unclustered objects.This process continues until all objects have been clustered or the remaining unclustered objects are less than 0.006 of the dataset’s size.The proposed method requires MinPts only as an input parameter because epsilon is computed from data.Benchmark datasets were used to evaluate the effectiveness of the proposed method that produced promising results.Practical experiments demonstrate that the outstanding ability of the proposed method to detect clusters of different densities even if there is no separation between them.The accuracy of the method ranges from 92%to 100%for the experimented datasets.
基金supported by the National Natural Science Foundation of China(61401475)
文摘The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.
基金Under the auspices of National Natural Science Foundation of China(No.41771537)Fundamental Research Funds for the Central Universities
文摘Earthquakes exhibit clear clustering on the earth. It is important to explore the spatial-temporal characteristics of seismicity clusters and their spatial heterogeneity. We analyze effects of plate space, tectonic style, and their interaction on characteristic of cluster.Based on data of earthquakes not less than moment magnitude(M_w) 5.6 from 1960 to 2014, this study used the spatial-temporal scan method to identify earthquake clusters. The results indicate that seismic spatial-temporal clusters can be classified into two types based on duration: persistent clusters and burst clusters. Finally, we analysed the spatial heterogeneity of the two types. The main conclusions are as follows: 1) Ninety percent of the persistent clusters last for 22-38 yr and show a high clustering likelihood;ninety percent of the burst clusters last for 1-1.78 yr and show a high relative risk. 2) The persistent clusters are mainly distributed in interplate zones, especially along the western margin of the Pacific Ocean. The burst clusters are distributed in both intraplate and interplate zones, slightly concentrated in the India-Eurasia interaction zone. 3) For the persistent type, plate interaction plays an important role in the distribution of the clusters’ likelihood and relative risk. In addition, the tectonic style further enhances the spatial heterogeneity. 4) For the burst type,neither plate activity nor tectonic style has an obvious effect on the distribution of the clusters’ likelihood and relative risk. Nevertheless,interaction between these two spatial factors enhances the spatial heterogeneity, especially in terms of relative risk.
基金The Natural Science Foundation of Hunan Province,China(No.2020JJ4601)Open Fund of the Key Laboratory of Highway Engi-neering of Ministry of Education(No.kfj190203).
文摘Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in practice,making it impossible to cluster point clouds data directly,and the filtering error is also too large.Moreover,many existing filtering algorithms have poor classification results in discontinuous terrain.This article proposes a new fast classification filtering algorithm based on density clustering,which can solve the problem of point clouds classification in discontinuous terrain.Based on the spatial density of LiDAR point clouds,also the features of the ground object point clouds and the terrain point clouds,the point clouds are clustered firstly by their elevations,and then the plane point clouds are selected.Thus the number of samples and feature dimensions of data are reduced.Using the DBSCAN clustering filtering method,the original point clouds are finally divided into noise point clouds,ground object point clouds,and terrain point clouds.The experiment uses 15 sets of data samples provided by the International Society for Photogrammetry and Remote Sensing(ISPRS),and the results of the proposed algorithm are compared with the other eight classical filtering algorithms.Quantitative and qualitative analysis shows that the proposed algorithm has good applicability in urban areas and rural areas,and is significantly better than other classic filtering algorithms in discontinuous terrain,with a total error of about 10%.The results show that the proposed method is feasible and can be used in different terrains.
基金The National Key R&D Program of China under contract No.2016YFC1401800the National Natural Science Foundation of China under contract No.41576176the National Programme on Global Change and Air-Sea Interaction under contract Nos GASI-02-PAC-YGST2-04,GASI-02-IND-YGST2-04 and GASI-02-SCS-YGST2-04
文摘The mesoscale eddy is a typical mesoscale oceanic phenomenon that transfers ocean energy. The detection and extraction of mesoscale eddies is an important aspect of physical oceanography, and automatic mesoscale eddy detection algorithms are the most fundamental tools for detecting and analyzing mesoscale eddies. The main data used in mesoscale eddy detection are sea level anomaly(SLA) data merged by multi-satellite altimeters' data.These data objectively describe the state of the sea surface height. The mesoscale eddy can be represented by a local equivalent region surrounded by an SLA closed contour, and the detection process requires the extraction of a stable closed contour structure from SLA maps. In consideration of the characteristics of mesoscale eddy detection based on SLA data, this paper proposes a new automatic mesoscale eddy detection algorithm based on clustering. The mesoscale eddy structure can be extracted by separating and filtering SLA data sets to separate a mesoscale eddy region and non-eddy region and then establishing relationships among eddy regions and mapping them on SLA maps. This paper overcomes the problem of the sensitivity of parameter setting that affects the traditional detection algorithm and does not require a sensitivity test. The proposed algorithm is thus more adaptable. An eddy discrimination mechanism is added to the algorithm to ensure the stability of the detected eddy structure and to improve the detection accuracy. On this basis, the paper selects the Northwest Pacific Ocean and the South China Sea to carry out a mesoscale eddy detection experiment. Experimental results show that the proposed algorithm is more efficient than the traditional algorithm and the results of the algorithm remain stable. The proposed algorithm detects not only stable single-core eddies but also stable multi-core eddy structures.
基金Supported by the National Natural Science Foundation of China(60573089)
文摘This paper presents an effective clustering mode and a novel clustering result evaluating mode. Clustering mode has two limited integral parameters. Evaluating mode evaluates clustering results and gives each a mark. The higher mark the clustering result gains, the higher quality it has. By organizing two modes in different ways, we can build two clustering algorithms： SECDU（Self-Expanded Clustering Algorithm based on Density Units） and SECDUF（Self-Expanded Clustering Algorithm Based on Density Units with Evaluation Feedback Section）. SECDU enumerates all value pairs of two parameters of clustering mode to process data set repeatedly and evaluates every clustering result by evaluating mode. Then SECDU output the clustering result that has the highest evaluating mark among all the ones. By applying ＂hill-climbing algorithm＂, SECDUF improves clustering efficiency greatly. Data sets that have different distribution features can be well adapted to both algorithms. SECDU and SECDUF can output high-quality clustering results. SECDUF tunes parameters of clustering mode automatically and no man＇s action involves through the whole process. In addition, SECDUF has a high clustering performance.
文摘With rapid developments in platforms and sensors technology in terms of digital cameras and video recordings,crowd monitoring has taken a considerable attentions in many disciplines such as psychology,sociology,engineering,and computer vision.This is due to the fact that,monitoring of the crowd is necessary to enhance safety and controllable movements to minimize the risk particularly in highly crowded incidents(e.g.sports).One of the platforms that have been extensively employed in crowd monitoring is unmanned aerial vehicles(UAVs),because UAVs have the capability to acquiring fast,low costs,high-resolution and real-time images over crowd areas.In addition,geo-referenced images can also be provided through integration of on-board positioning sensors(e.g.GPS/IMU)with vision sensors(digital cameras and laser scanner).In this paper,a new testing procedure based on feature from accelerated segment test(FAST)algorithms is introduced to detect the crowd features from UAV images taken from different camera orientations and positions.The proposed test started with converting a circle of 16 pixels surrounding the center pixel into a vector and sorting it in ascending/descending order.A single pixel which takes the ranking number 9(for FAST-9)or 12(for FAST-12)was then compared with the center pixel.Accuracy assessment in terms of completeness and correctness was used to assess the performance of the new testing procedure before and after filtering the crowd features.The results show that the proposed algorithms are able to extract crowd features from different UAV images.Overall,the values of Completeness range from 55 to 70%whereas the range of correctness values was 91 to 94%.
基金Professor Hong Yu at Intelligent Fishery Innovative Team(No.C202109)in School of Information Engineering of Dalian Ocean University for her support of this workfunded by the National Natural Science Foundation of China(No.31800615 and No.21933010)。
文摘Performing cluster analysis on molecular conformation is an important way to find the representative conformation in the molecular dynamics trajectories.Usually,it is a critical step for interpreting complex conformational changes or interaction mechanisms.As one of the density-based clustering algorithms,find density peaks(FDP)is an accurate and reasonable candidate for the molecular conformation clustering.However,facing the rapidly increasing simulation length due to the increase in computing power,the low computing efficiency of FDP limits its application potential.Here we propose a marginal extension to FDP named K-means find density peaks(KFDP)to solve the mass source consuming problem.In KFDP,the points are initially clustered by a high efficiency clustering algorithm,such as K-means.Cluster centers are defined as typical points with a weight which represents the cluster size.Then,the weighted typical points are clustered again by FDP,and then are refined as core,boundary,and redefined halo points.In this way,KFDP has comparable accuracy as FDP but its computational complexity is reduced from O(n^(2))to O(n).We apply and test our KFDP method to the trajectory data of multiple small proteins in terms of torsion angle,secondary structure or contact map.The comparing results with K-means and density-based spatial clustering of applications with noise show the validation of the proposed KFDP.
基金supported by the National Natural Science Foundation of China (708710157103100271171030)
文摘This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improves main swarm training models and in- creases their ability of space searching. Secondly, the radius of sub-swarms is defined adaptively according to the actual clus- tering problem, which can be useful for the niches＇ forming and searching. At last, a novel method that distributes samples to the corresponding cluster is proposed. Numerical results illustrate that this algorithm based on the density function and nichePSO could cluster unbalanced density datasets into the correct clusters auto- matically and accurately.
文摘We present a novel unsupervised integrated score framework to generate generic extractive multi- document summaries by ranking sentences based on dynamic programming （DP） strategy. Considering that cluster-based methods proposed by other researchers tend to ignore informativeness of words when they generate summaries, our proposed framework takes relevance, diversity, informativeness and length constraint of sentences into consideration comprehensively. We apply Density Peaks Clustering （DPC） to get relevance scores and diversity scores of sentences simultaneously. Our framework produces the best performance on DUC2004, 0.396 of ROUGE-1 score, 0.094 of ROUGE-2 score and 0.143 of ROUGE-SU4 which outperforms a series of popular baselines, such as DUC Best, FGB [7], and BSTM [10].
基金Project(61362021)supported by the National Natural Science Foundation of ChinaProject(2016GXNSFAA380149)supported by Natural Science Foundation of Guangxi Province,China+1 种基金Projects(2016YJCXB02,2017YJCX34)supported by Innovation Project of GUET Graduate Education,ChinaProject(2011KF11)supported by the Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education,China
文摘Outlier detection is an important task in data mining. In fact, it is difficult to find the clustering centers in some sophisticated multidimensional datasets and to measure the deviation degree of each potential outlier. In this work, an effective outlier detection method based on multi-dimensional clustering and local density(ODBMCLD) is proposed. ODBMCLD firstly identifies the center objects by the local density peak of data objects, and clusters the whole dataset based on the center objects. Then, outlier objects belonging to different clusters will be marked as candidates of abnormal data. Finally, the top N points among these abnormal candidates are chosen as final anomaly objects with high outlier factors. The feasibility and effectiveness of the method are verified by experiments.
基金Supported by the Natural Science Foundation of Yunnan Province (No. 2004B0003M)
文摘The internal structures as well as adsorption and hopping energies of monomers, dimers, trimers, tetramers, pentamers and hexamers of water on Pd（111） have been studied by density functional theory （DFT） plane-wave pseudopotential method which performs the firstprinciples quantum-mechanical calculations to explore the properties of crystals and surfaces in materials. Based on the calculations, we suppose that their absorption is via one water molecule for monomers, dimmers and trimers, but three water molecules for pentamers and hexamers. Moreover, there is one water molecule bonding with Pd atom by O atom in pentamers and hexamers, which explains why pentamers and hexamers are stable. The binding energies of polymers may be used to explain why the trimer comes close to two nearby monomers to form a stable pentamer instead of tetramer. And the difference of mobility of small water clusters is due to their different hopping energies.
基金funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R113)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Encephalitis is a brain inflammation disease.Encephalitis can yield to seizures,motor disability,or some loss of vision or hearing.Sometimes,encepha-litis can be a life-threatening and proper diagnosis in an early stage is very crucial.Therefore,in this paper,we are proposing a deep learning model for computerized detection of Encephalitis from the electroencephalogram data(EEG).Also,we propose a Density-Based Clustering model to classify the distinctive waves of Encephalitis.Customary clustering models usually employ a computed single centroid virtual point to define the cluster configuration,but this single point does not contain adequate information.To precisely extract accurate inner structural data,a multiple centroids approach is employed and defined in this paper,which defines the cluster configuration by allocating weights to each state in the cluster.The multiple EEG view fuzzy learning approach incorporates data from every sin-gle view to enhance the model's clustering performance.Also a fuzzy Density-Based Clustering model with multiple centroids(FDBC)is presented.This model employs multiple real state centroids to define clusters using Partitioning Around Centroids algorithm.The Experimental results validate the medical importance of the proposed clustering model.
文摘As to the fact that it is difficult to obtain analytical form of optimal sampling density and tracking performance of standard particle probability hypothesis density(P-PHD) filter would decline when clustering algorithm is used to extract target states,a free clustering optimal P-PHD(FCO-P-PHD) filter is proposed.This method can lead to obtainment of analytical form of optimal sampling density of P-PHD filter and realization of optimal P-PHD filter without use of clustering algorithms in extraction target states.Besides,as sate extraction method in FCO-P-PHD filter is coupled with the process of obtaining analytical form for optimal sampling density,through decoupling process,a new single-sensor free clustering state extraction method is proposed.By combining this method with standard P-PHD filter,FC-P-PHD filter can be obtained,which significantly improves the tracking performance of P-PHD filter.In the end,the effectiveness of proposed algorithms and their advantages over other algorithms are validated through several simulation experiments.
