M. Bardamova, Radioelectronics, A. Buymov, V. Tarasenko
{"title":"在解决特征选择问题时,将跳蛙算法应用于二叉搜索空间的方法","authors":"M. Bardamova, Radioelectronics, A. Buymov, V. Tarasenko","doi":"10.21293/1818-0442-2020-23-4-57-62","DOIUrl":null,"url":null,"abstract":"The feature selection is an important step in constructing any classifier. Binary versions of metaheuristic optimization algorithms are often used for selection. However, many metaheuristics are originally created to work in the continuous search space, so they need to be specially adapted to the binary space. In this paper, the authors propose fifteen ways to binarize the Shuffled frog leaping algorithm based on the following methods: modified algebraic operations, merge operation, and transformation functions. The efficiency of the binary algorithm was tested in the problem of feature selection for fuzzy classifiers on data sets from the KEEL repository. The results show that all the described methods of binarization allow reducing the features, while increasing the overall accuracy of classification.","PeriodicalId":273068,"journal":{"name":"Proceedings of Tomsk State University of Control Systems and Radioelectronics","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Methods for adapting the leaping frog algorithm to the binary search space when solving the feature selection problem\",\"authors\":\"M. Bardamova, Radioelectronics, A. Buymov, V. Tarasenko\",\"doi\":\"10.21293/1818-0442-2020-23-4-57-62\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The feature selection is an important step in constructing any classifier. Binary versions of metaheuristic optimization algorithms are often used for selection. However, many metaheuristics are originally created to work in the continuous search space, so they need to be specially adapted to the binary space. In this paper, the authors propose fifteen ways to binarize the Shuffled frog leaping algorithm based on the following methods: modified algebraic operations, merge operation, and transformation functions. The efficiency of the binary algorithm was tested in the problem of feature selection for fuzzy classifiers on data sets from the KEEL repository. The results show that all the described methods of binarization allow reducing the features, while increasing the overall accuracy of classification.\",\"PeriodicalId\":273068,\"journal\":{\"name\":\"Proceedings of Tomsk State University of Control Systems and Radioelectronics\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Tomsk State University of Control Systems and Radioelectronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21293/1818-0442-2020-23-4-57-62\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Tomsk State University of Control Systems and Radioelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21293/1818-0442-2020-23-4-57-62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Methods for adapting the leaping frog algorithm to the binary search space when solving the feature selection problem
The feature selection is an important step in constructing any classifier. Binary versions of metaheuristic optimization algorithms are often used for selection. However, many metaheuristics are originally created to work in the continuous search space, so they need to be specially adapted to the binary space. In this paper, the authors propose fifteen ways to binarize the Shuffled frog leaping algorithm based on the following methods: modified algebraic operations, merge operation, and transformation functions. The efficiency of the binary algorithm was tested in the problem of feature selection for fuzzy classifiers on data sets from the KEEL repository. The results show that all the described methods of binarization allow reducing the features, while increasing the overall accuracy of classification.