{"title":"一种新的基于遗传算法的ECOC算法","authors":"Xiao-Na Ye, Kun-hong Liu","doi":"10.1109/SKG.2018.00030","DOIUrl":null,"url":null,"abstract":"This paper proposes a genetic algorithm (GA) based error correcting output codes (ECOC) algorithms. In our algorithm, some randomly initialized coding matrices are generated as seeds firstly, and our algorithm produces optimal coding matrices based on them in the evolutionary process. In our GA, each gene stands for an action, indicating two selected columns and an operator. The operators are proposed to generate new columns by exchanging information between a pair of parent columns. In this way, each individual represents a new coding matrix. A legality checking function is embedded in the GA to keep the produced coding matrix both legal and effective. At the end of this evolutionary process, the best coding matrix is selected as final solution. The experimental results show that our algorithm can efficiently optimize the coding matrix compared with the seed matrices.","PeriodicalId":265760,"journal":{"name":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Novel Genetic Algorithm Based ECOC Algorithm\",\"authors\":\"Xiao-Na Ye, Kun-hong Liu\",\"doi\":\"10.1109/SKG.2018.00030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a genetic algorithm (GA) based error correcting output codes (ECOC) algorithms. In our algorithm, some randomly initialized coding matrices are generated as seeds firstly, and our algorithm produces optimal coding matrices based on them in the evolutionary process. In our GA, each gene stands for an action, indicating two selected columns and an operator. The operators are proposed to generate new columns by exchanging information between a pair of parent columns. In this way, each individual represents a new coding matrix. A legality checking function is embedded in the GA to keep the produced coding matrix both legal and effective. At the end of this evolutionary process, the best coding matrix is selected as final solution. The experimental results show that our algorithm can efficiently optimize the coding matrix compared with the seed matrices.\",\"PeriodicalId\":265760,\"journal\":{\"name\":\"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SKG.2018.00030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKG.2018.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes a genetic algorithm (GA) based error correcting output codes (ECOC) algorithms. In our algorithm, some randomly initialized coding matrices are generated as seeds firstly, and our algorithm produces optimal coding matrices based on them in the evolutionary process. In our GA, each gene stands for an action, indicating two selected columns and an operator. The operators are proposed to generate new columns by exchanging information between a pair of parent columns. In this way, each individual represents a new coding matrix. A legality checking function is embedded in the GA to keep the produced coding matrix both legal and effective. At the end of this evolutionary process, the best coding matrix is selected as final solution. The experimental results show that our algorithm can efficiently optimize the coding matrix compared with the seed matrices.