A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons.
Stefano LeucciChih-Hung LiuPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- preprocessing
- learning algorithm
- optimal solution
- selection algorithm
- times faster
- search space
- globally optimal
- locally optimal
- improved algorithm
- expectation maximization
- worst case
- piecewise linear
- optimization algorithm
- significant improvement
- experimental evaluation
- probabilistic model
- cost function
- computationally efficient
- detection algorithm
- tree structure
- k means
- neural network
- recognition algorithm
- minimum length
- selection strategy
- minimum cost
- weighting coefficients
- closed form
- simulated annealing
- high accuracy
- np hard
- computational complexity
- objective function
- similarity measure
- image segmentation