A Fully Dynamic Algorithm for k-Regret Minimizing Sets.
Yanhao WangYuchen LiRaymond Chi-Wing WongKian-Lee TanPublished in: ICDE (2021)
Keyphrases
- np hard
- high accuracy
- dynamic programming
- optimization algorithm
- cost function
- computational cost
- preprocessing
- significant improvement
- segmentation algorithm
- input data
- convergence rate
- k means
- lower bound
- computational complexity
- experimental evaluation
- upper bound
- worst case
- optimal solution
- objective function
- clustering method
- learning algorithm
- matching algorithm
- detection algorithm
- weighted majority
- expectation maximization
- particle swarm optimization
- online learning
- simulated annealing
- support vector
- similarity measure