南方科技大学知识苑(SUSTech KC): Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization

题名	Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization
作者	W. Chen; H. Ishibuchi; K. Shang
发表日期	2022-08
DOI	10.1109/TEVC.2021.3103386
发表期刊	IEEE Transactions on Evolutionary Computation 影响因子和分区
ISSN	1941-0026
卷号	26 期号:4页码:750-764
关键词	Evolutionary many-objective optimization evolutionary multiobjective optimization (EMO) performance indicators submodularity subset selection
相关链接	[IEEE记录]
收录类别	SCI ; EI
学校署名	第一
EI入藏号	20223212553638
EI主题词	Computational efficiency ; Evolutionary algorithms ; Feature Selection ; Multiobjective optimization ; Set theory
EI分类号	Combinatorial Mathematics, Includes Graph Theory, Set Theory:921.4 ; Optimization Techniques:921.5
ESI学科分类	COMPUTER SCIENCE
来源库	IEEE
全文链接	https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9509298
引用统计	被引频次[WOS]：10
成果类型	期刊论文
条目标识符	http://sustech.caswiz.com/handle/2SGJ60CL/256576
专题	南方科技大学工学院_计算机科学与工程系
作者单位	Southern University of Science and Technology
第一作者单位	南方科技大学
第一作者的第一单位	南方科技大学
推荐引用方式 GB/T 7714	W. Chen,H. Ishibuchi,K. Shang. Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization[J]. IEEE Transactions on Evolutionary Computation,2022,26(4):750-764.
APA	W. Chen,H. Ishibuchi,&K. Shang.(2022).Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization.IEEE Transactions on Evolutionary Computation,26(4),750-764.
MLA	W. Chen,et al."Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization".IEEE Transactions on Evolutionary Computation 26.4(2022):750-764.