

浏览全部资源
扫码关注微信
1. 长安大学电子与控制工程学院,西安,710064
2. 陕西省道路交通智能检测与装备工程技术研究中心,西安,710064
Online First:10 September 2020,
Published:2020
移动端阅览
Hybrid Iterative K-Means Clustering with Improved Moth-Flame Optimi-ation[J]. 2020, 54(9): 32-39.
Hybrid Iterative K-Means Clustering with Improved Moth-Flame Optimi-ation[J]. 2020, 54(9): 32-39. DOI: 10.7652/xjtuxb202009003.
针对现有K均值聚类(KMC)算法在选取初始聚类中心时随机性较大、全局搜索能力差、聚类精度低等问题
提出了一种引入改进飞蛾扑火的K均值交叉迭代聚类(IMFO-KMC)算法。利用最大最小距离积法初始化聚类中心
避免了KMC算法对随机初始聚类中心较为敏感的问题; 利用样条插值预测的思想改进飞蛾扑火算法
提高了算法的收敛速度及寻优精度; 以类内平均距离为适应度函数
引导插值扑火算法优化KMC迭代过程中的聚类中心
提高了聚类精度。将IMFO-KMC与KMC、K-means++算法、模糊c均值聚类算法在国际标准数据集Iris、Wine和Seeds上进行了实验对比
结果表明:IMFO-KMC算法在Iris数据集上的性能提升最为明显
相比其他算法准确率提高了0.67%~4.18%
标准化互信息提高了1.5%~4.01%。
A new K-means clustering algorithm with improved moth-flame optimi-ation is proposed to solve the problem that the current K-means clustering(KMC)algorithm has great randomness in selecting the initial clustering center
poor global search ability and low clustering accuracy. The maximum and minimum distance function is adopted to initiali-e the clustering center to avoid the problem that KMC algorithm is sensitive to the random initial clustering center. Then the moth-flame optimi-ation is improved by spline interpolation to heighten the convergence rate and optimi-ation accuracy. The average distance category is taken as the fitness function to guide interpolation moth-flame optimi-ation to optimi-e the clustering center in the process of KMC iteration so as to improve the clustering accuracy. Compared with KMC algorithm
K-means++ algorithm and fu--y c-means clustering algorithm on the international standard data sets Iris
Wine and Seeds
the experimental results show that the IMFO
YU Q Y, LUO Y L, CHEN C M, et al. Outlier-eliminated k-means clustering algorithm based on differential privacy preservation [J]. Applied Intelligence, 2016, 45(4): 1179-1191.
PATEL G K, DABHI V K, PRAJAPATI H B. Clustering using a combination of particle swarm optimization and K-means [J]. Journal of Intelligent Systems, 2017, 26(3): 457-469.
陈兴蜀, 吴小松, 王文贤, 等. 基于特征关联度的K-means初始聚类中心优化算法 [J]. 四川大学学报(工程科学版), 2015, 47(1): 13-19.
CHEN Xingshu, WU Xiaosong, WANG Wenxian, et al. An improved initial cluster centers selection algorithm for K-means based on features correlative degree [J]. Journal of Sichuan University(Engineering Science Edition), 2015, 47(1): 13-19.
肖洋, 李平, 王鹏, 等. 基于最小方差的自适应K-均值初始化方法 [J]. 长春理工大学学报(自然科学版), 2015, 38(5): 140-144, 149.
XIAO Yang, LI Ping, WANG Peng, et al. An adaptive K-means initialization method based on minimum deviation [J]. Journal of Changchun University of Science and Technology(Natural Science Edition), 2015, 38(5): 140-144, 149.
郑丹, 王潜平. K-means初始聚类中心的选择算法 [J]. 计算机应用, 2012, 32(8): 2186-2188, 2192.
ZHENG Dan, WANG Qianping. Selection algorithm for K-means initial clustering center [J]. Journal of Computer Applications, 2012, 32(8): 2186-2188, 2192.
张强, 王红卫, 陈游, 等. 基于自适应权重的RFCM聚类算法 [J]. 微电子学与计算机, 2016, 33(12): 80-84.
ZHANG Qiang, WANG Hongwei, CHEN You, et al. Rough fuzzy c-means clustering algorithm based on self-adaptive weights [J]. Microelectronics Computer, 2016, 33(12): 80-84.
于金霞, 蔡自兴, 段琢华. 一种用于激光雷达特征提取的改进遗传聚类算法 [J]. 模式识别与人工智能, 2008, 21(4): 535-540.
YU Jinxia, CAI Zixing, DUAN Zhuohua. An improved genetic clustering algorithm for feature extraction of laser scanner [J]. Pattern Recognition and Artificial Intelligence, 2008, 21(4): 535-540.
喻金平, 郑杰, 梅宏标. 基于改进人工蜂群算法的K均值聚类算法 [J]. 计算机应用, 2014, 34(4): 1065-1069, 1088.
YU Jinping, ZHENG Jie, MEI Hongbiao. K-means clustering algorithm based on improved artificial bee colony algorithm [J]. Journal of Computer Applications, 2014, 34(4): 1065-1069, 1088.
MIRJALILI S. Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm [J]. Knowledge-Based Systems, 2015, 89: 228-249.
KHALILPOURAZARI S, PASANDIDEH S H R. Multi-item EOQ model with nonlinear unit holding cost and partial backordering: moth-flame optimization algorithm [J]. Journal of Industrial and Production Engineering, 2017, 34(1): 42-51.
SINGH P, PRAKASH S. Optical network unit placement in Fiber-Wireless(FiWi)access network by Moth-Flame optimization algorithm [J]. Optical Fiber Technology, 2017, 36: 403-411.
ALLAM D, YOUSRI D A, ETEIBA M B. Parameters extraction of the three diode model for the multi-crystalline solar cell/module using moth-flame optimization algorithm [J]. Energy Conversion and Management, 2016, 123: 535-548.
YILDIZ B S, YILDIZ A R. Moth-flame optimization algorithm to determine optimal machining parameters in manufacturing processes [J]. Materials Testing, 2017, 59(5): 425-429.
ZHANG L, MISTRY K, NEOH S C, et al. Intelligent facial emotion recognition using moth-firefly optimization [J]. Knowledge-Based Systems, 2016, 111: 248-267.
GUO L, LI X R, HUANG H, et al. Intelligent penetration of UAV based on moth suppression algorithm [C]∥2018 Chinese Automation Congress(CAC). Piscataway, NJ, USA: IEEE, 2018: 4044-4049.
SHINODA M, MIYATA Y. PSO-based stability analysis of unreinforced and reinforced soil slopes using non-circular slip surface [J]. Acta Geotechnica, 2019, 14(3): 907-919.
GHAMISI P. A novel method for segmentation of remote sensing images based on hybrid GAPSO [J]. International Journal of Computer Applications, 2011, 29(2): 7-14.
靳一, 王继武, 吴乐南. 基于IM-SAPSO和SVM的EBPSK检测器设计 [J]. 应用科学学报, 2012, 30(2): 141-145.
JIN Yi, WANG Jiwu, WU Lenan. EBPSK signal detector based on IM-SAPSO and SVM [J]. Journal of Applied Sciences, 2012, 30(2): 141-145.
BAHMANI B, MOSELEY B, VATTANI A, et al. Scalable k-means++ [J]. Proceedings of the VLDB Endowment, 2012, 5(7): 622-633.
肖春景, 张敏. 基于减法聚类与模糊c-均值的模糊聚类的研究 [J]. 计算机工程, 2005, 31(S07): 135-137.
XIAO Chunjing, ZHANG Min. Research on fuzzy clustering based on subtractive clustering and fuzzy c-均值的模糊聚类的研究 [J]. 计算机工程, 2005, 31(S07): 135-137.
XIAO Chunjing, ZHANG Min. Research on fuzzy clustering based on subtractive clustering and fuzzy ans [J]. Computer Engineering, 2005, 31(S7): 135-137.
卢纹岱. SPSS for Windows统计分析 [M]. 北京: 电子工业出版社, 2006: 429-438.
0
Views
5
下载量
12
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621