.png){kind=icon}
.png){kind=icon}
Return
Frequent Pattern-Based Search: A Case Study on the Quadratic Assignment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2020.3027860.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present frequent pattern-based search (FPBS) that combines data mining and optimization. FPBS is a general-purpose method that unifies data mining and optimization within the population-based search framework. The method emphasizes the relevance of a modular- and component-based approach, making it applicable to optimization problems by instantiating the underlying components. To illustrate its potential for solving difficult combinatorial optimization problems, we apply the method to the well-known and challenging quadratic assignment problem. We show the computational results and comparisons on the hardest QAPLIB benchmark instances. This work reinforces the recent trend toward closer cooperations between the optimization methods and machine learning or data mining techniques.
Keywords:
Data mining
Sociology
Statistics
Search problems
Optimization methods
Machine learning
Combinatorial optimization
heuristic design
learning-driven optimization
pattern-based optimization
quadratic assignment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available