2007Unpublished venueRequires access

Dynamic K-mean Clustering Analysis Based on Improved Ant Colony Algorithm

Feifei Guo

Open publisher page 0 citations

Abstract

This paper proposes a method of dynamic K-mean clustering analysis based on ant colony algorithm.The algorithm makes use of the great ability of ant colony algorithm for disposing local extremum firstly.And then the results from previous for K-mean clustering method can make up the deficiency of ant colony algorithm.In this way,the combination of ant colony algorithm with K-means clustering organically could find the whole distributing optimization clustering to achieve improved clustering analysis based on improved function.

About this research paper

What this paper is about

This paper proposes a method of dynamic K-mean clustering analysis based on ant colony algorithm.The algorithm makes use of the great ability of ant colony algorithm for disposing local extremum firstly.And then the results from previous for K-mean clustering method can make up the deficiency of ant colony algorithm.In this way,the combination of ant colony algorithm with K-means clustering organically could find the whole distributing optimization clustering to achieve improved clustering analysis based on improved function.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proposes a method of dynamic K-mean clustering analysis based on ant colony algorithm.The algorithm makes use of the great ability of ant colony algorithm for disposing local extremum firstly.And then the results from previous for K-mean clustering method can make up the deficiency of ant colony algorithm.In this way,the combination of ant colony algorithm with K-means clustering organically could find the whole distributing optimization clustering to achieve improved clustering analysis based on improved function.

Key concepts: Ant colony optimization algorithms, Cluster analysis, Computer science, Ant colony, Canopy clustering algorithm, CURE data clustering algorithm, k-means clustering, Artificial bee colony algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic K-mean Clustering Analysis Based on Improved Ant Colony Algorithm — Research Paper | ScholarLens