IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

An Improved Gravitational Clustering Based on Local Density

An Improved Gravitational Clustering Based on Local Density
View Sample PDF
Author(s): Lei Chen (School of Information and Electrical Engineering, Hunan University of Science and Technology, China), Qinghua Guo (School of Information and Electrical Engineering, Hunan University of Science and Technology, China), Zhaohua Liu (State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, China), Long Chen (School of Information and Electrical Engineering, Hunan University of Science and Technology, China), HuiQin Ning (School of Information and Electrical Engineering, Hunan University of Science and Technology, China), Youwei Zhang (School of Information and Electrical Engineering, Hunan University of Science and Technology, China)and Yu Jin (School of Information and Electrical Engineering, Hunan University of Science and Technology, China)
Copyright: 2021
Volume: 12
Issue: 1
Pages: 22
Source title: International Journal of Mobile Computing and Multimedia Communications (IJMCMC)
Editor(s)-in-Chief: Agustinus Waluyo (Monash University, Australia)
DOI: 10.4018/IJMCMC.2021010101

Purchase

View An Improved Gravitational Clustering Based on Local Density on the publisher's website for pricing and purchasing information.

Abstract

Gravitational clustering algorithm (Gravc) is a novel and excellent dynamic clustering algorithm that can accurately cluster complex dataset with arbitrary shape and distribution. However, high time complexity is a key challenge to the gravitational clustering algorithm. To solve this problem, an improved gravitational clustering algorithm based on the local density is proposed in this paper, called FastGravc. The main contributions of this paper are as follows. First of all, a local density-based data compression strategy is designed to reduce the number of data objects and the number of neighbors of each object participating in the gravitational clustering algorithm. Secondly, the traditional gravity model is optimized to adapt to the quality differences of different objects caused by data compression strategy. And then, the improved gravitational clustering algorithm FastGravc is proposed by integrating the above optimization strategies. Finally, extensive experimental results on synthetic and real-world datasets verify the effectiveness and efficiency of FastGravc algorithm.

Related Content

Wanqiao Wang, Jian Su, Hui Zhang, Luyao Guan, Qingrong Zheng, Zhuofan Tang, Huixia Ding. © 2024. 16 pages.
. © 2024.
Xinhong You, Pengping Zhang, Minglin Liu, Lingqi Lin, Shuai Li. © 2023. 18 pages.
Nan Zhao, Jiaye Wang, Bo Jin, Ru Wang, Minghu Wu, Yu Liu, Lufeng Zheng. © 2023. 17 pages.
Tongyao Nie, Xinguang Lv. © 2023. 14 pages.
Ali Bonyadi Naeini, Ali Golbazi Mahdipour, Rasam Dorri. © 2023. 24 pages.
Agnitè Maxim Wilfrid Straiker Edoh, Tahirou Djara, Abdou-Aziz Sobabe Ali Tahirou, Antoine Vianou. © 2023. 16 pages.
Body Bottom