When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems.
André ThomaserJacob de NobelDiederick VermettenFurong YeThomas BäckAnna V. KononovaPublished in: CoRR (2023)
Keyphrases
- continuous domains
- experimental evaluation
- cost function
- learning algorithm
- test problems
- k means
- benchmark problems
- optimization algorithm
- optimal solution
- dynamic programming
- np hard
- continuous optimization
- continuous variables
- segmentation algorithm
- optimal or near optimal
- improved algorithm
- clustering method
- classification algorithm
- packing problem
- detection algorithm
- recognition algorithm
- continuous attributes
- tree structure
- simulated annealing
- computational complexity
- convex hull
- combinatorial optimization
- neural network
- theoretical analysis
- computationally efficient
- input data
- preprocessing
- bayesian networks
- sequence prediction