期刊文献+

结合柯西分布和蚁狮算法改进的模糊聚类算法 被引量:1

Fuzzy Clustering Algorithm Combined with Cauchy Distribution and Ant Lion Algorithm
下载PDF
导出
摘要 针对模糊聚类对初始聚类中心依赖性较强且易陷入局部最优解的问题,提出了一种结合柯西分布和蚁狮算法改进的模糊聚类算法(CALOFCM)。引入柯西分布函数变异蚁狮算法,使得个体受局部极值点的约束力下降,从而增加跳出局部最优解的概率。使用优化后的蚁狮算法生成的精英蚁狮作为模糊C均值(fuzzy C-means,FCM)算法的初始聚类中心。分别在人工数据集和UCI数据集上进行了实验验证,并与K-means、DBSCAN、FCM、ALOFCM算法以及提出的算法进行实验对比。结果表明改进的算法获得了较好的聚类结果且在准确率、调整兰德系数和标准化互信息等评价指标上具有良好的聚类性能。 Aiming at the problem that fuzzy clustering depends strongly on the initial clustering centers and easy to fall into local optimal solutions,a fuzzy clustering algorithm combined with Cauchy distribution and ant lion algorithm(CALOFCM)is proposed.The Cauchy distribution function variant ant lion optimization algorithm is introduced,which reduces the binding force of individuals by local extreme points,thus increasing the probability of escaping from the local optimum.The elite ant lions generated by the optimized ant lion algorithm are used as the initial clustering centers of the fuzzy C-means(FCM)algorithm.The comparison experiments of artificial data sets and UCI data sets show that com-pared with K-means,DBSCAN,FCM,ALOFCM algorithm,the proposed algorithm obtains better clustering effect and has good clustering performance in accuracy,adjusted rand index and normalized mutual information.
作者 吴辰文 王莎莎 曹雪同 WU Chenwen;WANG Shasha;CAO Xuetong(School of Electronics and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)
出处 《计算机工程与应用》 CSCD 北大核心 2023年第17期91-98,共8页 Computer Engineering and Applications
基金 甘肃省自然科学基金(21JR7RA293) 国家自然科学基金(62241204)。
关键词 数据挖掘 模糊C均值算法 蚁狮算法 柯西分布 data mining fuzzy C-means(FCM) ant lion optimization algorithm(ALO) Cauchy distribution
  • 相关文献

参考文献6

二级参考文献58

  • 1王惠文.变量多重相关性对主成分分析的危害[J].北京航空航天大学学报,1996,22(1):65-70. 被引量:17
  • 2李惠,周文松,欧进萍,杨永顺.大型桥梁结构智能健康监测系统集成技术研究[J].土木工程学报,2006,39(2):46-52. 被引量:138
  • 3Anil K J. Data clustering:50 years beyond K-Means[J].Pattern Recognition Letters,2010,(08):651-666.
  • 4Likas A,Vlassis M,Verbeek J. The global K-means clustering algorithm[J].Pattern Recognition,2003,(02):451-461.doi:10.1016/S0031-3203(02)00060-2.
  • 5Selim S Z,Al-Sultan K S. Analysis of global K-means,an incremental heuristic for minimum sum-of-squares clustering[J].Journal of Classification,2005,(22):287-310.
  • 6Bellman R,Dreyfus S. Applied dynamic programming[M].Princeton,New Jersey:Princeton University Press,1962.
  • 7Aloise D,Deshpande A,Hansen P. NP-hardness of euclidean sum-of-squares clustering[J].Machine Learning,2009,(02):245-248.
  • 8Mahajan M,Nimbor P,Varadarajan K. The planar K-means problem is NP-hard[J].Lecture Notes in Computer Science,2009,(5431):274-285.
  • 9Ball G,Hall D. ISODATA,a novel method of data analysis and pattern classification[Technical rept. NTIS AD 699616. ][M].California:Stanford Research Institute,1965.
  • 10WANG Cheng,LI Jiao-jiao,BAI Jun-qing. Max-Min K- means Clustering Algorithm and Application in Post-processing of Scientific Computing[A].Napoli,2011.7-9.

共引文献379

同被引文献13

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部