{"title":"基于烟花爆炸优化的半监督亲和传播聚类算法","authors":"W. Limin, Han Xu-ming, Ji Qiang","doi":"10.1109/ICMECG.2014.63","DOIUrl":null,"url":null,"abstract":"In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).","PeriodicalId":413431,"journal":{"name":"2014 International Conference on Management of e-Commerce and e-Government","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Semi-supervised Affinity Propagation Clustering Algorithm Based on Fireworks Explosion Optimization\",\"authors\":\"W. Limin, Han Xu-ming, Ji Qiang\",\"doi\":\"10.1109/ICMECG.2014.63\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).\",\"PeriodicalId\":413431,\"journal\":{\"name\":\"2014 International Conference on Management of e-Commerce and e-Government\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Management of e-Commerce and e-Government\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMECG.2014.63\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2014.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semi-supervised Affinity Propagation Clustering Algorithm Based on Fireworks Explosion Optimization
In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).