Michael Willis, Li Zhang, Han Liu, Hailun Xie, Kamlesh Mistry
{"title":"基于增强粒子群优化的目标识别","authors":"Michael Willis, Li Zhang, Han Liu, Hailun Xie, Kamlesh Mistry","doi":"10.1109/ICMLC51923.2020.9469584","DOIUrl":null,"url":null,"abstract":"The identification of the most discriminative features in an explainable AI decision-making process is a challenging problem. This research tackles such challenges by proposing Particle Swarm Optimization (PSO) variants embedded with novel mutation and sampling iteration operations for feature selection in object recognition. Specifically, five PSO variants integrating different mutation and sampling strategies have been proposed to select the most discriminative feature subsets for the classification of different objects. A mutation strategy is firstly proposed by randomly flipping the particle positions in some dimensions to generate new feature interactions. Moreover, instead of embarking the position updating evolution in PSO, the proposed PSO variants generate offspring solutions through a sampling mechanism during the initial search process. Two offspring generation sampling schemes are investigated, i.e. the employment of the personal and global best solutions obtained using the mutation mechanism, respectively, as the starting positions for the subsequent search process. Subsequently, several machine learning algorithms are used in conjunction with the proposed PSO variants to perform object classification. As evidenced by the empirical results, the proposed PSO variants outperform the original PSO algorithm, significantly, for feature optimization.","PeriodicalId":170815,"journal":{"name":"2020 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Object Recognition Using Enhanced Particle Swarm Optimization\",\"authors\":\"Michael Willis, Li Zhang, Han Liu, Hailun Xie, Kamlesh Mistry\",\"doi\":\"10.1109/ICMLC51923.2020.9469584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The identification of the most discriminative features in an explainable AI decision-making process is a challenging problem. This research tackles such challenges by proposing Particle Swarm Optimization (PSO) variants embedded with novel mutation and sampling iteration operations for feature selection in object recognition. Specifically, five PSO variants integrating different mutation and sampling strategies have been proposed to select the most discriminative feature subsets for the classification of different objects. A mutation strategy is firstly proposed by randomly flipping the particle positions in some dimensions to generate new feature interactions. Moreover, instead of embarking the position updating evolution in PSO, the proposed PSO variants generate offspring solutions through a sampling mechanism during the initial search process. Two offspring generation sampling schemes are investigated, i.e. the employment of the personal and global best solutions obtained using the mutation mechanism, respectively, as the starting positions for the subsequent search process. Subsequently, several machine learning algorithms are used in conjunction with the proposed PSO variants to perform object classification. As evidenced by the empirical results, the proposed PSO variants outperform the original PSO algorithm, significantly, for feature optimization.\",\"PeriodicalId\":170815,\"journal\":{\"name\":\"2020 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLC51923.2020.9469584\",\"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 International Conference on Machine Learning and Cybernetics (ICMLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC51923.2020.9469584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Object Recognition Using Enhanced Particle Swarm Optimization
The identification of the most discriminative features in an explainable AI decision-making process is a challenging problem. This research tackles such challenges by proposing Particle Swarm Optimization (PSO) variants embedded with novel mutation and sampling iteration operations for feature selection in object recognition. Specifically, five PSO variants integrating different mutation and sampling strategies have been proposed to select the most discriminative feature subsets for the classification of different objects. A mutation strategy is firstly proposed by randomly flipping the particle positions in some dimensions to generate new feature interactions. Moreover, instead of embarking the position updating evolution in PSO, the proposed PSO variants generate offspring solutions through a sampling mechanism during the initial search process. Two offspring generation sampling schemes are investigated, i.e. the employment of the personal and global best solutions obtained using the mutation mechanism, respectively, as the starting positions for the subsequent search process. Subsequently, several machine learning algorithms are used in conjunction with the proposed PSO variants to perform object classification. As evidenced by the empirical results, the proposed PSO variants outperform the original PSO algorithm, significantly, for feature optimization.