期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Self-Expanded Clustering Algorithm Based on Density Units with Evaluation Feedback Section 被引量:1
1
作者 YU Yongqian ZHAO Xiangguo CHEN Hengyue WANG Bin YU Ge WANG Guoren 《Wuhan University Journal of Natural Sciences》 CAS 2006年第5期1069-1075,共7页
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. 展开更多
关键词 clustering clustering result evaluating density unit hillclimbing algorithm
下载PDF
Substation clustering based on improved KFCM algorithm with adaptive optimal clustering number selection
2
作者 Yanhui Xu Yihao Gao +4 位作者 Yundan Cheng Yuhang Sun Xuesong Li Xianxian Pan Hao Yu 《Global Energy Interconnection》 EI CSCD 2023年第4期505-516,共12页
The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection an... The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution. 展开更多
关键词 Load substation clustering Simulated annealing genetic algorithm Kernel fuzzy C-means algorithm clustering evaluation
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部