{"title":"基于聚类数振荡的差分进化自动聚类","authors":"Wei-Ping Lee, Shen-Wei Chen","doi":"10.1109/IWISA.2010.5473289","DOIUrl":null,"url":null,"abstract":"In this paper, an improved Differential Evolution algorithm (ACDE-O) with cluster number oscillation for automatic crisp clustering has been presented. The proposed algorithm needs no prior knowledge of the number of clusters of the data. Rather, it finds the optimal number of clusters on the processing with stable and fast convergence, cluster number oscillation mechanism will search more possible cluster number in case of bad initial cluster number caused bad clusters. Superiority of the proposed algorithm is demonstrated by comparing it with one recently developed partitional clustering algorithm. Experimental results over three real life datasets and the performance of proposed algorithm is mostly better than the other one.","PeriodicalId":298764,"journal":{"name":"2010 2nd International Workshop on Intelligent Systems and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Automatic Clustering with Differential Evolution Using Cluster Number Oscillation Method\",\"authors\":\"Wei-Ping Lee, Shen-Wei Chen\",\"doi\":\"10.1109/IWISA.2010.5473289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved Differential Evolution algorithm (ACDE-O) with cluster number oscillation for automatic crisp clustering has been presented. The proposed algorithm needs no prior knowledge of the number of clusters of the data. Rather, it finds the optimal number of clusters on the processing with stable and fast convergence, cluster number oscillation mechanism will search more possible cluster number in case of bad initial cluster number caused bad clusters. Superiority of the proposed algorithm is demonstrated by comparing it with one recently developed partitional clustering algorithm. Experimental results over three real life datasets and the performance of proposed algorithm is mostly better than the other one.\",\"PeriodicalId\":298764,\"journal\":{\"name\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWISA.2010.5473289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2010.5473289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic Clustering with Differential Evolution Using Cluster Number Oscillation Method
In this paper, an improved Differential Evolution algorithm (ACDE-O) with cluster number oscillation for automatic crisp clustering has been presented. The proposed algorithm needs no prior knowledge of the number of clusters of the data. Rather, it finds the optimal number of clusters on the processing with stable and fast convergence, cluster number oscillation mechanism will search more possible cluster number in case of bad initial cluster number caused bad clusters. Superiority of the proposed algorithm is demonstrated by comparing it with one recently developed partitional clustering algorithm. Experimental results over three real life datasets and the performance of proposed algorithm is mostly better than the other one.