DeepAI AI Chat
Log In Sign Up

Improvement of K Mean Clustering Algorithm Based on Density

by   Su Chang, et al.

The purpose of this paper is to improve the traditional K-means algorithm. In the traditional K mean clustering algorithm, the initial clustering centers are generated randomly in the data set. It is easy to fall into the local minimum solution when the initial cluster centers are randomly generated. The initial clustering center selected by K-means clustering algorithm which based on density is more representative. The experimental results show that the improved K clustering algorithm can eliminate the dependence on the initial cluster, and the accuracy of clustering is improved.


page 1

page 2

page 3

page 4


Short Communication on QUIST: A Quick Clustering Algorithm

In this short communication we introduce the quick clustering algorithm ...

An enhanced method of initial cluster center selection for K-means algorithm

Clustering is one of the widely used techniques to find out patterns fro...

A density peaks clustering algorithm with sparse search and K-d tree

Density peaks clustering has become a nova of clustering algorithm becau...

An Effective Evolutionary Clustering Algorithm: Hepatitis C Case Study

Clustering analysis plays an important role in scientific research and c...

DBGSA: A Novel Data Adaptive Bregman Clustering Algorithm

With the development of Big data technology, data analysis has become in...

COREclust: a new package for a robust and scalable analysis of complex data

In this paper, we present a new R package COREclust dedicated to the det...

A Clustering Algorithm to Organize Satellite Hotspot Data for the Purpose of Tracking Bushfires Remotely

This paper proposes a spatiotemporal clustering algorithm and its implem...