A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time.
Yichuan DengZhao SongYitan WangYuanyuan YangPublished in: CoRR (2022)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- learning algorithm
- detection algorithm
- neural network
- locally optimal
- matching algorithm
- preprocessing
- worst case time complexity
- simulated annealing
- computational cost
- objective function
- similarity measure
- computational complexity
- search space
- probabilistic model
- high accuracy
- linear programming
- cost function
- recognition algorithm
- memory requirements
- scales linearly
- bayesian networks
- fixed size
- optimal parameters
- improved algorithm
- upper bound
- np hard
- expectation maximization
- times faster
- convergence rate
- standard deviation
- computationally efficient
- space complexity
- window size
- particle swarm optimization
- input data
- lower bound
- experimental evaluation