Liang Yan, Zhao Dongguo, Lu Xianguo, Jie Xiaoyuan, Wang Chenglin
{"title":"A Local Gravity Kinematics Synchronization Clustering Algorithm","authors":"Liang Yan, Zhao Dongguo, Lu Xianguo, Jie Xiaoyuan, Wang Chenglin","doi":"10.1109/icmeas54189.2021.00044","DOIUrl":null,"url":null,"abstract":"We propose a new clustering method called LGKSC, which is an alternative model based on gravitational kinematics to simulate local synchronization. The difference from existing clustering algorithms is that the algorithm makes objects over time. The dynamics of interaction are gradually synchronized dynamically, forming a local cluster corresponding to the internal structure of the data set. LGKSC can determine clusters with any shape, size and density, and can identify the amount of clusters automatically. LGKSC can adaptively identify the neighbors of the data objects based on the Davies-Bouldin (DB) index, so it can choose the best clustering results. Experiments indicate that the proposed method may take more time to run, but the algorithm have advantages in detecting the amount and the accuracy of clusters.","PeriodicalId":374943,"journal":{"name":"2021 7th International Conference on Mechanical Engineering and Automation Science (ICMEAS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Mechanical Engineering and Automation Science (ICMEAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icmeas54189.2021.00044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose a new clustering method called LGKSC, which is an alternative model based on gravitational kinematics to simulate local synchronization. The difference from existing clustering algorithms is that the algorithm makes objects over time. The dynamics of interaction are gradually synchronized dynamically, forming a local cluster corresponding to the internal structure of the data set. LGKSC can determine clusters with any shape, size and density, and can identify the amount of clusters automatically. LGKSC can adaptively identify the neighbors of the data objects based on the Davies-Bouldin (DB) index, so it can choose the best clustering results. Experiments indicate that the proposed method may take more time to run, but the algorithm have advantages in detecting the amount and the accuracy of clusters.