{"title":"基于混合模型的特征选择算法研究","authors":"Ming He","doi":"10.1109/ICCEE.2008.38","DOIUrl":null,"url":null,"abstract":"Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining. In this paper, we have studied the basic concepts of rough set theory, and discussed several special cases of the ant colony optimization metaheuristic algorithms. Based on the above study, we propose a feature selection algorithm within a mixed framework based on rough set theory and ant colony optimization. experimental results show that the algorithm of this paper is flexible for feature selection.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Feature Selection Algorithm Based on Mixed Model\",\"authors\":\"Ming He\",\"doi\":\"10.1109/ICCEE.2008.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining. In this paper, we have studied the basic concepts of rough set theory, and discussed several special cases of the ant colony optimization metaheuristic algorithms. Based on the above study, we propose a feature selection algorithm within a mixed framework based on rough set theory and ant colony optimization. experimental results show that the algorithm of this paper is flexible for feature selection.\",\"PeriodicalId\":365473,\"journal\":{\"name\":\"2008 International Conference on Computer and Electrical Engineering\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Computer and Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCEE.2008.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on Feature Selection Algorithm Based on Mixed Model
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining. In this paper, we have studied the basic concepts of rough set theory, and discussed several special cases of the ant colony optimization metaheuristic algorithms. Based on the above study, we propose a feature selection algorithm within a mixed framework based on rough set theory and ant colony optimization. experimental results show that the algorithm of this paper is flexible for feature selection.