A generic method to compose an algorithm portfolio with a problem set of unknown distribution.
Wenwen LiuShiu Yin YuenChi Wan SungPublished in: Memetic Comput. (2022)
Keyphrases
- initial set
- input data
- method finds
- high accuracy
- dynamic programming
- cost function
- improved algorithm
- computational cost
- detection algorithm
- experimental evaluation
- objective function
- segmentation algorithm
- theoretical analysis
- preprocessing
- significant improvement
- computational complexity
- clustering method
- estimation algorithm
- computationally efficient
- optimization algorithm
- candidate set
- synthetic and real images
- recognition algorithm
- optimization method
- reduced set
- detection method
- classification algorithm
- matching algorithm
- classification method
- selection algorithm
- tree structure
- support vector machine svm
- high efficiency
- pruning strategy
- convergence rate
- k means
- boundary points
- nearest neighbour
- gaussian distribution
- em algorithm
- sample set
- input pattern
- decomposition algorithm
- learning algorithm
- reconstruction method
- density function
- segmentation method
- energy function
- scoring function
- camera pose
- image set
- convex hull
- np hard
- feature set
- probabilistic model
- optimal solution
- particle swarm optimization