2011•Microelectronics & ComputerRequires access

Clustering Algorithm Based on Hybrid Intelligent Algorithm

Shang Gao

Open publisher page 2 citations

Abstract

Simulated annealing algorithm has the ability of doing a global stochastically,and ant colony algorithm has the ability of distributed parallel processing and good feedback.Due to the problem that when the dimension and the number of the sample are large,the cluster result will be unsatisfied,a hybrid intelligent algorithm is proposed.The algorithm is extend to use K-Means clustering to seed the initial solution and the ant colony algorithm and simulated annealing algorithm to adjust the initial cluster.Through the result,the more effectiveness of this algorithm is illustrated.

About this research paper

What this paper is about

Simulated annealing algorithm has the ability of doing a global stochastically,and ant colony algorithm has the ability of distributed parallel processing and good feedback.Due to the problem that when the dimension and the number of the sample are large,the cluster result will be unsatisfied,a hybrid intelligent algorithm is proposed.The algorithm is extend to use K-Means clustering to seed the initial solution and the ant colony algorithm and simulated annealing algorithm to adjust the initial cluster.Through the result,the more effectiveness of this algorithm is illustrated.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Simulated annealing algorithm has the ability of doing a global stochastically,and ant colony algorithm has the ability of distributed parallel processing and good feedback.Due to the problem that when the dimension and the number of the sample are large,the cluster result will be unsatisfied,a hybrid intelligent algorithm is proposed.The algorithm is extend to use K-Means clustering to seed the initial solution and the ant colony algorithm and simulated annealing algorithm to adjust the initial cluster.Through the result,the more effectiveness of this algorithm is illustrated.

Key concepts: Computer science, Cluster analysis, Simulated annealing, Algorithm, Ant colony optimization algorithms, k-medoids, Hybrid algorithm (constraint satisfaction), Sample (material)

Related papers

Back to paper searchBrowse research topicsOriginal source
Clustering Algorithm Based on Hybrid Intelligent Algorithm — Research Paper | ScholarLens