Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm.
Sepideh MahabadiPiotr IndykShayan Oveis GharanAlireza RezaeiPublished in: ICML (2019)
Keyphrases
- objective function
- experimental evaluation
- improved algorithm
- preprocessing
- learning algorithm
- high accuracy
- worst case
- optimal solution
- genetic algorithm
- dynamic programming
- cost function
- k means
- search space
- computational complexity
- times faster
- detection algorithm
- segmentation algorithm
- theoretical analysis
- computational cost
- particle swarm optimization
- data sets
- np hard
- similarity measure
- input data
- significant improvement
- experimental study
- memory requirements
- convergence rate
- recognition algorithm
- image processing
- optimal or near optimal
- minimum length