Multi-objective genetic programming based on decomposition for feature learning in image classification

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Tuo Zhang , Ying Bi , Jing Liang , Bing Xue , Mengjie Zhang
{"title":"Multi-objective genetic programming based on decomposition for feature learning in image classification","authors":"Tuo Zhang ,&nbsp;Ying Bi ,&nbsp;Jing Liang ,&nbsp;Bing Xue ,&nbsp;Mengjie Zhang","doi":"10.1016/j.swevo.2025.101875","DOIUrl":null,"url":null,"abstract":"<div><div>Image classification presents a challenge due to its high dimensionality and extensive variations. Feature learning is a powerful method in addressing this challenge, constituting a multi-objective problem aimed at maximizing classification accuracy and minimizing the number of learned features. A few multi-objective genetic programming (MOGP) methods have been proposed to optimize these two objectives, simultaneously. However, existing MOGP methods ignore the characteristics of feature learning tasks. Therefore, this work proposes a decomposition-based MOGP approach with a global replacement strategy for feature learning in data-efficient image classification. To handle the different value ranges of the two objectives, a transformation function is designed to uniform the range of the number of learned features. In addition, a preference-based decomposition strategy is proposed to address the preference for the objective of classification accuracy. The proposed approach is compared with existing MOGP methods for feature learning on five different image classification datasets with different numbers of training images. The experimental results demonstrate the effectiveness of the proposed approach by achieving better HVs than or comparable to the existing MOGP methods in at least 13 out of 20 cases and classification accuracy significantly better than a popular neural architecture search method in all cases.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"94 ","pages":"Article 101875"},"PeriodicalIF":8.2000,"publicationDate":"2025-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225000331","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Image classification presents a challenge due to its high dimensionality and extensive variations. Feature learning is a powerful method in addressing this challenge, constituting a multi-objective problem aimed at maximizing classification accuracy and minimizing the number of learned features. A few multi-objective genetic programming (MOGP) methods have been proposed to optimize these two objectives, simultaneously. However, existing MOGP methods ignore the characteristics of feature learning tasks. Therefore, this work proposes a decomposition-based MOGP approach with a global replacement strategy for feature learning in data-efficient image classification. To handle the different value ranges of the two objectives, a transformation function is designed to uniform the range of the number of learned features. In addition, a preference-based decomposition strategy is proposed to address the preference for the objective of classification accuracy. The proposed approach is compared with existing MOGP methods for feature learning on five different image classification datasets with different numbers of training images. The experimental results demonstrate the effectiveness of the proposed approach by achieving better HVs than or comparable to the existing MOGP methods in at least 13 out of 20 cases and classification accuracy significantly better than a popular neural architecture search method in all cases.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信