基于线性化Vicsek模型的同步聚类
Synchronization Clustering based on a Linearized Version of Vicsek model
摘要:
提出了一种基于线性化Vicsek模型的同步聚类方法。该方法可以由有效同步聚类算法(ESynC)、ESynC算法的改进版本(IESynC)、基于另一线性Vicsek模型的收缩同步聚类算法(SSynC)和有效多级同步聚类算法(MSynC)来表示。通过分析比较,我们发现基于Vicsek模型线性化的ESynC算法比基于扩展Kuramoto模型的SynC算法和基于原始Vicsek模型的同类同步聚类算法具有更好的同步效果。通过对一些人工数据集的仿真实验,我们观察到ESynC算法、IESynC算法和SSynC算法虽然比SynC算法需要较少的迭代次数和时间,但仍能获得较好的同步效果。在一些仿真中,我们也观察到IESynC算法和SSynC算法可以得到一些改善的时间成本比ESynC算法。最后,对该算法的推广提出了一些研究展望.
英文摘要:
This paper presents a kind of effective synchronization clustering method based on a linearized version of Vicsek model. This method can be represented by an Effective Synchronization Clustering algorithm (ESynC), an Improved version of ESynC algorithm (IESynC), a Shrinking Synchronization Clustering algorithm based on another linear Vicsek model (SSynC), and an effective Multi-level Synchronization Clustering algorithm (MSynC). After some analysis and comparisions, we find that ESynC algorithm based on the Linearized version of the Vicsek model has better synchronization effect than SynC algorithm based on an extensive Kuramoto model and a similar synchronization clustering algorithm based on the original Vicsek model. By simulated experiments of some artificial data sets, we observe that ESynC algorithm, IESynC algorithm, and SSynC algorithm can get better synchronization effect although it needs less iterative times and less time than SynC algorithm. In some simulations, we also observe that IESynC algorithm and SSynC algorithm can get some improvements in time cost than ESynC algorithm. At last, it gives some research expectations to popularize this algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。