{"title":"基于Spark的改进Salp群特征选择算法","authors":"Hongwe Chen, Fangrui Liu, Pengyang Chang, Shuyu Yao, Fei Huang, Jiwei Hu","doi":"10.1109/ICCSE49874.2020.9201790","DOIUrl":null,"url":null,"abstract":"Salp swarm algorithm (SSA) is a population-based optimization technique with excellent performance. However, due to the lack of inertial parameters, this algorithm lacks the ability to find the global search for potential solutions. In this paper, we present an improved SSA algorithm based on spark(Spark-BSSA), which takes advantages of the improved global search ability of BSSA and combines with the spark programming mode. Experimental results demonstrated that as the number of cluster nodes increases, the running time of the algorithm decreases. At the same time, the proposed method is evaluated using the real data sets and compared with the binary gentic algorithm (BGA), the binary particle swarm algorithm (BPSO) and the binary gravity search algorithm (BGSA). The method has also higher classification performance and better stability of classification accuracy. Through experimental data analysis, the ultimate goal is to solve the problems of premature convergence and optimality in the original algorithm.","PeriodicalId":350703,"journal":{"name":"2020 15th International Conference on Computer Science & Education (ICCSE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved Salp Swarm Algorithm Based on Spark for Feature Selection\",\"authors\":\"Hongwe Chen, Fangrui Liu, Pengyang Chang, Shuyu Yao, Fei Huang, Jiwei Hu\",\"doi\":\"10.1109/ICCSE49874.2020.9201790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Salp swarm algorithm (SSA) is a population-based optimization technique with excellent performance. However, due to the lack of inertial parameters, this algorithm lacks the ability to find the global search for potential solutions. In this paper, we present an improved SSA algorithm based on spark(Spark-BSSA), which takes advantages of the improved global search ability of BSSA and combines with the spark programming mode. Experimental results demonstrated that as the number of cluster nodes increases, the running time of the algorithm decreases. At the same time, the proposed method is evaluated using the real data sets and compared with the binary gentic algorithm (BGA), the binary particle swarm algorithm (BPSO) and the binary gravity search algorithm (BGSA). The method has also higher classification performance and better stability of classification accuracy. Through experimental data analysis, the ultimate goal is to solve the problems of premature convergence and optimality in the original algorithm.\",\"PeriodicalId\":350703,\"journal\":{\"name\":\"2020 15th International Conference on Computer Science & Education (ICCSE)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 15th International Conference on Computer Science & Education (ICCSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE49874.2020.9201790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 15th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE49874.2020.9201790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Salp Swarm Algorithm Based on Spark for Feature Selection
Salp swarm algorithm (SSA) is a population-based optimization technique with excellent performance. However, due to the lack of inertial parameters, this algorithm lacks the ability to find the global search for potential solutions. In this paper, we present an improved SSA algorithm based on spark(Spark-BSSA), which takes advantages of the improved global search ability of BSSA and combines with the spark programming mode. Experimental results demonstrated that as the number of cluster nodes increases, the running time of the algorithm decreases. At the same time, the proposed method is evaluated using the real data sets and compared with the binary gentic algorithm (BGA), the binary particle swarm algorithm (BPSO) and the binary gravity search algorithm (BGSA). The method has also higher classification performance and better stability of classification accuracy. Through experimental data analysis, the ultimate goal is to solve the problems of premature convergence and optimality in the original algorithm.