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.展开更多
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 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.展开更多
To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retr...To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retrieval of large image databases. CMA takes advantages of k-means and self-adaptive algorithms. It is simple and works without any user interactions. There are two main stages in this algorithm. In the first stage, it classifies images in a database into several clusters, and automatically gets the necessary parameters for the next stage-k-means iteration. The CMA algorithm is tested on a large database of more than ten thousand images and compare it with k-means algorithm. Experimental results show that this algorithm is effective in both precision and retrieval time.展开更多
Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in diffe...Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in different fields.In allusion to this,an elasto-plastic constitutive model based on clustering radial basis function neural network(BC-RBFNN) was proposed for moderate sandy clay according to its properties.Firstly,knowledge base was established on triaxial compression testing data;then the model was trained,learned and emulated using knowledge base;finally,predicting results of the BC-RBFNN model were compared and analyzed with those of other intelligent model.The results show that the BC-RBFNN model can alter the training and learning velocity and improve the predicting precision,which provides possibility for engineering practice on demanding high precision.展开更多
The Nei's improved genetic distance(DA)and gene flow(Nm)were measured using sixteen microsatellite markers.Dendograms based on DA genetic distance using the neighbor-joining(NJ)method and STRUCTURE program were co...The Nei's improved genetic distance(DA)and gene flow(Nm)were measured using sixteen microsatellite markers.Dendograms based on DA genetic distance using the neighbor-joining(NJ)method and STRUCTURE program were constructed to analyze the genetic structure and relationship among 10 Chinese indigenous chicken breeds.The results showed that dendograms of DA genetic distance using the NJ method divided the 10 chicken breeds into two main clusters;one consisted of breeds of low weight body(CHA,TTB,XIA,GUS and BAI),the other contained heavier breeds(LAN,DAG,YOU,XIS and LUY).In the lighter breeds,TIB and CHA clustered together,as did XIA and GUS.In the heavier breeds,XIS and LUY was clustered together in one branch,but LAN,DAG and YOU clustered in independent branches.The results were consistent with Nm estimates among the 10 indigenous chicken breeds.The STRUCTURE program properly inferred the presence of genetic structure despite not pre-defining the origin of individuals.The genetic cluster inferred by STRUCTURE was basically the same as that from the DA distance clustering method.An advantage of the STRUCTURE program was its ability to identify the migrants and admixed individuals in the 10 chicken populations;this could not be achieved by use of the DA distance clustering method.展开更多
为解决在IIoT(industrial internet of things)环境下,现有的调度算法调度工作流中通信频繁、数据传输量大的任务所带来的完工时间上升、成本增加等影响的问题,提出一种基于聚类的工作流多雾协同调度算法。通过二分K均值算法对工作流中...为解决在IIoT(industrial internet of things)环境下,现有的调度算法调度工作流中通信频繁、数据传输量大的任务所带来的完工时间上升、成本增加等影响的问题,提出一种基于聚类的工作流多雾协同调度算法。通过二分K均值算法对工作流中的任务进行聚类,基于聚类结果,在多个雾服务器之间使用改进的免疫粒子群优化算法进行任务调度。实验结果表明,该算法相比其它一些传统的调度算法在完工时间、成本、负载均衡方面都有一定提升。展开更多
新型配电系统柔性消弧装置及定位技术均需充分挖掘相电流暂态特征来实现选相、选线和故障定位。针对此问题,对新型配电系统单相接地故障相电流暂态分布特性进行分析,提出了一种基于相电流多维时频分布特征差异的新型配电系统单相接地故...新型配电系统柔性消弧装置及定位技术均需充分挖掘相电流暂态特征来实现选相、选线和故障定位。针对此问题,对新型配电系统单相接地故障相电流暂态分布特性进行分析,提出了一种基于相电流多维时频分布特征差异的新型配电系统单相接地故障定位新方法。依据故障相电流故障暂态量与非故障相电流故障暂态量的差异性,通过灰色关联度算法完成故障选相;对各出线始端监测点以及疑似故障馈线分支监测点的相电流暂态波形进行26维多维时频特征的提取,通过经方差优化的t-分布近邻嵌入算法(variance-optimized t-distributed stochastic neighbor embedding,VTSNE)进行筛选和降维,并对处理后的特征数据进行基于密度的有噪空间聚类算法(density-based special clustering of application with noise,DBSCAN)聚类完成故障选线和故障区段定位。该方法在某绿色港口10 kV新型配电系统模型中得到验证,在不同故障初相角、不同过渡电阻等故障场景下均可准确可靠定位故障位置,对采样同步精度及采样频率要求低,易于工程实现。展开更多
基金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.
基金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 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.
基金This project was supported by National High Tech Foundation of 863 (2001AA115123)
文摘To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retrieval of large image databases. CMA takes advantages of k-means and self-adaptive algorithms. It is simple and works without any user interactions. There are two main stages in this algorithm. In the first stage, it classifies images in a database into several clusters, and automatically gets the necessary parameters for the next stage-k-means iteration. The CMA algorithm is tested on a large database of more than ten thousand images and compare it with k-means algorithm. Experimental results show that this algorithm is effective in both precision and retrieval time.
基金Project(07031B) supported by the Scientific Research Fund of Central South University of Forestry and TechnologyProject(06C843) supported by the Scientific Research Fund of Hunan Provincial Education Department
文摘Application research of neural networks to geotechnical engineering has become a hotspot nowadays.General model may not reach the predicting precision in practical application due to different characteristics in different fields.In allusion to this,an elasto-plastic constitutive model based on clustering radial basis function neural network(BC-RBFNN) was proposed for moderate sandy clay according to its properties.Firstly,knowledge base was established on triaxial compression testing data;then the model was trained,learned and emulated using knowledge base;finally,predicting results of the BC-RBFNN model were compared and analyzed with those of other intelligent model.The results show that the BC-RBFNN model can alter the training and learning velocity and improve the predicting precision,which provides possibility for engineering practice on demanding high precision.
基金supported by the Program of National Technological Basis from Ministry of Science and Technology of China(No.2005DKA21101)the National Natural Science Foundation of China(No.30700572)
文摘The Nei's improved genetic distance(DA)and gene flow(Nm)were measured using sixteen microsatellite markers.Dendograms based on DA genetic distance using the neighbor-joining(NJ)method and STRUCTURE program were constructed to analyze the genetic structure and relationship among 10 Chinese indigenous chicken breeds.The results showed that dendograms of DA genetic distance using the NJ method divided the 10 chicken breeds into two main clusters;one consisted of breeds of low weight body(CHA,TTB,XIA,GUS and BAI),the other contained heavier breeds(LAN,DAG,YOU,XIS and LUY).In the lighter breeds,TIB and CHA clustered together,as did XIA and GUS.In the heavier breeds,XIS and LUY was clustered together in one branch,but LAN,DAG and YOU clustered in independent branches.The results were consistent with Nm estimates among the 10 indigenous chicken breeds.The STRUCTURE program properly inferred the presence of genetic structure despite not pre-defining the origin of individuals.The genetic cluster inferred by STRUCTURE was basically the same as that from the DA distance clustering method.An advantage of the STRUCTURE program was its ability to identify the migrants and admixed individuals in the 10 chicken populations;this could not be achieved by use of the DA distance clustering method.
文摘为解决在IIoT(industrial internet of things)环境下,现有的调度算法调度工作流中通信频繁、数据传输量大的任务所带来的完工时间上升、成本增加等影响的问题,提出一种基于聚类的工作流多雾协同调度算法。通过二分K均值算法对工作流中的任务进行聚类,基于聚类结果,在多个雾服务器之间使用改进的免疫粒子群优化算法进行任务调度。实验结果表明,该算法相比其它一些传统的调度算法在完工时间、成本、负载均衡方面都有一定提升。
文摘新型配电系统柔性消弧装置及定位技术均需充分挖掘相电流暂态特征来实现选相、选线和故障定位。针对此问题,对新型配电系统单相接地故障相电流暂态分布特性进行分析,提出了一种基于相电流多维时频分布特征差异的新型配电系统单相接地故障定位新方法。依据故障相电流故障暂态量与非故障相电流故障暂态量的差异性,通过灰色关联度算法完成故障选相;对各出线始端监测点以及疑似故障馈线分支监测点的相电流暂态波形进行26维多维时频特征的提取,通过经方差优化的t-分布近邻嵌入算法(variance-optimized t-distributed stochastic neighbor embedding,VTSNE)进行筛选和降维,并对处理后的特征数据进行基于密度的有噪空间聚类算法(density-based special clustering of application with noise,DBSCAN)聚类完成故障选线和故障区段定位。该方法在某绿色港口10 kV新型配电系统模型中得到验证,在不同故障初相角、不同过渡电阻等故障场景下均可准确可靠定位故障位置,对采样同步精度及采样频率要求低,易于工程实现。
