跳跃跟踪SSA交叉迭代AP聚类算法

黄鹤; 李文龙; 杨澜; 王会峰; 高涛; 陈婷

doi:10.12263/DZXB.20220209

您当前的位置：

首页 >

文章列表页 >

跳跃跟踪SSA交叉迭代AP聚类算法

学术论文 | 更新时间：2025-12-11

- 跳跃跟踪SSA交叉迭代AP聚类算法
- Jump Tracking SSA Hybrid Iterative AP Clustering Algorithm
- 电子学报 2024年52卷第3期页码：977-990
- 作者机构：
  
  1.长安大学，陕西西安710064
  2.西安市智慧高速公路信息融合与控制重点实验室，陕西西安710064
- 作者简介：
  
  [ "黄鹤男，1979年2月出生，现为长安大学教授，博士生导师，主要研究方向是无人机测控、信息融合等.E-mail: huanghe@chd.edu.cn" ]
  [ "李文龙男，1999年4月出生，现为长安大学硕士研究生，主要研究方向是路径规划、目标跟踪等.E-mail: 691508561@qq.com" ]
  [ "杨澜女，1985年7月出生，现为长安大学信息工程学院高级工程师，主要研究方向是车联网.E-mail: lanyang@chd.edu.cn" ]
  王会峰男，1976年12月出生，现为长安大学教授，博士生导师，主要研究方向是机器视觉与图像处理技术.E-mail: hfwang@chd.edu.cn
  高涛男，现为长安大学教授信息工程学院教授.主要研究方向是图像处理、模式识别、人工智能.中国电子学会会员编号：E190026033M.E-mail: gtnwpu@126.com
  陈婷女，现为长安大学教授信息工程学院副教授.主要研究方向是无线通信、智能交通系统、模式识别.E-mail: tchenchd@126.com
- 基金信息：
  
  国家重点研发计划项目(2021YFB2501200);国家自然科学基金面上项目(52172379;52172324);陕西省重点研发计划项目(2021SF-483);陕西省博士后科研项目(2018BSHYDZZ64);中央高校基本科研业务费资助项目(300102240203)
- DOI：10.12263/DZXB.20220209
  中图分类号： TP301.6
- 收稿：2022-03-01，
  
  修回：2022-11-02，
  
  纸质出版：2024-03-25
- 稿件说明：
移动端阅览
黄鹤,李文龙,杨澜,等.跳跃跟踪SSA交叉迭代AP聚类算法[J].电子学报,2024,52(03):977-990.

HUANG He, LI Wen-long, YANG Lan, et al.Jump Tracking SSA Hybrid Iterative AP Clustering Algorithm[J].Acta Electronica Sinica, 2024, 52(03): 977-990.
黄鹤,李文龙,杨澜,等.跳跃跟踪SSA交叉迭代AP聚类算法[J].电子学报,2024,52(03):977-990. DOI：10.12263/DZXB.20220209

HUANG He, LI Wen-long, YANG Lan, et al.Jump Tracking SSA Hybrid Iterative AP Clustering Algorithm[J].Acta Electronica Sinica, 2024, 52(03): 977-990. DOI：10.12263/DZXB.20220209

摘要

针对传统近邻传播聚类算法以数据点对之间的相似度作为输入度量，由于需要预设偏向参数

和阻尼系数

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847749&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847739&type=

1.69333339

，算法精度无法精确控制的问题，提出了一种跳跃跟踪麻雀搜索算法优化的交叉迭代近邻传播聚类方法.首先，针对麻雀搜索算法中发现者和加入者位置更新不足的问题，设计了一种跳跃跟踪优化策略，通过考虑偏好阻尼因子的跳跃策略设计大步长更新发现者，增加麻雀搜索算法的全局勘探能力和寻优速度，加入者设计动态小步长跟踪领头雀更新位置，同时，利用自适应种群划分机制更新发现者和加入者的比重，增加算法的后期局部开发能力和寻优速度；其次，设计基于扰动因子的Tent映射，在此基础上增加3个参数，使映射分布范围增大，并避免了陷入小周期点和不稳周期点；最后，引入轮廓系数作为评价函数，跳跃跟踪麻雀搜索算法自动寻找较优的

和

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847749&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847739&type=

1.69333339

，代替手动输入参数，并融合基于扰动因子的Tent映射优化近邻传播算法，交叉迭代确定最优簇数.使用多种算法聚类University of California Irvine 数据集的10种公共数据集，仿真结果表明，本文提出的聚类算法与经典近邻传播算法、基于差分改进的仿射传播聚类算法、基于麻雀搜索算法优化的近邻传播聚类算法和进化近邻传播算法相比具有更优的搜索效率以及聚类精度.对国家信息数据进行了聚类分析，提出的方法更加准确有效合理，具有较好的应用价值.

Abstract

Aiming at the problem that the traditional affinity propagation (AP) clustering algorithm takes the similarity between data points as the input measure

and the accuracy of the algorithm cannot be accurately controlled due to the need to preset the preference (

) and the damping coefficient (

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847757&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847761&type=

1.69333339

)

a jump tracking sparrow search algorithm (JTSSA) optimized hybrid iterative AP clustering method (JTSSA-AP) is proposed. Firstly

in order to solve the problem of insufficient update of the position of the producers and the scroungers in sparrow search algorithm (SSA)

a jump tracking optimization strategy is designed. By considering the preference factor

the jump strategy updates the producers in a large step

which increases the global exploration ability and optimization speed of SSA algorithm. The scroungers dynamically track the update position of the leading sparrow in a small step

and uses the adaptive population division mechanism to update the proportion of the producers and the scroungers

which increases the late local development ability and optimization speed of the algorithm. Secondly

on the basis of the original Tent mapping

the disturbance

factor is added and three parameters are added

so that the mapping distribution range is increased and the small periodic point and unstable periodic point are avoided. Finally

the silhouette index is introduced as the evaluation function

JTSSA is designed to automatically find better

and

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847757&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=59847761&type=

1.69333339

instead of manual input parameters

the tent map based on disturbance factor optimize the AP clustering

and the optimal number of clusters is determined by hybrid iteration. Multiple algorithms are utilized to cluster the 10 public datasets of the university of California Irvine dataset. Simulation results indicate that the proposed clustering algorithm in this paper exhibits superior search efficiency and clustering accuracy compared to the AP algorithm

the AP clustering algorithm based on differential evolution

the AP clustering algorithm optimized by SSA

and the evolutionary affinity propagation. Cluster analysis is conducted on country data

and the proposed method demonstrates greater accuracy

effectiveness

and rationality

showcasing considerable practical value.

关键词

Keywords

references

PENG X , FENG J S , ZHOU J T , et al . Deep subspace clustering [J ] . IEEE Transactions on Neural Networks and Learning Systems , 2020 , 31 ( 12 ): 5509 - 5521 .

CHEN Y W , HU X L , FAN W T , et al . Fast density peak clustering for large scale data based on kNN [J ] . Knowledge-Based Systems , 2020 , 187 : 104824 .

NASIR A , MASHOR A S , MOHAMED M , et al . Enhanced kmeans clustering algorithm for malaria slide image segmentation [J ] . Journal of Advanced Research in Fluid Mechanics and Thermal Sciences , 2018 , 42 ( 1 ): 1 - 15 .

YOON J , JOUNG S . A big data based cosmetic recommendation algorithm [J ] . Journal of System and Management Sciences , 2020 , 10 ( 2 ): 40 - 52 .

ZHANG G , ZHANG C C , ZHANG H Y . Improved K-means algorithm based on density Canopy [J ] . Knowledge-Based Systems , 2018 , 145 : 289 - 297 .

XI L , ZHANG F B . An adaptive artificial-fish-swarm-inspired fuzzy C-means algorithm [J ] . Neural Computing and Applications , 2020 , 32 ( 22 ): 16891 - 16899 .

CHEN Y W , ZHOU L D , BOUGUILA N , et al . BLOCK-DBSCAN: Fast clustering for large scale data [J ] . Pattern Recognition , 2021 , 109 : 107624 .

FREY B J , DUECK D . Clustering by passing messages between data points [J ] . Science , 2007 , 315 ( 5814 ): 972 - 976 .

DAGHER I , MIKHAEL S , AL-KHALIL O . Gabor face clustering using affinity propagation and structural similarity index [J ] . Multimedia Tools and Applications , 2021 , 80 ( 3 ): 4719 - 4727 .

HAN Y M , FAN C Y , GENG Z Q . Energy efficient building envelope using novel RBF neural network integrated affinity propagation [J ] . Energy , 2020 , 209 : 118414 .

黄鹤 , 李文龙 , 杨澜 , 等 . DHSSA优化的K均值互补迭代车型信息数据聚类 [J ] . 汽车工程 , 2022 , 44 ( 05 ): 691 - 700, 729 .

HUANG H , LI W L , YANG L , et al . K-means complementary iterative vehicle information data clustering based on DHSSA optimization [J ] . Automotive Engineering , 2022 , 44 ( 05 ): 691 - 700, 729 . (in Chinese)

黄鹤 , 李潇磊 , 杨澜 , 等 . 引入改进蝠鲼觅食优化算法的水下无人航行器三维路径规划 [J ] . 西安交通大学学报 , 2022 , 56 ( 7 ): 9 - 18 .

HUANG H , LI X L , YANG L , et al . Three dimensional path planning of unmanned underwater vehicle based on improved manta ray foraging optimization algorithm [J ] . Journal of Xi'an Jiaotong University , 2022 , 56 ( 7 ): 9 - 18 . (in Chinese)

LIU Y C , LIU J C , JIN Y C . An affinity propagation clustering based particle swarm optimizer for dynamic optimization [J ] . Knowledge-Based Systems , 2020 , 195 : 105711 .

ZHOU R H , LIU Q M , WANG J , et al . Modified semi-supervised affinity propagation clustering with fuzzy density fruit fly optimization [J ] . Neural Computing and Applications , 2021 , 33 ( 10 ): 4695 - 4712 .

WANG L M , JI Q , HAN X M . Adaptive semi-supervised affinity propagation clustering algorithm based on structural similarity [J ] . Tehnicki Vjesnik-Technical Gazette , 2016 , 23 ( 2 ): 425 - 436 .

XUE J K , SHEN B . A novel swarm intelligence optimization approach: Sparrow search algorithm [J ] . Systems Science & Control Engineering , 2020 , 8 ( 1 ): 22 - 34 .

MIRJALILI S . Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm [J ] . Knowledge-Based Systems , 2015 , 89 : 228 - 249 .

LI S M , Chen H M , Wang M J , et al . Slime mould algorithm: A new method for stochastic optimization [J ] . Future Generation Computer Systems , 2020 , 111 : 300 - 323 .

ALSATTAR H A , ZAIDAN A A , ZAIDAN B B . Novel meta-heuristic bald eagle search optimisation algorithm [J ] . Artificial Intelligence Review , 2020 , 53 ( 3 ): 2237 - 2264 .

ZHAO W G , ZHANG Z X , Wang L Y . Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications [J ] . Engineering Applications of Artificial Intelligence , 2020 , 87 : 103300 .

WANG X H , QIN Z , ZHANG X P . Automatically affinity propagation clustering using particle swarm [J ] . Journal of Computers , 2010 , 5 ( 11 ): 1731 - 1738 .

毛清华 , 张强 . 融合柯西变异和反向学习的改进麻雀算法 [J ] . 计算机科学与探索 , 2021 , 15 ( 6 ): 1155 - 1164 .

MAO Q H , ZHANG Q . Improved sparrow algorithm combining cauchy mutation and opposition-based learning [J ] . Journal of Frontiers of Computer Science & Technology , 2021 , 15 ( 6 ): 1155 - 1164 . (in Chinese)

ARZENO N M , VIKALO H . Evolutionary affinity propagation [C ] // 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . Piscataway : IEEE , 2017 : 2681 - 2685 .

赵小强 , 谢亚萍 . 基于差分改进的仿射传播聚类算法 [J ] . 控制工程 , 2018 , 25 ( 12 ): 2115 - 2119 .

ZHAO X Q , XIE Y P . An affinity propagation clustering algorithm based on differential evolution [J ] . Control Engineering of China , 2018 , 25 ( 12 ): 2115 - 2119 . (in Chinese)

kokkula Rohan . Country-Data [EB/OL ] . ( 2020-07-17 ) [ 2022-02-01 ] . https://www.kaggle.com/rohan0301/unsupervised-learning-on-country-data https://www.kaggle.com/rohan0301/unsupervised-learning-on-country-data .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种基于自适应标记与区域间近邻传播聚类的分水岭图像分割算法