A simulated annealing-based algorithm for selecting balanced samples.
Roberto BenedettiMaria Michela DicksonGiuseppe EspaFrancesco PantaloneFederica PiersimoniPublished in: Comput. Stat. (2022)
Keyphrases
- simulated annealing
- computational complexity
- detection algorithm
- learning algorithm
- experimental evaluation
- similarity measure
- selection algorithm
- times faster
- preprocessing
- np hard
- improved algorithm
- hybrid algorithm
- dynamic programming
- cost function
- optimal solution
- input data
- computationally efficient
- theoretical analysis
- segmentation algorithm
- evolutionary algorithm
- classification algorithm
- optimization method
- optimization algorithm
- genetic algorithm
- objective function
- solution quality
- combinatorial optimization
- data structure
- matching algorithm
- k means
- high accuracy
- worst case
- computational cost
- significant improvement