Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm.
Karl Heinz BorgwardtPublished in: Discret. Comput. Geom. (2007)
Keyphrases
- average case
- worst case
- dynamic programming
- computational complexity
- k means
- segmentation algorithm
- theoretical analysis
- similarity measure
- objective function
- learning algorithm
- convergence rate
- np hard
- optimal solution
- competitive ratio
- pairwise
- noisy data
- uniform distribution
- worst case analysis
- upper bound
- feature space
- machine learning