样本空间分布密度的改进次胜者受罚竞争学习算法.docVIP

基于样本空间分布密度的改进次胜者受罚竞争学习算法 摘要:针对传统次胜者受罚竞争学习(rpcl)算法忽略数据集几何结构对节点权值调整的影响,以及魏立梅等提出的新rpcl算法(魏立梅,谢维信.聚类分析中竞争学习的一种新算法.电子科学学刊,2000,22(1):13-18)引入密度来对节点的权值进行调整时,密度定义的主观性,提出基于样本空间分布密度的改进rpcl算法。该算法根据数据集样本自然分布定义样本密度,将此密度引入rpcl节点权值调整;使用uci机器学习数据库数据集以及随机生成的带有噪声点的人工模拟数据集对算法进行实验测试,对算法确定数据集类簇数目的准确率、运行时间、聚类误差平方和、聚类结果的rand指数、jaccard系数以及adjust rand index参数进行分析比较。各项实验结果显示:所提算法优于原始rpcl算法和魏立梅算法,具有更好的聚类效果,对噪声数据有很强的抗干扰性能。所提算法不仅能根据样本的自然分布确定数据集的合理类簇数目,而且能确定合适的类簇中心,提高聚类的准确性,使聚类结果尽可能快地收敛到全局最优解。 关键词:聚类;次胜者受罚竞争学习算法;样本密度;聚类数目;聚类中心 improvement rival penalized competitive learning algorithm based on pattern distribution of samples 英文作者名xie juan-ying1,2*, guo wen-juan1, xie wei-xin2,3, gao xin-bo2 英文地址(1.school of computer science, shaanxi normal university, xian shaanxi 710062, china; 2.school of electronic engineering, xidian university, xian shaanxi 710071, china; 3.school of information engineering, shenzhen university, shenzhen guangdong 518060, china) abstract: the original rival penalized competitive learning (rpcl) algorithm ignores the influence of the geometry structure of a dataset on the weight variation of its nodes. a new rpcl algorithm proposed by wei limei et al. (wei limei, xie weixin. a new competitive learning algorithm for clustering analysis. journal of electronics, 2000, 22(1): 13-18) overcame the drawback of the original rpcl by introducing the density of samples to adjust the weights of nodes, while the density was not much objective. this paper defined a new density for a sample according to the pattern distribution of samples in a dataset, and introduced the density into the adjusting for the weights of nodes in rpcl to overcome the disadvantages of the available rpcl algorithms. the authors improved rpcl algorithm was tested on some well-known datasets from uci machine learning repository and on some synthetic data sets with noisy samples. the accuracy of determining the number of clusters of a dataset and the run time and the clustering error of the algorithms were compa