首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于改进自监督学习群体智能(ISLCI)的高性能聚类算法
引用本文:曾令伟,伍振兴,杜文才.基于改进自监督学习群体智能(ISLCI)的高性能聚类算法[J].重庆邮电大学学报(自然科学版),2016,28(1):131-137.
作者姓名:曾令伟  伍振兴  杜文才
作者单位:1. 琼州学院 电子信息工程学院,海南 三亚,572022;2. 海南大学 信息科学技术学院,海南 海口,570228
基金项目:2014年海南省高等学校科学研究项目(HNKY2014-65)
摘    要:针对现有数据聚类算法(如 K -means)易陷入局部最优和聚类质量不佳的问题,提出一种结合改进自监督学习群体智能(improved self supervised learning collection intelligence,ISLCI)和 K 均值(K -means)的高性能聚类算法。已有的自监督学习群体智能演化方案具有计算效率和聚类质量高的优点,但当应用于数据聚类时,收敛速度较慢且极易陷入局部最优。为 ISLCI 加入突变操作,增加其样本多样性来降低早熟的概率,提高最优解的求解质量;计算每个样本的行为方程,获得其行为结果;通过轮盘赌方案来选择群体智能学习的对象和群体中其他样本学习目标对象的属性来提高自己。同时,利用 K-means 操作提高其收敛速度,提高算法计算效率。对比试验结果表明,本算法具有收敛速度快、聚类质量高、不易陷入局部最优的特点。

关 键 词:自监督学习群体智能  数据聚类  突变操作  簇内距离  函数评价次数
收稿时间:2014/12/10 0:00:00
修稿时间:2015/10/9 0:00:00

Improved self supervised learning collection intelligence based high performance data clustering approach
ZENG Lingwei,WU Zhenxing and DU Wencai.Improved self supervised learning collection intelligence based high performance data clustering approach[J].Journal of Chongqing University of Posts and Telecommunications,2016,28(1):131-137.
Authors:ZENG Lingwei  WU Zhenxing and DU Wencai
Institution:College of Information and Electronic,Qiongzhou University,Sanya 572022 P.R.China,College of Information and Electronic,Qiongzhou University,Sanya 572022 P.R.China and College of Information Science & Technology,Hainan University,Haikou 570228 P.R.china
Abstract:For the problems that traditional data clustering approaches easily converge to local optima and the quality of the solution is not good,a high performance clustering approach which combines the improved self supervised learning collection intelligence and K-means is proposed. The existing self supervised learning approach has the advantage of computation efficiency and quality of clustering,but has the problem of low speed of convergence and trapping in local optimal easily.Firstly,a mutation mechanism is added to ISLCI that aims to reduce the probability of optima and the quality of optimal solution is improved;Secondly,the action function of each candidate is computed.Lastly,the object of the collection intelligence learning is selected by roulette approach,and the others in the population learn from the object to improve themselves.The converge speed is speeded up with K-means approach and the computation efficiency is improved.The compared experiment result demonstrated that the proposed approach has the characteristic of converge quickly,good quality of clustering solution and low probability to fall to local optima.
Keywords:self supervised learning collection intelligence  data clustering  mutation operation  intra-cluster distance  fitness function evaluation
本文献已被 万方数据 等数据库收录!
点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号