Meng Zhang, Yao Xiao, Xiaoling Song, Xiangguang Dai, Nian Zhang
{"title":"平衡聚类的快速粒子群优化","authors":"Meng Zhang, Yao Xiao, Xiaoling Song, Xiangguang Dai, Nian Zhang","doi":"10.1109/ICICIP53388.2021.9642162","DOIUrl":null,"url":null,"abstract":"There are balanced priorities in various engineering fields (e.g. medicine, statistics, artificial intelligence, and economics, etc.). Some clustering algorithms cannot maintain the natural balanced structure of data. This paper proposes a soft-balanced clustering framework, which can achieve a balanced clustering for each cluster. The model can be formulated d as a mixed-integer optimization problem. We transform the problem into several subproblems and utilize PSO to search the global solution. Experiments show that the proposed algorithm can achieve satisfactory clustering results than other clustering algorithms.","PeriodicalId":435799,"journal":{"name":"2021 11th International Conference on Intelligent Control and Information Processing (ICICIP)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast Particle Swarm optimization for Balanced Clustering\",\"authors\":\"Meng Zhang, Yao Xiao, Xiaoling Song, Xiangguang Dai, Nian Zhang\",\"doi\":\"10.1109/ICICIP53388.2021.9642162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are balanced priorities in various engineering fields (e.g. medicine, statistics, artificial intelligence, and economics, etc.). Some clustering algorithms cannot maintain the natural balanced structure of data. This paper proposes a soft-balanced clustering framework, which can achieve a balanced clustering for each cluster. The model can be formulated d as a mixed-integer optimization problem. We transform the problem into several subproblems and utilize PSO to search the global solution. Experiments show that the proposed algorithm can achieve satisfactory clustering results than other clustering algorithms.\",\"PeriodicalId\":435799,\"journal\":{\"name\":\"2021 11th International Conference on Intelligent Control and Information Processing (ICICIP)\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 11th International Conference on Intelligent Control and Information Processing (ICICIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICIP53388.2021.9642162\",\"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 11th International Conference on Intelligent Control and Information Processing (ICICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIP53388.2021.9642162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Particle Swarm optimization for Balanced Clustering
There are balanced priorities in various engineering fields (e.g. medicine, statistics, artificial intelligence, and economics, etc.). Some clustering algorithms cannot maintain the natural balanced structure of data. This paper proposes a soft-balanced clustering framework, which can achieve a balanced clustering for each cluster. The model can be formulated d as a mixed-integer optimization problem. We transform the problem into several subproblems and utilize PSO to search the global solution. Experiments show that the proposed algorithm can achieve satisfactory clustering results than other clustering algorithms.