Greedy $k$-Center from Noisy Distance Samples.
Neharika JaliNikhil KaramchandaniSharayu MoharirPublished in: ISIT (2021)
Keyphrases
- greedy algorithm
- distance function
- dynamic programming
- data sets
- training samples
- distance measure
- sparsely sampled
- noisy environments
- feature selection
- machine learning
- evolutionary algorithm
- active learning
- search space
- search algorithm
- missing data
- euclidean distance
- distance metric
- neural network
- real time
- sampling methods
- forward selection
- database