{"title":"基于改进量子粒子群优化算法的k均值聚类","authors":"Lili Bai, Zerui Song, Haijie Bao, Jing-qing Jiang","doi":"10.1109/ICACI52617.2021.9435862","DOIUrl":null,"url":null,"abstract":"In clustering, in order to find a better data clustering center, make the algorithm convergence faster and clustering results more accurate, a k-means clustering algorithm based on improved quantum particle swarm optimization algorithm is proposed. In this algorithm, the cluster center is simulated as a particle. Cloning and mutation operations are used to increase the diversity and improve the global search ability of QPSO. A suitable and stable cluster center is obtained. Finally, an effective clustering result is obtained. The algorithm is tested with UCI data set. The results show that the improved algorithm not only ensures the global convergence of the algorithm, but also obtains more accurate clustering results.","PeriodicalId":382483,"journal":{"name":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"K-means Clustering Based on Improved Quantum Particle Swarm Optimization Algorithm\",\"authors\":\"Lili Bai, Zerui Song, Haijie Bao, Jing-qing Jiang\",\"doi\":\"10.1109/ICACI52617.2021.9435862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In clustering, in order to find a better data clustering center, make the algorithm convergence faster and clustering results more accurate, a k-means clustering algorithm based on improved quantum particle swarm optimization algorithm is proposed. In this algorithm, the cluster center is simulated as a particle. Cloning and mutation operations are used to increase the diversity and improve the global search ability of QPSO. A suitable and stable cluster center is obtained. Finally, an effective clustering result is obtained. The algorithm is tested with UCI data set. The results show that the improved algorithm not only ensures the global convergence of the algorithm, but also obtains more accurate clustering results.\",\"PeriodicalId\":382483,\"journal\":{\"name\":\"2021 13th International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 13th International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI52617.2021.9435862\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI52617.2021.9435862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
K-means Clustering Based on Improved Quantum Particle Swarm Optimization Algorithm
In clustering, in order to find a better data clustering center, make the algorithm convergence faster and clustering results more accurate, a k-means clustering algorithm based on improved quantum particle swarm optimization algorithm is proposed. In this algorithm, the cluster center is simulated as a particle. Cloning and mutation operations are used to increase the diversity and improve the global search ability of QPSO. A suitable and stable cluster center is obtained. Finally, an effective clustering result is obtained. The algorithm is tested with UCI data set. The results show that the improved algorithm not only ensures the global convergence of the algorithm, but also obtains more accurate clustering results.