AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining

Hongbo Li, Jimmy Lee, He Mi, Minghao Yin

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase top rate r% of sample solutions from 1% to 30% (ablation)FPMS · UncapWLPtotal optimal subtree length L: 60 -> 24Hurt
increase top rate r% from 1% to 30% (ablation)FPMS · MKnaptotal optimal subtree length L: 276 -> 192Hurt
increase top rate r% from 1% to 30% (ablation)FPMS · TSPinstances with optimal subtree N: 6 -> 4Hurt
increase top number of frequent patterns from 1 to 10 (ablation)FPMS · UncapWLPtotal optimal subtree length L: 28 -> 49Improved
increase top number of frequent patterns from 1 to 50 (ablation)FPMS · MKnaptotal optimal subtree length L: 122 -> 322Improved
increase top number of frequent patterns from 1 to 5 (ablation)FPMS · UncapWLPinstances with optimal subtree N: 8 -> 8No clear effect
increase number of random samples from 0.01% to 0.3% of feasible solutions (ablation)frequent pattern mining · MKnap instanceopt rate: 33% -> 100%Improved
use FPMS instead of naive search ABSO+MinVSbranch-and-bound · MKnapoverall winning instances (naive : FPMS): 9 : 29Improved
use FPMS instead of naive search ABSO+BIVSbranch-and-bound · TTPPVoverall winning instances (naive : FPMS): 14 : 6Hurt
use FPMS instead of naive search DW+BIVSbranch-and-bound · TSPoverall winning instances (naive : FPMS): 11 : 4Hurt
use FPMS instead of naive search ABSO+OBSVSbranch-and-bound · TSPoverall winning instances (naive : FPMS): 1 : 14Improved
use FPMS instead of naive search DW+BIVSbranch-and-bound · UncapWLPoverall winning instances (naive : FPMS): 8 :7No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy