paper-with-me

홈 › Papers

Synchronization Clustering based on a Linearized Version of Vicsek model

2014-11-02 · Xinquan Chen

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.

📄 PDF Abstract BibTeX arXiv:1411.0189

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

A Fast Synchronization Clustering Algorithm

2014-07-23 · Xinquan Chen

This paper presents a Fast Synchronization Clustering algorithm (FSynC), which is an improved version of SynC algorithm. In order to decrease the time complexity of the original SynC algorithm, we combine grid cell parti…

Clustering

A Min-max Cult Algorithm for Graph Partitioning and Data Clustering

2002-08-07 · Proceedings 2001 IEEE International Conference on Data Mining 2002 8 · Chris H.Q. Ding, Xiaofeng He, Hongyuan Zhab, Ming Gu 외

An important application of graph partitioning is data clustering using a graph model - the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information fo…

Clusteringgraph partitioning

Exact Conversion of In-Context Learning to Model Weights in Linearized-Attention Transformers

2024-06-05 · Brian K Chen, Tianyang Hu, Hui Jin, Hwee Kuan Lee 외

In-Context Learning (ICL) has been a powerful emergent property of large language models that has attracted increasing attention in recent years. In contrast to regular gradient-based learning, ICL is highly interpretabl…

In-Context Learning

Spike Synchronization Dynamics of Small-World Networks

2013-09-22 · Derek Harter

In this research report, we examine the effects of small-world network organization on spike synchronization dynamics in networks of Izhikevich spiking units. We interpolate network organizations from regular ring lattic…

Clustering

Active-learning mapping of the Vicsek model phase diagram

2026-04-30 · Grace T. Bai, Brandon B. Le arxiv

The Vicsek model is a minimal model of collective motion, capturing how local alignment interactions can generate macroscopic nonequilibrium order in systems such as bird flocks. In this work, we use active learning to m…

Active Learning