.png){kind=icon}
.png){kind=icon}
Return
Enhancing Evolutionary Algorithms With Pattern Mining for Sparse Large-Scale Multi-Objective Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2024.124548.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse large-scale multi-objective optimization problems (SLMOPs) are common in science and engineering. However, the large-scale problem represents the high dimensionality of the decision space, requiring algorithms to traverse vast expanse with limited computational resources. Furthermore, in the context of sparse, most variables in Pareto optimal solutions are zero, making it difficult for algorithms to identify non-zero variables efficiently. This paper is dedicated to addressing the challenges posed by SLMOPs. To start, we introduce innovative objective functions customized to mine maximum and minimum candidate sets. This substantial enhancement dramatically improves the efficacy of frequent pattern mining. In this way, selecting candidate sets is no longer based on the quantity of non-zero variables they contain but on a higher proportion of non-zero variables within specific dimensions. Additionally, we unveil a novel approach to association rule mining, which delves into the intricate relationships between non-zero variables. This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value. We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs. The results demonstrate that our approach achieves competitive solutions across various challenges.
Keywords:
Evolutionary computation
Benchmark testing
Pareto optimization
Linear programming
Association rule learning
Object recognition
Indexes
Evolutionary algorithms
pattern mining
sparse large-scale multi-objective problems (SLMOPs)
sparse large-scale optimization
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W