计算机科学 ›› 2022, Vol. 49 ›› Issue (5): 165-169.doi: 10.11896/jsjkx.210800218

• 数据库&大数据&数据科学 • 上一篇    下一篇

基于菌群优化的近邻传播聚类算法研究

张宇姣1, 黄锐2, 张福泉2, 隋栋3, 张虎4   

  1. 1 太原师范学院教务处 山西 晋中030619
    2 北京理工大学计算机学院 北京100081
    3 北京建筑大学电气与信息工程学院 北京102406
    4 山西大学计算机与信息技术学院(大数据学院) 太原030006
  • 收稿日期:2021-08-25 修回日期:2021-10-30 出版日期:2022-05-15 发布日期:2022-05-06
  • 通讯作者: 张宇姣(athena251@163.com)
  • 基金资助:
    国家自然科学基金面上项目(61871204);国家自然科学青年基金(61702026)

Study on Affinity Propagation Clustering Algorithm Based on Bacterial Flora Optimization

ZHANG Yu-jiao1, HUANG Rui2, ZHANG Fu-quan2, SUI Dong3, ZHANG Hu4   

  1. 1 Academic Affairs Office,Taiyuan Normal University,Jinzhong,Shanxi 030619,China
    2 School of Computer Science,Beijing Institute of Technology,Beijing 100081,China
    3 School of Electrical and Information Engineering,Beijing University of Civil Engineering and Architecture,Beijing 102406,China
    4 School of Computer and Information Technology (School of Big Data),Shanxi University,Taiyuan 030006,China
  • Received:2021-08-25 Revised:2021-10-30 Online:2022-05-15 Published:2022-05-06
  • About author:ZHANG Yu-jiao,born in 1987,postgraduate.Her main research interests include artificial intelligence,big data analysis and computer education.
  • Supported by:
    National Natural Science Foundation of China(61871204) and National Natural Science Youth Fund(61702026).

摘要: 为了提高近邻传播聚类算法的聚类性能,采用菌群算法进行近邻传播偏向参数优化求解。首先,根据待聚类样本建立相似矩阵,初始化偏向参数;然后采用菌群算法优化偏向参数,将偏向参数作为菌落进行训练,设置轮廓(Silhouette)指标值作为菌群算法的适应度函数;接着通过菌落位置更新优化后的偏向参数,进行近邻传播聚类运算,不断更新近邻传播聚类算法的决策和潜力阵;最后获得稳定的聚类结果。实验结果表明,合理设置菌群优化算法的参数,能够获得较好的聚类效果。在电商数据集和UCI数据集中,相比常用聚类算法,所提算法能够获得更高的Silhouette指标值和最短的欧氏距离,在聚类分析中的适用度较高。

关键词: 近邻传播, 聚类, 菌群优化, 偏向参数

Abstract: In order to improve the clustering performance of the nearest neighbor propagation clustering algorithm,the flora algorithm is used to optimize the parameters of the nearest neighbor propagation bias.Firstly,the similarity matrix is established according to the samples to be clustered,and the bias parameters are initialized.Secondly,the bias parameters are optimized by flora algorithm,which is used as colony for training,and the Silhouette index value is set as fitness function of flora algorithm.Then,the optimized bias parameters are updated by colony position to perform neighbor propagation clustering operation,and the decision and potential matrix of neighbor propagation clustering algorithm are continuously updated.Finally,stable clustering results are obtained.Experimental results show that better clustering results can be obtained by setting the parameters of flora optimization algorithm reasonably.Compared with common clustering algorithms,the proposed algorithm can obtain higher Silhouette index value and the shortest Euclidean distance performance in e-commerce dataset and UCI dataset,and has high applicability in clustering analysis.

Key words: Affinity propagation, Bacterial flora optimization, Bias parameter, Clustering

中图分类号: 

  • TP391
[1]ZHANG Y L,ZHOU Y J.Overview of clustering algorithms[J].Computer Applications,2019,39 (7):1869-1882.
[2]HU F,CHEN H,WANG X.An Intuitionistic Kernel-BasedFuzzy C-Means Clustering Algorithm with Local Information for Power Equipment Image Segmentation[J].IEEE Access,2020,8:4500-4514.
[3]QIN Y B,SUN Y J,WEI X.Microblog user interest miningmethod based on text clustering and interest attenuation[J].Computer Application Research,2019,36 (5):1469-1473.
[4]XIE J Y,DING L J.Fully adaptive spectral clustering algorithm[J].Acta Electronica Sinica,2019,435 (5):26-34.
[5]XUE L X,SUN W,WANG R G,et al.Spectral clustering algorithm based on density peak optimization[J].Computer Application Research,2019,36(7):1948-1950.
[6]OLSON C F.Parallel algorithms for hierarchical clustering[J].IEEE Transactions on Pattern Analysis & Machine Intelligence,2016,12(11):1088-1092.
[7]ALEJANDRO V S,AHMED A,MOHAMMED F B.Mathe-matical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility[J].Journal of Manufacturing Systems,2020(54):74-93.
[8]LI F,JI W,TAN S,et al.Quantum Bacterial Foraging Optimization:From Theory to MIMO System Designs[J].IEEE Open Journal of the Communications Society,2020(1):1632-1646.
[9]XU Z,ZHUANG L,TIAN S,et al.Energy-driven Virtual Network Embedding Algorithm Based on Enhanced Bacterial Foraging Optimization[J].IEEE Access,2020,8:76069-76081.
[10]GUO J,GENG H J,WU Y.Research on K-means clustering algorithm based on flora optimization[J].Journal of Nanjing University of Science and Technology (Natural Science Edition),2021,45(3):314-319.
[11]WANG H L,ZHANG C G,TANG C C,et al.Optimizing the energy consumption of sensor network in production workshop based on flora optimization algorithm[J].Journal of Jinan University (Natural Science Edition),2021,35(4):370-375.
[12]LEI Q,LI T.Semi-Supervised Selective Affinity PropagationEnsemble Clustering with Active Constraints[J].IEEE Access,2020(8):46255-46266.
[13]ZHOU R,LIU Q,WANG J,et al.Modified semi-supervised affinity propagation clustering with fuzzy density fruit fly optimization[J].Neural Computing and Applications,2020(1):1-18.
[14]JIAO L,SHANG R,LIU F,et al.Fast clustering methods based on affinity propagation and density weighting[M]//Brain and Nature-Inspired Learning Computation and Recognition.2020:437-475.
[16]SUBEDI S,GANG H S,KO N Y,et al.Improving Indoor Fingerprinting Positioning With Affinity Propagation Clustering and Weighted Centroid Fingerprint[J].IEEE Access,2019,7:31738-31750.
[16]LIU X,XU Y,MONTES R,Et al.Alternative Ranking-Based Clustering and Reliability Index-Based Consensus Reaching Process for Hesitant Fuzzy Large Scale Group Decision Making[J].IEEE Transactions on Fuzzy Systems,2019,27(1):159-171.
[17]PARK S,JO H S,MUN C,et al.RRH Clustering Using Affinity Propagation Algorithm with Adaptive Thresholding and Greedy Merging in Cloud Radio Access Network[J].Sensors,2021,21(2):480-489.
[18]SMINESH C N,KANAGA E,SREEJISH A G.Augmented Affinity Propagation-Based Network Partitioning for Multiple Controllers Placement in Software Defined Networks[J].Journal of Computational and Theoretical Nanoscience,2020,17(1):228-233.
[19]LANIE B L.AFFINITY Propagation SMOTE approach for Imbalanced dataset used in Predicting Student at Risk of Low Performance[J].International Journal of Advanced Trends in Computer Science and Engineering,2020,9(4):5066-5070.
[20]TAHERI S,BOUYER A.Community Detection in Social Networks Using Affinity Propagation with Adaptive Similarity Matrix[J].Big Data,2020,8(3):11-19.
[21]YANG Y,DORN C.Affinity propagation clustering of full-field,high-spatial-dimensional measurements for robust output-only modal identification:A proof-of-concept study[J].Journal of Sound and Vibration,2020,483(2):115-123.
[22]FANTOUKH N I,ISMAIL M,BCHIR O.Automatic Determination of the Number of Clusters for Semi-Supervised Relational Fuzzy Clustering[J].International Journal of Fuzzy Logic and Intelligent Systems,2020,20(2):156-167.
[23]CHEN Y W,SHEN L L,ZHONG C M,et al.Overview of densi-ty peak clustering algorithms[J].Computer Research and Development,2020,07(2):378-394.
[24]HU S J,LU H Y,XIANG L,et al.Fuzzy clustering parthenogenetic algorithm for solving MMTSP[J].Computer Science,2020,47(6):219-224.
[25]HUANG X H,WANG C,XIONG L Y,et al.A weighted K-means clustering method integrating intra cluster and inter cluster distances[J].Chinese Journal of Computers,2019,42(12):248-260.
[1] 鲁晨阳, 邓苏, 马武彬, 吴亚辉, 周浩浩.
基于分层抽样优化的面向异构客户端的联邦学习
Federated Learning Based on Stratified Sampling Optimization for Heterogeneous Clients
计算机科学, 2022, 49(9): 183-193. https://doi.org/10.11896/jsjkx.220500263
[2] 柴慧敏, 张勇, 方敏.
基于特征相似度聚类的空中目标分群方法
Aerial Target Grouping Method Based on Feature Similarity Clustering
计算机科学, 2022, 49(9): 70-75. https://doi.org/10.11896/jsjkx.210800203
[3] 刘丽, 李仁发.
医疗CPS协作网络控制策略优化
Control Strategy Optimization of Medical CPS Cooperative Network
计算机科学, 2022, 49(6A): 39-43. https://doi.org/10.11896/jsjkx.210300230
[4] 鲁晨阳, 邓苏, 马武彬, 吴亚辉, 周浩浩.
基于DBSCAN聚类的集群联邦学习方法
Clustered Federated Learning Methods Based on DBSCAN Clustering
计算机科学, 2022, 49(6A): 232-237. https://doi.org/10.11896/jsjkx.211100059
[5] 郁舒昊, 周辉, 叶春杨, 王太正.
SDFA:基于多特征融合的船舶轨迹聚类方法研究
SDFA:Study on Ship Trajectory Clustering Method Based on Multi-feature Fusion
计算机科学, 2022, 49(6A): 256-260. https://doi.org/10.11896/jsjkx.211100253
[6] 毛森林, 夏镇, 耿新宇, 陈剑辉, 蒋宏霞.
基于密度敏感距离和模糊划分的改进FCM算法
FCM Algorithm Based on Density Sensitive Distance and Fuzzy Partition
计算机科学, 2022, 49(6A): 285-290. https://doi.org/10.11896/jsjkx.210700042
[7] 陈景年.
一种适于多分类问题的支持向量机加速方法
Acceleration of SVM for Multi-class Classification
计算机科学, 2022, 49(6A): 297-300. https://doi.org/10.11896/jsjkx.210400149
[8] 陈佳舟, 赵熠波, 徐阳辉, 马骥, 金灵枫, 秦绪佳.
三维城市场景中的小物体检测
Small Object Detection in 3D Urban Scenes
计算机科学, 2022, 49(6): 238-244. https://doi.org/10.11896/jsjkx.210400174
[9] 邢云冰, 龙广玉, 胡春雨, 忽丽莎.
基于SVM的类别增量人体活动识别方法
Human Activity Recognition Method Based on Class Increment SVM
计算机科学, 2022, 49(5): 78-83. https://doi.org/10.11896/jsjkx.210400024
[10] 朱哲清, 耿海军, 钱宇华.
面向化学结构的线段聚类算法
Line-Segment Clustering Algorithm for Chemical Structure
计算机科学, 2022, 49(5): 113-119. https://doi.org/10.11896/jsjkx.210700131
[11] 左园林, 龚月姣, 陈伟能.
成本受限条件下的社交网络影响最大化方法
Budget-aware Influence Maximization in Social Networks
计算机科学, 2022, 49(4): 100-109. https://doi.org/10.11896/jsjkx.210300228
[12] 杨旭华, 王磊, 叶蕾, 张端, 周艳波, 龙海霞.
基于节点相似性和网络嵌入的复杂网络社区发现算法
Complex Network Community Detection Algorithm Based on Node Similarity and Network Embedding
计算机科学, 2022, 49(3): 121-128. https://doi.org/10.11896/jsjkx.210200009
[13] 韩洁, 陈俊芬, 李艳, 湛泽聪.
基于自注意力的自监督深度聚类算法
Self-supervised Deep Clustering Algorithm Based on Self-attention
计算机科学, 2022, 49(3): 134-143. https://doi.org/10.11896/jsjkx.210100001
[14] 蒲实, 赵卫东.
一种面向动态科研网络的社区检测算法
Community Detection Algorithm for Dynamic Academic Network
计算机科学, 2022, 49(1): 89-94. https://doi.org/10.11896/jsjkx.210100023
[15] 张亚迪, 孙悦, 刘锋, 朱二周.
结合密度参数与中心替换的改进K-means算法及新聚类有效性指标研究
Study on Density Parameter and Center-Replacement Combined K-means and New Clustering Validity Index
计算机科学, 2022, 49(1): 121-132. https://doi.org/10.11896/jsjkx.201100148
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!