On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem.
Max Hahn-KlimrothRemco van der HofstadNoëla MüllerConnor RiddlesdenPublished in: CoRR (2023)
Keyphrases
- input data
- noisy data
- single pass
- data reduction
- detection algorithm
- computational complexity
- sparse data
- data sets
- computational cost
- learning algorithm
- computationally efficient
- data structure
- np hard
- information loss
- original data
- data analysis
- image data
- objective function
- synthetic data
- database
- synthetic datasets
- similarity measure
- dynamic programming
- cost function
- k means
- preprocessing
- clustering method
- matching algorithm
- optimization algorithm
- expectation maximization
- probability distribution
- skyline queries