{"title":"基于粒子群算法的障碍物约束空间数据聚类","authors":"Xueping Zhang, Fen Qin, Jiayao Wang, Yongheng Fu, Jinghui Chen","doi":"10.1109/FSKD.2007.219","DOIUrl":null,"url":null,"abstract":"This paper proposes a particle swarm optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use PSO to get obstructed distance, and then we developed the PSO K-Medoids SCOC (PKSCOC) to cluster spatial data with obstacles constraints. The experimental results show that PKSCOC performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).","PeriodicalId":201883,"journal":{"name":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Clustering Spatial Data with Obstacles Constraints by PSO\",\"authors\":\"Xueping Zhang, Fen Qin, Jiayao Wang, Yongheng Fu, Jinghui Chen\",\"doi\":\"10.1109/FSKD.2007.219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a particle swarm optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use PSO to get obstructed distance, and then we developed the PSO K-Medoids SCOC (PKSCOC) to cluster spatial data with obstacles constraints. The experimental results show that PKSCOC performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).\",\"PeriodicalId\":201883,\"journal\":{\"name\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2007.219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2007.219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Clustering Spatial Data with Obstacles Constraints by PSO
This paper proposes a particle swarm optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use PSO to get obstructed distance, and then we developed the PSO K-Medoids SCOC (PKSCOC) to cluster spatial data with obstacles constraints. The experimental results show that PKSCOC performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).