{"title":"基于遗传算法的无监督分层聚类","authors":"W. A. Greene","doi":"10.1109/CEC.2003.1299776","DOIUrl":null,"url":null,"abstract":"We present a clustering algorithm which is unsupervised, incremental, and hierarchical. The algorithm is distance-based and creates centroids. Then we combine the power of evolutionary forces with the clustering algorithm, counting on good clusterings to evolve to yet better ones. We apply our approach to standard data sets, and get very good results. Finally, we use bagging to pool the results of different clustering trials, and again get very good results.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Unsupervised hierarchical clustering via a genetic algorithm\",\"authors\":\"W. A. Greene\",\"doi\":\"10.1109/CEC.2003.1299776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a clustering algorithm which is unsupervised, incremental, and hierarchical. The algorithm is distance-based and creates centroids. Then we combine the power of evolutionary forces with the clustering algorithm, counting on good clusterings to evolve to yet better ones. We apply our approach to standard data sets, and get very good results. Finally, we use bagging to pool the results of different clustering trials, and again get very good results.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Unsupervised hierarchical clustering via a genetic algorithm
We present a clustering algorithm which is unsupervised, incremental, and hierarchical. The algorithm is distance-based and creates centroids. Then we combine the power of evolutionary forces with the clustering algorithm, counting on good clusterings to evolve to yet better ones. We apply our approach to standard data sets, and get very good results. Finally, we use bagging to pool the results of different clustering trials, and again get very good results.