Clustering Algorithm Based on Hybrid Intelligent Algorithm
Shang Gao
Abstract
Shang Gao
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.
OpenAlex reports 2 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.
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)