Solving Large-Scale Multiobjective Optimization Problems With Sparse Optimal Solutions via Unsupervised Neural Networks

Due to the curse of dimensionality of search space, it is extremely difficult for evolutionary algorithms to approximate the optimal solutions of large-scale multiobjective optimization problems (LMOPs) by using a limited budget of evaluations. If the Pareto-optimal subspace is approximated during t...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on cybernetics Ročník 51; číslo 6; s. 3115 - 3128
Hlavní autoři:	Tian, Ye, Lu, Chang, Zhang, Xingyi, Tan, Kay Chen, Jin, Yaochu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.06.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Approximation Computer science Denoising autoencoder (DAE) Evolutionary algorithms Evolutionary computation Genetic algorithms large-scale multiobjective optimization Machine learning Multiple objective analysis Neural networks Noise reduction Optimization Pareto optimization Pareto optimum Pareto-optimal subspace Representations restricted Boltzmann machine (RBM) Search problems Searching Sociology sparse Pareto-optimal solutions Statistics Subspaces
ISSN:	2168-2267, 2168-2275, 2168-2275
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!