K-medoids clustering algorithm method based on ant colony algorithm
Lin Wang
Abstract
Lin Wang
Abstract
K-medoids algorithm as a kind of clustering algorithm, not easily affected by extreme data, the influence of broad adaptability, but K-medoids clustering algorithm accuracy is not stable, average accuracy, low in the real,clustering analysis effect is poorer. ACO is a bionic optimization algorithm, which has strong robustness, can be unified easily with other method, has high efficiency. K-medoids clustering algorithm based on ACO algorithm merit reference, this paper proposes a new clustering algorithm. It raises the clustering algorithm, and the stability of the accuracy is high. Finally, simulation experiments show the feasibility and advantage of this 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.
K-medoids algorithm as a kind of clustering algorithm, not easily affected by extreme data, the influence of broad adaptability, but K-medoids clustering algorithm accuracy is not stable, average accuracy, low in the real,clustering analysis effect is poorer. ACO is a bionic optimization algorithm, which has strong robustness, can be unified easily with other method, has high efficiency. K-medoids clustering algorithm based on ACO algorithm merit reference, this paper proposes a new clustering algorithm. It raises the clustering algorithm, and the stability of the accuracy is high. Finally, simulation experiments show the feasibility and advantage of this algorithm.
Key concepts: k-medoids, Cluster analysis, Algorithm, Canopy clustering algorithm, CURE data clustering algorithm, Computer science, Correlation clustering, Adaptability