Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality.
Min XieRaymond Chi-Wing WongJian LiCheng LongAshwin LallPublished in: SIGMOD Conference (2018)
Keyphrases
- worst case
- optimal solution
- single pass
- dynamic programming
- learning algorithm
- objective function
- lower bound
- error bounds
- query processing
- confidence bounds
- expectation maximization
- computationally efficient
- search space
- high dimensional
- preprocessing
- computational complexity
- convergence rate
- high efficiency
- segmentation algorithm
- cost function
- dimensionality reduction
- response time
- upper bound
- database
- k means
- image retrieval
- data structure
- information retrieval