Clustering Algorithm Based on Density of Data
Ma Yong
Abstract
Open-access reader
Ma Yong
Abstract
Open-access reader
The k_means clustering algorithm has very extensive application. The paper givesout_in clustering algorithm based on density. The algorithm combines distance with data density to adapt to data distribution. It can effectively solve the clustering of data.Out_in clustering based on densityreduce distorition by move out and move in. Simulation results show that out_in clustering algorithm is more effective than the k_means clustering algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The k_means clustering algorithm has very extensive application. The paper givesout_in clustering algorithm based on density. The algorithm combines distance with data density to adapt to data distribution. It can effectively solve the clustering of data.Out_in clustering based on densityreduce distorition by move out and move in. Simulation results show that out_in clustering algorithm is more effective than the k_means clustering algorithm.
Key concepts: Cluster analysis, CURE data clustering algorithm, Canopy clustering algorithm, Correlation clustering, Data stream clustering, Computer science, Data mining, DBSCAN